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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
356 | Computational grids typically consist of nodes utilizing ordinary processors such as the Intel Pentium. Field Programmable Gate Arrays (FPGAs) are able to perform certain compute-intensive tasks very well due to their inherent parallel architecture, often resulting in orders of magnitude speedups. This paper explores how FPGAs can be transparently exposed for remote use via grid services, by integrating the Proteus Software Platform with the Globus Toolkit 3.0. | 2022-03-18T14:29:08.602Z | {
"ACL": null,
"DBLP": "journals/corr/cs-DC-0411050",
"ArXiv": "cs/0411050",
"MAG": "1628548895",
"CorpusId": "356",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/c7aa9f5aeba24f778180734f0a9bfa24e9c2cf9d | Utilizing Reconfigurable Hardware Processors via Grid Services | [
{
"authorId": "144467855",
"name": "D. Nathan"
},
{
"authorId": "2067402032",
"name": "Ralf Clemens"
}
] | ArXiv | 2,004 | 4 | 2 | 1 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2004-11-15T00:00:00 | {
"name": "ArXiv",
"volume": "cs.DC/0411050",
"pages": null
} | [
"grid services",
"fpgas",
"parallel architectures",
"reconfigurable hardware",
"programmable gate array",
"computational grids",
"software",
"globus toolkit"
] | [
"computer hardware",
"reconfigurable hardware",
"fpgas",
"multiprocessors",
"computational grids",
"grid services",
"programmable gate array",
"parallel architectures",
"software",
"globus toolkit",
"field programmable gate array",
"grid systems",
"grid environments",
"grid middleware",
"grid infrastructures"
] | [
"multiprocessors",
"grid services",
"grid middleware",
"computer hardware",
"fpgas",
"parallel architectures",
"reconfigurable hardware",
"grid environments",
"grid systems",
"programmable gate array",
"computational grids",
"software",
"grid infrastructures",
"field programmable gate array",
"globus toolkit"
] | [
"multiprocessing systems",
"multi core",
"embedded systems",
"grid computing",
"computer science",
"reconfigurable architectures",
"parallel processing systems",
"logic gates",
"microprocessor chips",
"program processors",
"computer systems",
"distributed systems",
"distributed computer systems"
] |
357 | Superregular matrices are a class of lower triangular Toeplitz matrices that arise in the context of constructing convolutional codes having a maximum distance profile. These matrices are characterized by the property that no submatrix has a zero determinant unless it is trivially zero due to the lower triangular structure. In this paper, we discuss how superregular matrices may be used to construct codes having a maximum distance profile. We also introduce group actions that preserve the superregularity property and present an upper bound on the minimum size a finite field must have in order that a superregular matrix of a given size can exist over that field. | 2022-09-04T20:11:47.246Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0607089",
"ArXiv": "cs/0607089",
"MAG": "1541188118",
"CorpusId": "357",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/cec039bccba18f8e38e81505df72403325eb9469 | Superregular Matrices and the Construction of Convolutional Codes having a Maximum Distance Profile | [
{
"authorId": "47367633",
"name": "Ryan Hutchinson"
},
{
"authorId": "3057970",
"name": "R. Smarandache"
},
{
"authorId": "1795779",
"name": "J. Trumpf"
}
] | ArXiv | 2,006 | 34 | 2 | 2 | false | [
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2006-07-18T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0607089",
"pages": null
} | [
"convolutional codes",
"finite fields"
] | [
"convolutional codes",
"block codes",
"finite fields",
"turbo codes",
"concatenated codes"
] | [
"concatenated codes",
"convolutional codes",
"finite fields",
"turbo codes",
"block codes"
] | [
"iterative decoding",
"bit error rate",
"information theory",
"cryptography",
"quadrature amplitude modulation",
"signal encoding",
"low-density parity-check codes",
"code division multiple access",
"additive white gaussian noise",
"data communication systems",
"communication channels",
"signal to noise ratio",
"probability",
"communication",
"cryptology",
"fading (radio)",
"rayleigh fading",
"orthogonal frequency division multiplexing",
"channel capacity",
"graph theory",
"matrix algebra",
"white noise",
"gaussian noise (electronic)",
"computer systems",
"wireless telecommunication systems",
"signal processing",
"mathematics",
"computer security",
"signal detection",
"fading channels",
"theoretical computer science",
"computer science",
"computer networks",
"communication systems",
"telecommunication systems",
"engineering"
] |
361 | In this work we introduce Dynamic Random Geometric Graphs as a basic rough model for mobile wireless sensor networks, where communication distances are set to the known threshold for connectivity of static random geometric graphs. We provide precise asymptotic results for the expected length of the connectivity and disconnectivity periods of the network. We believe the formal tools developed in this work could be of use in future studies in more concrete settings. In addition, for static random geometric graphs at the threshold for connectivity, we provide asymptotic expressions on the probability of existence of components according to their sizes. | 2022-08-26T23:49:00.014Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0702074",
"ArXiv": null,
"MAG": "2949445683",
"CorpusId": "361",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/baa9cb6b4dad8ca9cc4bc97340ce49a7931e2071 | Dynamic Random Geometric Graphs | [
{
"authorId": "145486523",
"name": "J. Díaz"
},
{
"authorId": "1703457",
"name": "D. Mitsche"
},
{
"authorId": "1398691456",
"name": "X. Pérez-Giménez"
}
] | SODA 2007 | 2,007 | 21 | 4 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-02-13T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0702074",
"pages": null
} | [
"communication",
"wireless sensor networks",
"probability",
"asymptotic expressions"
] | [
"wireless",
"wireless sensor",
"wireless sensor networks",
"sensor networks",
"sensors",
"communication",
"asymptotic expressions",
"probability",
"wireless communications",
"network architecture",
"geometry",
"directed graphs",
"digraph",
"graph structures",
"bipartite graphs",
"weighted graph",
"wsns",
"mobile sensor networks",
"communication networks"
] | [
"weighted graph",
"network architecture",
"geometry",
"wireless communications",
"wireless sensor",
"bipartite graphs",
"wireless sensor networks",
"probability",
"wireless",
"sensors",
"digraph",
"graph structures",
"wsns",
"mobile sensor networks",
"communication networks",
"asymptotic expressions",
"communication",
"sensor networks",
"directed graphs"
] | [
"graphic methods",
"computer networks",
"wireless telecommunication systems",
"graph theory",
"energy utilization",
"sensor nodes",
"routing algorithms",
"mathematics",
"radio",
"computer hardware",
"telecommunication networks",
"amplify-and-forward (af)",
"closed-form expression",
"routers",
"embedded systems",
"computer science",
"communication systems",
"telecommunication systems",
"theoretical computer science",
"electricity",
"fading channels",
"rayleigh fading",
"bit error rate",
"telecommunication traffic",
"bandwidth",
"computer systems",
"engineering",
"communication channels",
"signal to noise ratio",
"signal processing"
] |
363 | In this paper, we suggest an architecture for a software agent which operates a physical device and is capable of making observations and of testing and repairing the device's components. We present simplified definitions of the notions of symptom, candidate diagnosis, and diagnosis which are based on the theory of action language ${\cal AL}$. The definitions allow one to give a simple account of the agent's behavior in which many of the agent's tasks are reduced to computing stable models of logic programs. | 2022-09-02T21:46:42.504Z | {
"ACL": null,
"DBLP": "journals/tplp/BalducciniG03",
"ArXiv": "cs/0312040",
"MAG": "2025008902",
"CorpusId": "363",
"PubMed": null,
"DOI": "10.1017/S1471068403001807",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/f44965c9ff742125c06112a2bd1b6bd0ec39e710 | Diagnostic reasoning with A-Prolog | [
{
"authorId": "1729002",
"name": "M. Balduccini"
},
{
"authorId": "1719720",
"name": "M. Gelfond"
}
] | Theory and Practice of Logic Programming | 2,003 | 50 | 150 | 7 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2003-07-01T00:00:00 | {
"name": "Theory and Practice of Logic Programming",
"volume": "3",
"pages": "425 - 461"
} | [
"reasoning",
"logic programs",
"software agents",
"action language",
"stable model"
] | [
"reasoning",
"software",
"software agents",
"intelligent agents",
"action language",
"stable model",
"logic programs"
] | [
"reasoning",
"logic programs",
"software agents",
"action language",
"intelligent agents",
"software",
"stable model"
] | [
"ontology",
"formal languages",
"logic programming",
"multiagent system",
"answer set programming",
"computer science",
"semantics",
"linguistics",
"formal languages and automata theory",
"computer programming languages",
"formal logic",
"artificial intelligence",
"knowledge representation",
"theoretical computer science",
"computer programming",
"knowledge based systems"
] |
364 | The activity of design involves the decomposition of problems into subproblems and the development and evaluation of solutions. In many cases, solution development is not done from scratch. Designers often evoke and adapt solutions developed in the past. These solutions may come from an internal source, i.e. the memory of the designers, and/or from an external source. The goal of this paper is to analyse the characteristics of the cognitive mechanisms, the knowledge and the representations involved in the code reuse activity performed by experienced programmers. More generally, the focus is the control structure of the reuse activity. Data collected in an experiment in which programmers had to design programs are analyzed. Two code reuse situations are distinguished depending on whether or not the processes involved in reuse start before the elaboration of what acts as a source-solution. Our analysis highlights the use of reasoning from a schema and from an analog in the code reuse activity. | 2022-09-03T13:43:22.761Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0701200",
"ArXiv": "cs/0701200",
"MAG": "2951954900",
"CorpusId": "364",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/6bb9722017eb59bbdb9357a6b3a33b39ac1efab3 | Reasoning from a schema and from an analog in software code reuse | [
{
"authorId": "1693932",
"name": "F. Détienne"
}
] | ArXiv | 2,007 | 37 | 12 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-01-31T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0701200",
"pages": null
} | [
"reasoning",
"software"
] | [
"reasoning",
"software",
"reusability",
"software reuse",
"relational schemas"
] | [
"reasoning",
"reusability",
"software reuse",
"software",
"relational schemas"
] | [
"ontology",
"formal languages",
"computer software reusability",
"computer science",
"relational data models",
"semantics",
"linguistics",
"formal languages and automata theory",
"software design",
"object oriented programming",
"computer programming languages",
"relational database",
"theoretical computer science",
"software engineering",
"computer programming",
"knowledge based systems",
"query languages",
"artificial intelligence",
"database systems",
"computer systems"
] |
366 | This paper studies the use of the proportional fairness (PF) utility function as the basis for capacity allocation and scheduling in multi-channel multi-rate wireless networks. Examples of applications include (i) access point (AP) association and transmission scheduling in large-scale IEEE 802.11 networks; and (ii) subcarrier assignment and transmission scheduling in orthogonal frequency division multiplexing (OFDM) cellular networks. The contributions of this paper are twofold. First, we study the fundamental properties and physical/economic interpretation of PF. We show by general mathematical arguments that PF leads to equal airtime allocation to individual users for the single-channel case; and equal equivalent airtime allocation to individual users for the multi-channel case, where the equivalent airtime enjoyed by a user is a weighted sum of the airtimes enjoyed by the user on all channels, with the weight of a channel being the price or value of that channel. In addition, we establish the Pareto efficiency of PF solutions and derive characteristics of PF solutions that are useful for the construction of PF algorithms. Second, we generate numerical results for application (i) above. We find that the PF solution simultaneously achieves higher system throughput, better fairness, and lower outage probability with respect to the default AP-association and medium access control (MAC) protocol adopted in today's 802.11 commercial products. | 2022-08-27T10:26:05.352Z | {
"ACL": null,
"DBLP": "conf/globecom/LiewZ06",
"ArXiv": null,
"MAG": "2010174731",
"CorpusId": "366",
"PubMed": null,
"DOI": "10.1109/GLOCOM.2006.836",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/632efd8606401ac436f501d9900aae74f2444940 | WLC38-2: Proportional Fairness in Multi-channel Multi-rate Wireless Networks | [
{
"authorId": "1736584",
"name": "S. Liew"
},
{
"authorId": "38091476",
"name": "Y. Zhang"
}
] | IEEE Globecom 2006 | 2,006 | 23 | 7 | 0 | false | [
{
"category": "Business",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2006-11-01T00:00:00 | {
"name": "IEEE Globecom 2006",
"volume": null,
"pages": "1-6"
} | [
"proportional fairness",
"pareto efficiency",
"numerical results",
"ofdm",
"medium access control",
"mac protocol",
"economics",
"cellular network",
"access points",
"utility functions",
"orthogonal frequency division",
"wireless networks",
"frequency division multiplexing",
"outage probability"
] | [
"proportional fairness",
"wireless",
"wireless networks",
"utility functions",
"access points",
"orthogonal frequency division",
"ofdm",
"cellular",
"cellular network",
"economics",
"pareto",
"numerical results",
"outages",
"outage probability",
"probability",
"medium access",
"medium access control",
"mac protocol",
"access control",
"orthogonal frequency division multiplexing",
"radio channels",
"wireless communications",
"mac layer",
"wireless local area networks (wlan)",
"network architecture",
"wireless channel",
"control channels",
"mobile networks",
"subchannels",
"pareto frontiers",
"pareto front",
"pareto optimal solutions",
"computational efficiency",
"wireless ad hoc networks",
"communication networks",
"mesh network",
"frequency division multiple access",
"sc-fdma",
"cellular system",
"channel utilization",
"average spectral efficiency",
"outage performance",
"ergodic capacity"
] | [
"network architecture",
"pareto",
"probability",
"communication networks",
"access control",
"outages",
"cellular network",
"radio channels",
"utility functions",
"control channels",
"orthogonal frequency division",
"mesh network",
"ergodic capacity",
"pareto efficiency",
"proportional fairness",
"sc-fdma",
"wireless",
"mac protocol",
"medium access",
"wireless networks",
"economics",
"pareto front",
"orthogonal frequency division multiplexing",
"mobile networks",
"cellular system",
"wireless communications",
"pareto frontiers",
"computational efficiency",
"access points",
"mac layer",
"pareto optimal solutions",
"frequency division multiplexing",
"outage probability",
"wireless local area networks (wlan)",
"wireless ad hoc networks",
"channel utilization",
"numerical results",
"ofdm",
"outage performance",
"wireless channel",
"medium access control",
"frequency division multiple access",
"cellular",
"average spectral efficiency",
"subchannels"
] | [
"computer networks",
"pareto principle",
"mathematics",
"telecommunication networks",
"communication",
"computer security",
"fading (radio)",
"fading channels",
"wireless telecommunication systems",
"radio transmission",
"antennas",
"game theory",
"cognitive radio",
"radio systems",
"mobile telecommunication systems",
"orthogonal functions",
"multiplexing",
"wireless mesh networks (wmn)",
"channel state information",
"closed-form expression",
"radio",
"carrier sense multiple access",
"ad hoc networks",
"packet networks",
"cellular telephone systems",
"cellular radio systems",
"channel capacity",
"theoretical computer science",
"wireless sensor networks",
"optimal solutions",
"frequency allocation",
"local area networks",
"numerical methods",
"cooperative communication",
"network protocols",
"adaptive modulation",
"spectral efficiencies",
"computer science",
"multi-objective optimisation",
"telecommunication systems",
"bit error rate",
"signal detection",
"communication channels",
"signal to noise ratio",
"communication systems",
"artificial intelligence",
"routers",
"routing algorithms",
"rayleigh fading",
"transmitters",
"mimo systems",
"internet protocols",
"quality of service",
"multicasts",
"sensors",
"telecommunication traffic",
"mobile computing",
"information theory",
"energy utilization",
"sensor nodes",
"computer systems",
"data communication systems",
"internet",
"quadrature amplitude modulation",
"power control",
"evolutionary algorithms",
"signal processing",
"bandwidth",
"signal receivers",
"computer hardware",
"electricity",
"code division multiple access",
"genetic algorithms",
"engineering"
] |
368 | Attribute grammars (AGs) are known to be a useful formalism for semantic analysis and translation. However, debugging AGs is complex owing to inherent difficulties of AGs, such as recursive grammar structure and attribute dependency. In this paper, a new systematic method of debugging AGs is proposed. Our approach is, in principle, based on previously proposed algorithmic debugging of AGs, but is more general. This easily enables integration of various query-based systematic debugging methods, including the slice-based method. The proposed method has been implemented in Aki, a debugger for AG description. We evaluated our new approach experimentally using Aki, which demonstrates the usability of our debugging method. | 2022-06-20T11:25:31.588Z | {
"ACL": null,
"DBLP": "journals/corr/cs-SE-0310026",
"ArXiv": "cs/0310026",
"MAG": "1727980897",
"CorpusId": "368",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/357187e9b5fe1c977bf713837e3db5df6b577060 | Generalized Systematic Debugging for Attribute Grammars | [
{
"authorId": "2057655608",
"name": "Akira Sasaki"
},
{
"authorId": "2600895",
"name": "M. Sassa"
}
] | ArXiv | 2,003 | 18 | 1 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2003-10-15T00:00:00 | {
"name": "ArXiv",
"volume": "cs.SE/0310026",
"pages": null
} | [
"computer debugging",
"program debugging",
"semantic information",
"attribute grammars"
] | [
"computer debugging",
"program debugging",
"attribute grammars",
"semantics",
"semantic information"
] | [
"semantic information",
"attribute grammars",
"computer debugging",
"program debugging",
"semantics"
] | [
"context sensitive grammars",
"program compilers",
"software",
"software quality",
"computer programming",
"formal languages",
"graph theory",
"parallel processing systems",
"computer programming languages",
"computer science",
"software design",
"linguistics",
"formal languages and automata theory",
"theoretical computer science",
"distributed systems",
"software engineering",
"distributed computer systems",
"computer systems"
] |
371 | This paper proposes an efficient example sampling method for example-based word sense disambiguation systems. To construct a database of practical size, a considerable overhead for manual sense disambiguation (overhead for supervision) is required. In addition, the time complexity of searching a large-sized database poses a considerable problem (overhead for search). To counter these problems, our method selectively samples a smaller-sized effective subset from a given example set for use in word sense disambiguation. Our method is characterized by the reliance on the notion of training utility: the degree to which each example is informative for future example sampling when used for the training of the system. The system progressively collects examples by selecting those with greatest utility. The paper reports the effectiveness of our method through experiments on about one thousand sentences. Compared to experiments with other example sampling methods, our method reduced both the overhead for supervision and the overhead for search, without the degeneration of the performance of the system. | 2022-09-04T21:11:44.282Z | {
"ACL": "J98-4002",
"DBLP": "journals/corr/cs-CL-9910020",
"ArXiv": "cs/9910020",
"MAG": "2951713946",
"CorpusId": "371",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/176ce079bd5efa86677aea8804158dc29b651e45 | Selective Sampling for Example-based Word Sense Disambiguation | [
{
"authorId": "143800037",
"name": "Atsushi Fujii"
},
{
"authorId": "3040648",
"name": "Kentaro Inui"
},
{
"authorId": "37090109",
"name": "T. Tokunaga"
},
{
"authorId": "2911717",
"name": "Hozumi Tanaka"
}
] | Comput. Linguistics | 1,998 | 95 | 144 | 6 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 1998-12-01T00:00:00 | {
"name": "ArXiv",
"volume": "cs.CL/9910020",
"pages": null
} | [
"database systems",
"word sense disambiguation"
] | [
"word sense",
"word sense disambiguation",
"database systems",
"part of speech",
"named entity recognition"
] | [
"part of speech",
"word sense",
"word sense disambiguation",
"database systems",
"named entity recognition"
] | [
"natural language processing",
"word segmentation",
"computer systems",
"computational linguistics",
"information retrieval",
"artificial intelligence",
"natural languages",
"character recognition",
"computer science",
"linguistics",
"semantics",
"pattern recognition",
"machine learning"
] |
372 | In this paper, we investigate the issue of vertical handoffs in heterogeneous wireless networks. A QoS-based vertical handoff scheme for WLAN and WiMAX interworking networks is proposed with aim to provide always best service to users. We also present a simple, yet efficient method to estimate the available bandwidth in WLAN and WiMAX networks to evaluate the real-time status of the overlay networks and make a handoff decision based on the information. By our proposal, a handoff process will not only be triggered by unaccepted signal strength but also by unsatisfied QoS parameters. Simulation results show that the proposed scheme can keep stations always be best connected with their QoS requirements met. | 2022-09-02T10:15:09.924Z | {
"ACL": null,
"DBLP": "conf/globecom/MaM09",
"ArXiv": null,
"MAG": "2148370346",
"CorpusId": "372",
"PubMed": null,
"DOI": "10.1109/GLOCOM.2009.5426198",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/08b8f5bce2d69f80bbfb2112b4384f28772c9eab | A QoS-Based Vertical Handoff Scheme for Interworking of WLAN and WiMAX | [
{
"authorId": "46604989",
"name": "D. Ma"
},
{
"authorId": "144637915",
"name": "M. Ma"
}
] | GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference | 2,009 | 10 | 42 | 2 | false | [
{
"category": "Business",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 2009-11-30T00:00:00 | {
"name": "GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference",
"volume": null,
"pages": "1-6"
} | [
"vertical handoff",
"handoff decision",
"wimax",
"qos parameters",
"wimax networks",
"qos requirements",
"wireless networks",
"available bandwidth",
"heterogeneous wireless network",
"overlay networks",
"wireless local area networks (wlan)"
] | [
"qos",
"qos requirements",
"vertical handoff",
"handoff decision",
"heterogeneous wireless network",
"wireless local area networks (wlan)",
"wimax",
"wireless",
"wireless networks",
"overlay networks"
] | [
"vertical handoff",
"qos",
"wireless local area networks (wlan)",
"qos parameters",
"wimax",
"wireless",
"wimax networks",
"qos requirements",
"wireless networks",
"available bandwidth",
"heterogeneous wireless network",
"overlay networks",
"handoff decision"
] | [
"quality of service",
"local area networks",
"mobile telecommunication systems",
"radio",
"wireless communications",
"packet networks",
"bandwidth",
"peer-to-peer",
"routers",
"multicasts",
"heterogeneous networks",
"telecommunication traffic",
"wireless telecommunication systems",
"communication channels",
"telecommunication networks",
"computer networks",
"internet",
"distributed computer systems",
"data communication systems",
"communication systems",
"telecommunication systems",
"computer science",
"computer systems"
] |
374 | This paper has made some significant advances in the boundary-only and domain-type RBF techniques. The proposed boundary knot method (BKM) is different from the standard boundary element method in a number of important aspects. Namely, it is truly meshless, exponential convergence, integration-free (of course, no singular integration), boundary-only for general problems, and leads to symmetric matrix under certain conditions (able to be extended to general cases after further modified). The BKM also avoids the artificial boundary in the method of fundamental solution. An amazing finding is that the BKM can formulate linear modeling equations for nonlinear partial differential systems with linear boundary conditions. This merit makes it circumvent all perplexing issues in the iteration solution of nonlinear equations. On the other hand, by analogy with Green's second identity, we also presents a general solution RBF (GSR) methodology to construct efficient RBFs in the domain-type RBF collocation method and dual reciprocity method. The GSR approach first establishes an explicit relationship between the BEM and RBF itself on the ground of the potential theory. This paper also discusses some essential issues relating to the RBF computing, which include time-space RBFs, direct and indirect RBF schemes, finite RBF method, and the application of multipole and wavelet to the RBF solution of the PDEs. | 2022-09-05T03:23:57.957Z | {
"ACL": null,
"DBLP": "journals/corr/cs-CE-0207017",
"ArXiv": "cs/0207017",
"MAG": "2952759551",
"CorpusId": "374",
"PubMed": null,
"DOI": "10.1515/IJNSNS.2000.1.3.145",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/c52b33e215cf1745eb7d215b2733638de217d522 | New Insights in Boundary-only and Domain-type RBF Methods | [
{
"authorId": "153379704",
"name": "Wen Chen"
},
{
"authorId": "2110303863",
"name": "Masataka Tanaka"
}
] | ArXiv | 2,002 | 10 | 57 | 4 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 2002-07-04T00:00:00 | {
"name": "International Journal of Nonlinear Sciences and Numerical Simulation",
"volume": "1",
"pages": "145 - 152"
} | [
"mesh-less methods",
"fundamental solutions",
"wavelet",
"radial basis functions",
"collocation method",
"nonlinear equations",
"partial differential equations"
] | [
"radial basis functions",
"fundamental solutions",
"collocation method",
"nonlinear equations",
"partial differential equations",
"wavelet"
] | [
"mesh-less methods",
"wavelet",
"fundamental solutions",
"radial basis functions",
"collocation method",
"nonlinear equations",
"partial differential equations"
] | [
"galerkin methods",
"wavelet transforms",
"numerical methods",
"neural networks",
"differential equations",
"mathematics",
"image processing",
"machine learning",
"computer imaging and vision",
"artificial intelligence",
"computer science"
] |
375 | We introduce S-DUDE, a new algorithm for denoising discrete memoryless channel (DMC)-corrupted data. The algorithm, which generalizes the recently introduced DUDE (discrete universal denoiser), aims to compete with a genie that has access, in addition to the noisy data, also to the underlying clean data, and that can choose to switch, up to m times, between sliding-window denoisers in a way that minimizes the overall loss. When the underlying data form an individual sequence, we show that the S-DUDE performs essentially as well as this genie, provided that m is sublinear in the size of the data. When the clean data are emitted by a piecewise stationary process, we show that the S-DUDE achieves the optimum distribution-dependent performance, provided that the same sublinearity condition is imposed on the number of switches. To further substantiate the universal optimality of the S-DUDE, we show that when the number of switches is allowed to grow linearly with the size of the data, any (sequence of) scheme(s) fails to compete in the above sense. Using dynamic programming, we derive an efficient implementation of the S-DUDE, which has complexity (time and memory) growing linearly with the data size and the number of switches m . Preliminary experimental results are presented, suggesting that S-DUDE has the capacity to improve on the performance attained by the original DUDE in applications where the nature of the data abruptly changes in time (or space), as is often the case in practice. | 2022-09-04T07:06:13.766Z | {
"ACL": null,
"DBLP": "journals/tit/MoonW09",
"ArXiv": "0708.2566",
"MAG": "2163292085",
"CorpusId": "375",
"PubMed": null,
"DOI": "10.1109/TIT.2009.2030461",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/b2f42c11aaa856829a1d9d2ab60aecf2779c50fe | Discrete Denoising With Shifts | [
{
"authorId": "4842965",
"name": "Taesup Moon"
},
{
"authorId": "4820756",
"name": "T. Weissman"
}
] | IEEE Transactions on Information Theory | 2,007 | 52 | 18 | 2 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-08-19T00:00:00 | {
"name": "IEEE Transactions on Information Theory",
"volume": "55",
"pages": "5284-5301"
} | [
"memoryless"
] | [
"memoryless",
"integrated data",
"binary erasure channel",
"achievable rate region",
"additive noise"
] | [
"binary erasure channel",
"integrated data",
"additive noise",
"memoryless",
"achievable rate region"
] | [
"turbo codes",
"belief propagation",
"ldpc codes",
"channel coding",
"data integration",
"spurious signal noise",
"white noise",
"gaussian noise (electronic)",
"capacity regions",
"gaussians",
"interference channels",
"quadrature amplitude modulation",
"signal encoding",
"low-density parity-check codes",
"convolutional codes",
"code division multiple access",
"additive white gaussian noise",
"data communication systems",
"backpropagation algorithm",
"graph theory",
"image coding",
"bit error rate",
"fading channels",
"channel capacity",
"data handling",
"communication channels",
"signal to noise ratio",
"broadcast channels",
"gaussian distribution",
"multiplexing",
"transmitters",
"signal interference",
"mimo systems",
"information theory",
"fading (radio)",
"rayleigh fading",
"orthogonal frequency division multiplexing",
"iterative decoding",
"matrix algebra",
"computer systems",
"neural networks",
"theoretical computer science",
"image processing",
"probability",
"database systems",
"wireless telecommunication systems",
"signal processing",
"broadcasting",
"signal receivers",
"antennas",
"communication",
"signal detection",
"mathematics",
"computer science",
"machine learning",
"computer imaging and vision",
"computer networks",
"communication systems",
"telecommunication systems",
"engineering",
"artificial intelligence"
] |
378 | We explain how to optimize finite-length LDPC codes for transmission over the binary erasure channel. Our approach relies on an analytic approximation of the erasure probability. This is in turn based on a finite-length scaling result to model large scale erasures and a union bound involving minimal stopping sets to take into account small error events. We show that the performances of optimized ensembles as observed in simulations are well described by our approximation. Although we only address the case of transmission over the binary erasure channel, our method should be applicable to a more general setting. | 2022-09-05T02:23:47.013Z | {
"ACL": null,
"DBLP": "journals/ett/AmraouiMU07",
"ArXiv": "cs/0607064",
"MAG": "2951825454",
"CorpusId": "378",
"PubMed": null,
"DOI": "10.1002/ett.1182",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/29ca9a34af3e41994f2c582cb10846b92cb709b8 | How to find good finite-length codes: from art towards science | [
{
"authorId": "32503406",
"name": "A. Amraoui"
},
{
"authorId": "145071265",
"name": "A. Montanari"
},
{
"authorId": "1727633",
"name": "R. Urbanke"
}
] | Eur. Trans. Telecommun. | 2,006 | 10 | 41 | 1 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 2006-07-13T00:00:00 | {
"name": "Eur. Trans. Telecommun.",
"volume": "18",
"pages": "491-508"
} | [
"binary erasure channel",
"ldpc codes",
"probability"
] | [
"ldpc codes",
"binary erasure channel",
"probability",
"turbo codes",
"non-binary ldpc codes"
] | [
"binary erasure channel",
"turbo codes",
"probability",
"ldpc codes",
"non-binary ldpc codes"
] | [
"belief propagation",
"channel coding",
"quadrature amplitude modulation",
"signal encoding",
"low-density parity-check codes",
"convolutional codes",
"code division multiple access",
"additive white gaussian noise",
"data communication systems",
"mathematics",
"non-binary",
"backpropagation algorithm",
"graph theory",
"image coding",
"bit error rate",
"fading channels",
"channel capacity",
"fading (radio)",
"rayleigh fading",
"orthogonal frequency division multiplexing",
"communication channels",
"signal to noise ratio",
"iterative decoding",
"matrix algebra",
"information theory",
"white noise",
"gaussian noise (electronic)",
"computer systems",
"coding errors",
"neural networks",
"theoretical computer science",
"image processing",
"signal detection",
"wireless telecommunication systems",
"signal processing",
"communication",
"computer science",
"image compression",
"machine learning",
"computer imaging and vision",
"computer networks",
"communication systems",
"telecommunication systems",
"engineering",
"image quality",
"artificial intelligence",
"image analysis"
] |
379 | A context-free language is said to be simple if it is accepted by a single-state deterministic push-down store acceptor that operates in real-time and accepts by empty store. While the problem remains open of deciding whether or not the language accepted by a deterministic pushdown store acceptor is simple, it is shown that this problem is equivalent to another problem in schemata theory. This question is that of determining whether or not a monadic recursion scheme has a strongly equivalent free scheme. | 2022-08-30T09:34:32.203Z | {
"ACL": null,
"DBLP": "conf/focs/Friedman76",
"ArXiv": null,
"MAG": "2018555128",
"CorpusId": "379",
"PubMed": null,
"DOI": "10.1109/SFCS.1976.28",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/cd6b22bc233fa7b25f541475ffff0b1fc98f51bb | Simple languages and free schemes | [
{
"authorId": "46826384",
"name": "E. P. Friedman"
}
] | 17th Annual Symposium on Foundations of Computer Science (sfcs 1976) | 1,976 | 20 | 1 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 1976-10-25T00:00:00 | {
"name": "17th Annual Symposium on Foundations of Computer Science (sfcs 1976)",
"volume": null,
"pages": "159-165"
} | [
"recursion schemes",
"context free languages",
"deterministic"
] | [
"deterministic",
"combinatorial problems",
"combinatorial optimization",
"stochastic",
"push-down automata"
] | [
"recursion schemes",
"push-down automata",
"deterministic",
"combinatorial problems",
"combinatorial optimization",
"stochastic",
"context free languages"
] | [
"functional programs",
"model checking",
"translation (languages)",
"finite automata",
"combinatorial mathematics",
"optimization",
"stochastic processes",
"stochasticity",
"automata theory",
"formal languages",
"functional programming",
"embedded systems",
"architecture verification and validation",
"computational linguistics",
"linguistics",
"graph theory",
"mathematics",
"probability",
"numerical model",
"formal languages and automata theory",
"computer programming languages",
"computer systems",
"architecting",
"database systems",
"theoretical computer science",
"computer programming",
"computer science",
"software architecture",
"software design",
"software engineering"
] |
382 | In this paper we present a simple source code configuration tool. ExLibris operates on libraries and can be used to extract from local libraries all code relevant to a particular project. Our approach is not designed to address problems arising in code production lines, but rather, to support the needs of individual or small teams of researchers who wish to communicate their Prolog programs. In the process, we also wish to accommodate and encourage the writing of reusable code. Moreover, we support and propose ways of dealing with issues arising in the development of code that can be run on a variety of like-minded Prolog systems. With consideration to these aims we have made the following decisions: (i) support file-based source development, (ii) require minimal program transformation, (iii) target simplicity of usage, and (iv) introduce minimum number of new primitives. | 2022-06-20T11:57:21.747Z | {
"ACL": null,
"DBLP": "conf/lpe/Angelopoulos02",
"ArXiv": "cs/0207051",
"MAG": "2952754490",
"CorpusId": "382",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/908a39be587e71d579f5edee5787b81ed630d497 | Exporting Prolog source code | [
{
"authorId": "2609464",
"name": "N. Angelopoulos"
}
] | WLPE | 2,002 | 10 | 1 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2002-07-11T00:00:00 | {
"name": null,
"volume": null,
"pages": "89-96"
} | [
"libraries",
"source codes"
] | [
"source codes",
"libraries",
"binary codes",
"code generation",
"functional programs"
] | [
"functional programs",
"source codes",
"libraries",
"binary codes",
"code generation"
] | [
"functional programming",
"software engineering",
"education",
"information theory",
"program compilers",
"computer programming languages",
"computer science",
"communication",
"parallel processing systems",
"computer programming",
"distributed systems",
"distributed computer systems",
"computer systems"
] |
383 | There exist several methods of calculating a similarity curve, or a sequence of similarity values, representing the lexical cohesion of successive text constituents, e.g., paragraphs. Methods for deciding the locations of fragment boundaries are, however, scarce. We propose a fragmentation method based on dynamic programming. The method is theoretically sound and guaranteed to provide an optimal splitting on the basis of a similarity curve, a preferred fragment length, and a cost function defined. The method is especially useful when control on fragment size is of importance. | 2022-09-02T03:48:18.815Z | {
"ACL": "P98-2244",
"DBLP": "journals/corr/cs-CL-9812005",
"ArXiv": "cs/9812005",
"MAG": "2158652061",
"CorpusId": "383",
"PubMed": null,
"DOI": "10.3115/980691.980814",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/549b424c7280c16aeb5985719dddcd5fc634a983 | Optimal Multi-Paragraph Text Segmentation by Dynamic Programming | [
{
"authorId": "34729356",
"name": "O. Heinonen"
}
] | ACL | 1,998 | 13 | 66 | 7 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 1998-08-10T00:00:00 | {
"name": "ArXiv",
"volume": "cs.CL/9812005",
"pages": null
} | [] | [
"programming languages",
"semantic similarity",
"text document",
"textual data",
"text data"
] | [
"semantic similarity",
"textual data",
"programming languages",
"text document",
"text data"
] | [
"natural language processing",
"ontology",
"text mining",
"computer programming languages",
"linguistics",
"information retrieval systems",
"artificial intelligence",
"natural languages",
"semantics",
"text processing",
"computer programming",
"database systems",
"information retrieval",
"computer science",
"computational linguistics",
"data mining",
"computer systems"
] |
385 | We present a construction of LDPC codes that have minimum pseudocodeword weight equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a d-regular tree for a fixed number of layers and employing a connection algorithm based on mutually orthogonal Latin squares to close the tree. Methods are presented for degrees d = ps and d = ps + 1, for p a prime, one of which includes the well-known finite-geometry-based LDPC codes | 2022-09-03T21:04:37.505Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0506042",
"ArXiv": "cs/0506042",
"MAG": "2052702692",
"CorpusId": "385",
"PubMed": null,
"DOI": "10.1109/ISIT.2005.1523456",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/ea89dde08580d0c0bdf4aa4c61a7478924341fbf | Tree-based construction of LDPC codes | [
{
"authorId": "2331824",
"name": "D. Sridhara"
},
{
"authorId": "2686911",
"name": "C. Kelley"
},
{
"authorId": "145746733",
"name": "J. Rosenthal"
}
] | Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. | 2,005 | 12 | 4 | 2 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2005-06-12T00:00:00 | {
"name": "Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.",
"volume": null,
"pages": "845-849"
} | [
"iterative decoding",
"ldpc codes"
] | [
"ldpc codes",
"turbo codes",
"iterative decoding",
"geometry",
"non-binary ldpc codes"
] | [
"iterative decoding",
"geometry",
"turbo codes",
"ldpc codes",
"non-binary ldpc codes"
] | [
"bit error rate",
"information theory",
"quadrature amplitude modulation",
"signal encoding",
"low-density parity-check codes",
"convolutional codes",
"code division multiple access",
"additive white gaussian noise",
"data communication systems",
"non-binary",
"communication channels",
"signal to noise ratio",
"probability",
"communication",
"fading (radio)",
"rayleigh fading",
"orthogonal frequency division multiplexing",
"channel capacity",
"graph theory",
"matrix algebra",
"white noise",
"gaussian noise (electronic)",
"computer systems",
"coding errors",
"wireless telecommunication systems",
"signal processing",
"mathematics",
"signal detection",
"fading channels",
"theoretical computer science",
"computer science",
"image compression",
"computer networks",
"communication systems",
"telecommunication systems",
"engineering",
"image quality",
"image coding",
"image analysis",
"image processing",
"computer imaging and vision"
] |
386 | Density evolution (DE) is one of the most powerful analytical tools for low-density parity-check (LDPC) codes and graph codes with message passing decoding algorithms. With channel symmetry as one of its fundamental assumptions, density evolution has been widely and successfully applied to different channels, including binary erasure channels (BECs), binary symmetric channels (BSCs), binary additive white Gaussian noise (BiAWGN) channels, etc. This paper generalizes density evolution for asymmetric memoryless channels, which in turn broadens the applications to general memoryless channels, e.g., z-channels, composite white Gaussian noise channels, etc. The central theorem underpinning this generalization is the convergence to perfect projection for any fixed-size supporting tree. A new iterative formula of the same complexity is then presented and the necessary theorems for the performance concentration theorems are developed. Several properties of the new density evolution method are explored, including stability results for general asymmetric memoryless channels. Simulations, code optimizations, and possible new applications suggested by this new density evolution method are also provided. This result is also used to prove the typicality of linear LDPC codes among the coset code ensemble when the minimum check node degree is sufficiently large. It is shown that the convergence to perfect projection is essential to the belief propagation (BP) algorithm even when only symmetric channels are considered. Hence, the proof of the convergence to perfect projection serves also as a completion of the theory of classical density evolution for symmetric memoryless channels. | 2022-09-04T11:53:29.643Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0509014",
"ArXiv": "cs/0509014",
"MAG": "2147268943",
"CorpusId": "386",
"PubMed": null,
"DOI": "10.1109/TIT.2005.858931",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/2fd9612ca9433e8830f07ac083cc24a23d9147ce | Density evolution for asymmetric memoryless channels | [
{
"authorId": "121900082",
"name": "Chih-Chun Wang"
},
{
"authorId": "1697413",
"name": "S. Kulkarni"
},
{
"authorId": "145967056",
"name": "H. Poor"
}
] | IEEE Transactions on Information Theory | 2,005 | 65 | 80 | 8 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2005-09-05T00:00:00 | {
"name": "IEEE Transactions on Information Theory",
"volume": "51",
"pages": "4216-4236"
} | [
"binary erasure channel",
"white gaussian noise",
"optimization",
"check nodes",
"memoryless",
"ldpc codes",
"density evolution",
"belief propagation",
"binary symmetric channel"
] | [
"density evolution",
"memoryless",
"binary erasure channel",
"binary symmetric channel",
"ldpc codes",
"white gaussian noise",
"gaussian noise (electronic)",
"gaussians",
"optimization",
"belief propagation",
"additive noise",
"turbo codes",
"radio channels",
"additive gaussian noise",
"white noise",
"exit-charts",
"extrinsic information transfer charts",
"data channels",
"subchannels",
"physical channels",
"parity bits"
] | [
"binary erasure channel",
"gaussian noise (electronic)",
"physical channels",
"turbo codes",
"data channels",
"radio channels",
"ldpc codes",
"gaussians",
"additive noise",
"density evolution",
"parity bits",
"white gaussian noise",
"optimization",
"belief propagation",
"binary symmetric channel",
"extrinsic information transfer charts",
"white noise",
"additive gaussian noise",
"check nodes",
"exit-charts",
"memoryless",
"subchannels"
] | [
"channel coding",
"signal to noise ratio",
"virtual channels",
"quadrature amplitude modulation",
"signal encoding",
"low-density parity-check codes",
"convolutional codes",
"code division multiple access",
"additive white gaussian noise",
"data communication systems",
"control channels",
"fading (radio)",
"radio transmission",
"antennas",
"gaussian distribution",
"spurious signal noise",
"coding errors",
"distributed video coding",
"wyner-ziv",
"mathematics",
"backpropagation algorithm",
"graph theory",
"communication channels",
"capacity regions",
"frequency division multiple access",
"image coding",
"bit error rate",
"fading channels",
"channel capacity",
"signal processing",
"noc",
"routing algorithms",
"interconnection networks",
"rayleigh fading",
"orthogonal frequency division multiplexing",
"iterative decoding",
"matrix algebra",
"information theory",
"computer systems",
"cognitive radio",
"radio systems",
"medium access control",
"mobile telecommunication systems",
"signal detection",
"wireless telecommunication systems",
"image compression",
"programming theory",
"video coding",
"imaging systems",
"neural networks",
"theoretical computer science",
"broadcast channels",
"frequency allocation",
"image processing",
"probability",
"engineering",
"routers",
"microprocessor chips",
"network architecture",
"computer networks",
"parallel processing systems",
"communication",
"computer science",
"network protocols",
"telecommunication networks",
"communication systems",
"telecommunication systems",
"image quality",
"computer programming languages",
"video processing",
"visual communication",
"motion estimation",
"image reconstruction",
"machine learning",
"broadcasting",
"mimo systems",
"telecommunication traffic",
"computer imaging and vision",
"bandwidth",
"computer hardware",
"distributed systems",
"internet",
"image analysis",
"computer programming",
"artificial intelligence",
"distributed computer systems"
] |
388 | Sentiment analysis seeks to identify the viewpoint(s) underlying a text span; an example application is classifying a movie review as "thumbs up" or "thumbs down". To determine this sentiment polarity, we propose a novel machine-learning method that applies text-categorization techniques to just the subjective portions of the document. Extracting these portions can be implemented using efficient techniques for finding minimum cuts in graphs; this greatly facilitates incorporation of cross-sentence contextual constraints. | 2022-09-05T03:42:33.627Z | {
"ACL": "P04-1035",
"DBLP": "journals/corr/cs-CL-0409058",
"ArXiv": "cs/0409058",
"MAG": "2949380545",
"CorpusId": "388",
"PubMed": null,
"DOI": "10.3115/1218955.1218990",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/167e1359943b96b9e92ee73db1df69a1f65d731d | A Sentimental Education: Sentiment Analysis Using Subjectivity Summarization Based on Minimum Cuts | [
{
"authorId": "144865353",
"name": "B. Pang"
},
{
"authorId": "145810617",
"name": "Lillian Lee"
}
] | ACL | 2,004 | 29 | 3,625 | 361 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference",
"Review"
] | 2004-07-21T00:00:00 | {
"name": null,
"volume": null,
"pages": "271-278"
} | [
"sentiment analysis",
"machine learning",
"education",
"viewpoint",
"text classification"
] | [
"sentiment analysis",
"education",
"text classification",
"semantic orientation",
"sentiment classification"
] | [
"semantic orientation",
"sentiment analysis",
"machine learning",
"education",
"sentiment classification",
"viewpoint",
"text classification"
] | [
"opinion mining",
"natural language processing",
"computational linguistics",
"data mining",
"artificial intelligence",
"text processing",
"software architecture",
"natural languages",
"database systems",
"computer science",
"information retrieval",
"software design",
"linguistics",
"semantics",
"computer systems",
"software engineering"
] |
389 | The field of digital preservation is being defined by a set of standards developed top-down, starting with an abstract reference model (OAIS) and gradually adding more specific detail. Systems claiming conformance to these standards are entering production use. Work is underway to certify that systems conform to requirements derived from OAIS.
We complement these requirements derived top-down by presenting an alternate, bottom-up view of the field. The fundamental goal of these systems is to ensure that the information they contain remains accessible for the long term. We develop a parallel set of requirements based on observations of how existing systems handle this task, and on an analysis of the threats to achieving the goal. On this basis we suggest disclosures that systems should provide as to how they satisfy their goals. | 2022-09-04T22:39:36.330Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0509018",
"ArXiv": "cs/0509018",
"MAG": "2952528378",
"CorpusId": "389",
"PubMed": null,
"DOI": "10.1045/november2005-rosenthal",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/11add285b80c770528f7da47dc98d9e6ef8b27e3 | Requirements for Digital Preservation Systems: A Bottom-Up Approach | [
{
"authorId": "46838301",
"name": "D. Rosenthal"
},
{
"authorId": "2057022217",
"name": "Thomas Robertson"
},
{
"authorId": "2942799",
"name": "Thomas A. Lipkis"
},
{
"authorId": "2542136",
"name": "V. Reich"
},
{
"authorId": "34719093",
"name": "S. Morabito"
}
] | D Lib Mag. | 2,005 | 102 | 113 | 4 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2005-09-06T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0509018",
"pages": null
} | [
"digital preservation"
] | [
"digital preservation",
"long-term preservation",
"system requirements",
"quality requirements",
"functional requirement"
] | [
"system requirements",
"digital preservation",
"quality requirements",
"long-term preservation",
"functional requirement"
] | [
"requirements engineering",
"digital libraries",
"digital storage",
"software engineering",
"world wide web",
"database systems",
"user interfaces",
"computer hardware",
"computer science",
"internet",
"computer systems",
"human computer interaction"
] |
390 | We present the design and implementation of a new programming language for media-intensive applications called Flavor (Formal Language for Audio-Visual Object Representation). It is an extension of C++ and Java in which the typing system is extended to incorporate bitstream representation semantics. This allows to describe in a single place both the in-memory representation of data as well as their bitstream-level (compressed) representation as well. We have developed software tools (www.ee. columbia.edu/flavor) that automatically generate standard C++ and Java code from the Flavor source code, so that direct access to compressed multimedia information by application developers can be achieved with essentially zero programming. | 2022-09-04T04:53:20.033Z | {
"ACL": null,
"DBLP": "conf/mm/Eleftheriadis97",
"ArXiv": "cs/0301003",
"MAG": "2951551168",
"CorpusId": "390",
"PubMed": null,
"DOI": "10.1145/266180.266319",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/2a39f511e5051f04a6711769d3ced8c4adc907a5 | Flavor: a language for media representation | [
{
"authorId": "1792224",
"name": "A. Eleftheriadis"
}
] | MULTIMEDIA '97 | 1,997 | 40 | 43 | 4 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 1997-11-01T00:00:00 | {
"name": null,
"volume": null,
"pages": "1-9"
} | [
"formal languages",
"source codes",
"programming languages",
"audio-visual",
"software",
"semantics",
"bit stream",
"java"
] | [
"multimedia contents",
"programming languages",
"java",
"bit stream",
"semantics",
"software",
"source codes"
] | [
"formal languages",
"source codes",
"programming languages",
"audio-visual",
"software",
"semantics",
"bit stream",
"multimedia contents",
"java"
] | [
"linguistics",
"formal languages and automata theory",
"software engineering",
"computer programming languages",
"face recognition",
"computer science",
"programming theory",
"h.264/avc",
"bit rates",
"reconfigurable architectures",
"multimedia services",
"object oriented programming",
"high level languages",
"theoretical computer science",
"computer programming",
"pattern recognition",
"image processing",
"image coding",
"video processing",
"motion compensation",
"visual communication",
"multimedia systems",
"field programmable gate array",
"internet protocols",
"machine learning",
"computer imaging and vision",
"image compression",
"motion estimation",
"image segmentation",
"internet",
"computer hardware",
"telecommunication traffic",
"artificial intelligence",
"image quality",
"image analysis",
"telecommunication networks",
"telecommunication systems",
"computer systems"
] |
391 | There is a growing interest in discovery of internet topology at the interface level. A new generation of highly distributed measurement systems is currently being deployed. Unfortunately, the research community has not examined the problem of how to perform such measurements efficiently and in a network-friendly manner. In this paper we make two contributions toward that end. First, we show that standard topology discovery methods (e.g., skitter) are quite inefficient, repeatedly probing the same interfaces. This is a concern, because when scaled up, such methods will generate so much traffic that they will begin to resemble DDoS attacks. We measure two kinds of redundancy in probing (intra- and inter-monitor) and show that both kinds are important. We show that straightforward approaches to addressing these two kinds of redundancy must take opposite tacks, and are thus fundamentally in conflict. Our second contribution is to propose and evaluate Doubletree, an algorithm that reduces both types of redundancy simultaneously on routers and end systems. The key ideas are to exploit the tree-like structure of routes to and from a single point in order to guide when to stop probing, and to probe each path by starting near its midpoint. Our results show that Doubletree can reduce both types of measurement load on the network dramatically, while permitting discovery of nearly the same set of nodes and links. | 2022-09-04T22:43:15.616Z | {
"ACL": null,
"DBLP": "conf/sigmetrics/DonnetRFC05",
"ArXiv": "cs/0411013",
"MAG": "2949221082",
"CorpusId": "391",
"PubMed": null,
"DOI": "10.1145/1064212.1064256",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/cebb5bab51aa13082b635763e97e72381cf52482 | Efficient algorithms for large-scale topology discovery | [
{
"authorId": "151481640",
"name": "B. Donnet"
},
{
"authorId": "2257720",
"name": "Philippe Raoult"
},
{
"authorId": "13744465",
"name": "T. Friedman"
},
{
"authorId": "1685445",
"name": "M. Crovella"
}
] | SIGMETRICS '05 | 2,004 | 50 | 144 | 9 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2004-11-07T00:00:00 | {
"name": null,
"volume": null,
"pages": "327-338"
} | [
"topology",
"dos attacks",
"routers",
"efficient algorithm",
"internet"
] | [
"efficient algorithm",
"network topology",
"topology",
"internet",
"dos attacks",
"routers"
] | [
"network topology",
"topology",
"efficient algorithm",
"routers",
"dos attacks",
"internet"
] | [
"computer networks",
"computational efficiency",
"telecommunication traffic",
"bandwidth",
"computer crime",
"network security",
"computer science",
"theoretical computer science",
"telecommunication networks",
"security of data",
"cryptography",
"telecommunication systems",
"computer security",
"cryptology",
"computer systems"
] |
393 | Given a multiset X={x1,. . .,xn} of real numbers, the floating-point set summation problem asks for Sn=x1 + . . . + xn. Let $E^*_n$ denote the minimum worst-case error over all possible orderings of evaluating Sn. We prove that if X has both positive and negative numbers, it is NP-hard to compute Sn with the worst-case error equal to $E^*_n$. We then give the first known polynomial-time approximation algorithm that has a provably small error for arbitrary X. Our algorithm incurs a worst-case error at most $2(\lceil\log(n-1)\rceil+1)E^*_n$. (All logarithms log in this paper are base 2.) After X is sorted, it runs in O(n) time. For the case where X is either all positive or all negative, we give another approximation algorithm with a worst-case error at most $\lceil\log\log n\rceil E^*_n$. Even for unsorted X, this algorithm runs in O(n) time. Previously, the best linear-time approximation algorithm had a worst-case error at most $\lceil\log n\rceil E^*_n$, while $E^*_n$ was known to be attainable in O(n log n) time using Huffman coding. | 2022-08-29T02:47:46.283Z | {
"ACL": null,
"DBLP": "journals/siamcomp/KaoW00",
"ArXiv": "cs/9907015",
"MAG": "1532592410",
"CorpusId": "393",
"PubMed": null,
"DOI": "10.1137/S0097539798341594",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/d1aa2b4c7120bf30adc932706d909ef7e61a25f0 | Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors | [
{
"authorId": "1704494",
"name": "M. Kao"
},
{
"authorId": "2146041415",
"name": "Jie Wang"
}
] | SIAM J. Comput. | 1,999 | 13 | 6 | 0 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 1999-07-09T00:00:00 | {
"name": "ArXiv",
"volume": "cs.DS/9907015",
"pages": null
} | [
"huffman coding",
"polynomial-time approximation algorithms",
"real number",
"approximation algorithms"
] | [
"approximation algorithms",
"real number",
"huffman",
"huffman coding",
"adaptive algorithms",
"approximation scheme",
"polynomial-time approximation algorithms",
"approximation ratios",
"huffman code"
] | [
"huffman code",
"huffman coding",
"approximation scheme",
"approximation ratios",
"polynomial-time approximation algorithms",
"real number",
"adaptive algorithms",
"approximation algorithms",
"huffman"
] | [
"data compression",
"polynomial approximation",
"number theory",
"software",
"graph theory",
"approximation theory",
"image compression",
"numerical methods",
"computer science",
"theoretical computer science",
"mathematics",
"image quality",
"image coding",
"image analysis",
"image processing",
"computer imaging and vision"
] |
394 | We consider two optimization problems related to finding dense subgraphs. The densest at-least-k-subgraph problem (DalkS) is to find an induced subgraph of highest average degree among all subgraphs with at least k vertices, and the densest at-most-k-subgraph problem (DamkS) is defined similarly. These problems are related to the well-known densest k-subgraph problem (DkS), which is to find the densest subgraph on exactly k vertices. We show that DalkS can be approximated efficiently, while DamkS is nearly as hard to approximate as the densest k-subgraph problem. | 2022-09-04T23:47:53.474Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0702032",
"ArXiv": "cs/0702032",
"MAG": "1664024785",
"CorpusId": "394",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/a50b08abaf57c04f65a5d64392da73b7676feffc | Finding large and small dense subgraphs | [
{
"authorId": "33559242",
"name": "R. Andersen"
}
] | ArXiv | 2,007 | 16 | 13 | 0 | false | [
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-02-05T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0702032",
"pages": null
} | [
"induced subgraphs",
"optimization problems"
] | [
"induced subgraphs",
"optimization",
"optimization problems",
"combinatorial optimization",
"combinatorial problems"
] | [
"optimization",
"combinatorial problems",
"induced subgraphs",
"combinatorial optimization",
"optimization problems"
] | [
"mathematics",
"combinatorial mathematics",
"graph g",
"correlation analysis",
"graph theory",
"polynomial approximation",
"graphic methods",
"theoretical computer science",
"computer science"
] |
395 | We consider a network of sensors deployed to sense a spatio-temporal field and infer parameters of interest about the field. We are interested in the case where each sensor's observation sequence is modeled as a state-space process that is perturbed by random noise, and the models across sensors are parametrized by the same parameter vector. The sensors collaborate to estimate this parameter from their measurements, and to this end we propose a distributed and recursive estimation algorithm, which we refer to as the incremental recursive prediction error algorithm. This algorithm has the distributed property of incremental gradient algorithms and the on-line property of recursive prediction error algorithms. | 2022-09-02T19:53:18.523Z | {
"ACL": null,
"DBLP": "journals/corr/abs-0804-1607",
"ArXiv": "0804.1607",
"MAG": "2040002081",
"CorpusId": "395",
"PubMed": null,
"DOI": "10.1109/TAC.2009.2037460",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/2c5e58aed5686bf3be3e6164b24943be995d7e25 | Distributed and Recursive Parameter Estimation in Parametrized Linear State-Space Models | [
{
"authorId": "144307036",
"name": "S. Ram"
},
{
"authorId": "1726611",
"name": "V. Veeravalli"
},
{
"authorId": "1800855",
"name": "A. Nedić"
}
] | IEEE Transactions on Automatic Control | 2,008 | 44 | 101 | 4 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 2008-04-09T00:00:00 | {
"name": "IEEE Transactions on Automatic Control",
"volume": "55",
"pages": "488-492"
} | [
"sensors",
"state space model"
] | [
"estimation method",
"state space",
"state space model",
"sensors",
"adaptive algorithms"
] | [
"estimation method",
"state space",
"sensors",
"state space model",
"adaptive algorithms"
] | [
"numerical model",
"state space methods",
"computer hardware",
"software",
"mathematics",
"matrix algebra",
"computer science"
] |
396 | This paper considers the minimization of transmit power in Gaussian frequency selective interference channels, subject to a rate constraint for each user. To derive decentralized solutions that do not require any cooperation among the users, we formulate this power control problem as a (generalized) Nash equilibrium game. We obtain sufficient conditions that guarantee the existence and nonemptiness of the solution set to our problem. Then, to compute the solutions of the game, we propose two distributed algorithms ∗The work of this author is based on research supported by the National Science Foundation under grant DMI-0516023. †The work of this author is based on research partially supported by the SURFACE project funded by the European Community under Contract IST-4-027187-STP-SURFACE, and by the Italian Ministry of University and Research. ‡The work of this author is based on research supported by the Program PRIN-MIUR 2005 “Innovative Problems and Methods in Nonlinear Optimization”. | 2022-08-31T20:15:22.538Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0702162",
"ArXiv": null,
"MAG": "186118836",
"CorpusId": "396",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/4ad40a65f28990900dc858b49d5666b051dcd579 | Distributed Power Allocation with Rate Constraints in Gaussian Frequency-Selective Interference Channels | [
{
"authorId": "1784816",
"name": "J. Pang"
},
{
"authorId": "1690788",
"name": "G. Scutari"
},
{
"authorId": "1774235",
"name": "F. Facchinei"
},
{
"authorId": "2554391",
"name": "Chaoxiong Wang"
}
] | ArXiv | 2,007 | 70 | 15 | 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/0702162",
"pages": null
} | [
"research support",
"university",
"power allocations",
"contracts",
"power control problem",
"sufficient conditions",
"optimization",
"gaussians",
"distributed algorithm",
"nash equilibrium",
"transmit power",
"frequency selective fading",
"interference channels"
] | [
"power allocations",
"gaussians",
"interference channels",
"optimization",
"transmit power",
"power control",
"power control problem",
"nash equilibrium",
"sufficient conditions",
"contracts",
"university"
] | [
"research support",
"contracts",
"power allocations",
"power control",
"power control problem",
"sufficient conditions",
"optimization",
"frequency selective fading",
"gaussians",
"distributed algorithm",
"nash equilibrium",
"transmit power",
"university",
"interference channels"
] | [
"education",
"e-commerce",
"wireless telecommunication systems",
"code division multiple access",
"signal to noise ratio",
"linear matrix inequalities",
"mathematics",
"fading (radio)",
"fading channels",
"gaussian distribution",
"parallel algorithms",
"game theory",
"cognitive radio",
"wireless networks",
"mimo systems",
"radio",
"multiplexing",
"transmitters",
"signal interference",
"information theory",
"internet",
"information technology",
"computer networks",
"communication systems",
"telecommunication systems",
"communication channels",
"signal processing",
"matrix algebra",
"bit error rate",
"signal detection",
"gaussian noise (electronic)",
"parallel processing systems",
"artificial intelligence",
"wireless communications",
"packet networks",
"signal receivers",
"antennas",
"spurious signal noise",
"communication",
"computer science",
"computer systems",
"engineering",
"probability",
"distributed systems",
"telecommunication traffic",
"distributed computer systems",
"telecommunication networks"
] |
397 | The Channel Archiver has been operational for more than two years at Los Alamos National Laboratory and other sites. This paper introduces the available components (data sampling engine, viewers, scripting interface, HTTP/CGI integration and data management), presents updated performance measurements and reviews operational experience with the Channel Archiver. | 2022-09-03T21:24:14.193Z | {
"ACL": null,
"DBLP": "journals/corr/cs-OH-0110066",
"ArXiv": "cs/0110066",
"MAG": "2952766299",
"CorpusId": "397",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/7a16236aabad8687727ca92e8ab75f02782dca9f | Overview of the Experimental Physics and Industrial Control System (EPICS) Channel Archiver | [
{
"authorId": "40634606",
"name": "K. Kasemir"
},
{
"authorId": "2798036",
"name": "L. Dalesio"
}
] | ArXiv | 2,001 | 7 | 30 | 4 | false | [
{
"category": "Physics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Review"
] | 2001-10-31T00:00:00 | {
"name": "ArXiv",
"volume": "cs.OH/0110066",
"pages": null
} | [
"data management",
"control systems",
"engine",
"http"
] | [
"control systems",
"engine",
"scripting languages",
"http",
"data management"
] | [
"control systems",
"scripting languages",
"http",
"data management",
"engine"
] | [
"computer systems",
"high level languages",
"servers",
"client server computer systems",
"internet protocols",
"information management",
"engineering",
"computer science",
"computer programming",
"world wide web",
"security of data",
"telecommunication traffic",
"multimedia systems",
"distributed computer systems",
"data communication systems",
"database systems",
"user interfaces",
"information technology",
"internet",
"computer security",
"telecommunication networks",
"human computer interaction",
"telecommunication systems"
] |
398 | The title of a document has two roles, to give a compact summary and to lead the reader to read the document. Conventional title generation focuses on finding key expressions from the author's wording in the document to give a compact summary and pays little attention to the reader's interest. To make the title play its second role properly, it is indispensable to clarify the content ("what to say") and wording ("how to say") of titles that are effective to attract the target reader's interest. In this article, we first identify typical content and wording of titles aimed at general readers in a comparative study between titles of technical papers and headlines rewritten for newspapers. Next, we describe the results of a questionnaire survey on the effects of the content and wording of titles on the reader's interest. The survey of general and knowledgeable readers shows both common and different tendencies in interest. | 2022-02-13T16:01:26.941Z | {
"ACL": "C02-1133",
"DBLP": "journals/corr/cs-CL-0207003",
"ArXiv": "cs/0207003",
"MAG": "2057229414",
"CorpusId": "398",
"PubMed": null,
"DOI": "10.3115/1072228.1072361",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/7f6ee148bea9e3615c08b79eba04920442ae7127 | Analysis of Titles and Readers for Title Generation Centered on the Readers | [
{
"authorId": "2076351105",
"name": "Yasuko Senda"
},
{
"authorId": "2057066701",
"name": "Yasusi Shinohara"
}
] | COLING | 2,002 | 3 | 4 | 1 | true | [
{
"category": "Education",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference",
"Review"
] | 2002-07-02T00:00:00 | {
"name": "ArXiv",
"volume": "cs.CL/0207003",
"pages": null
} | [] | [
"electronic document",
"text document",
"document-processing",
"multimedia contents",
"digital contents"
] | [
"digital contents",
"electronic document",
"document-processing",
"multimedia contents",
"text document"
] | [
"digital rights management",
"word processing",
"character recognition",
"image processing",
"multimedia services",
"text mining",
"information retrieval systems",
"digital watermarking",
"cryptography",
"text processing",
"pattern recognition",
"computer imaging and vision",
"internet protocols",
"multimedia systems",
"database systems",
"information retrieval",
"security of data",
"cryptology",
"natural language processing",
"computational linguistics",
"data mining",
"machine learning",
"computer science",
"telecommunication traffic",
"internet",
"computer systems",
"computer security",
"artificial intelligence",
"natural languages",
"telecommunication networks",
"linguistics",
"semantics",
"telecommunication systems"
] |
399 | The limiting distribution $\mu$ of the normalized number of key comparisons required by the Quicksort sorting algorithm is known to be the unique fixed point of a certain distributional transformation $T$ - unique, that is, subject to the constraints of zero mean and finite variance. We show that a distribution is a fixed point of $T$ if and only if it is the convolution of $\mu$ with a Cauchy distribution of arbitrary center and scale. In particular, therefore, $\mu$ is the unique fixed point of $T$ having zero mean. | 2022-09-04T10:42:37.081Z | {
"ACL": null,
"DBLP": "journals/corr/math-PR-0005236",
"ArXiv": "math/0005236",
"MAG": "2033819937",
"CorpusId": "399",
"PubMed": null,
"DOI": "10.1214/ECP.V5-1021",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/d6c1665c8b1f61ffbe5079baade9f79fbb1dad37 | A characterization of the set of fixed points of the Quicksort transformation | [
{
"authorId": "1716941",
"name": "J. A. Fill"
},
{
"authorId": "1732375",
"name": "S. Janson"
}
] | ArXiv | 2,000 | 14 | 35 | 3 | false | [
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2000-05-23T00:00:00 | {
"name": "ArXiv",
"volume": "math.PR/0005236",
"pages": null
} | [] | [
"control point",
"adaptive algorithms",
"hybrid algorithms",
"fast fourier transforms"
] | [
"adaptive algorithms",
"fast fourier transforms",
"control point",
"hybrid algorithms"
] | [
"software",
"signal processing",
"image coding",
"splines",
"curve fitting",
"evolutionary algorithms",
"particle swarm optimization (pso)",
"computer science",
"engineering",
"image processing",
"computer aided design",
"mathematics",
"genetic algorithms",
"optimization problems",
"optimization",
"swarm intelligence",
"computer imaging and vision",
"artificial intelligence",
"correlation analysis"
] |
400 | We introduce a simple framework for learning aggressive maneuvers in flight control of UAVs. Having inspired from biological environment, dynamic movement primitives are analyzed and extended using nonlinear contraction theory. Accordingly, primitives of an observed movement are stably combined and concatenated. We demonstrate our results experimentally on the Quanser Helicopter, in which we first imitate aggressive maneuvers and then use them as primitives to achieve new maneuvers that can fly over an obstacle. | 2022-09-05T02:47:03.022Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0609140",
"ArXiv": "cs/0609140",
"MAG": "1514910877",
"CorpusId": "400",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/44af915b877c9289e251ab0303dc5deed92f945b | Motion Primitives for Robotic Flight Control | [
{
"authorId": "2188587",
"name": "Baris E. Perk"
},
{
"authorId": "1740591",
"name": "J. Slotine"
}
] | ArXiv | 2,006 | 52 | 27 | 4 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Engineering",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2006-09-25T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0609140",
"pages": null
} | [
"flight control"
] | [
"flight control",
"flight control systems",
"flight test",
"aircraft control",
"switching control"
] | [
"flight control systems",
"flight test",
"flight control",
"aircraft control",
"switching control"
] | [
"control systems",
"switching systems",
"computer systems",
"linear matrix inequalities",
"computer science",
"matrix algebra",
"mathematics"
] |
402 | We develop a multi-class discrete-time processor-sharing queueing model for scheduled message communication over a discrete memoryless degraded broadcast channel. The framework we consider here models both the random message arrivals and the subsequent reliable communication by suitably combining techniques from queueing theory and information theory. Requests for message transmissions are assumed to arrive according to i.i.d. arrival processes. Then, (i) we derive an outer bound to the stability region of message arrival rate vectors achievable by the class of stationary scheduling policies, (ii) we show for any message arrival rate vector that satisfies the outer bound, that there exists a stationary "state-independent" policy that results in a stable system for the corresponding message arrival processes, and (iii) under an asymptotic regime, we show that the stability region of information arrival rate vectors is the information-theoretic capacity region of a degraded broadcast channel | 2022-09-01T00:30:08.078Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0601094",
"ArXiv": "cs/0601094",
"MAG": "2952764130",
"CorpusId": "402",
"PubMed": null,
"DOI": "10.1109/ISIT.2006.261565",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/071cf3c7d65950b8d6b4106d4e9019e16b511efc | Stability of Scheduled Message Communication over Degraded Broadcast Channels | [
{
"authorId": "3252293",
"name": "K. C. V. Sayee"
},
{
"authorId": "3152364",
"name": "U. Mukherji"
}
] | 2006 IEEE International Symposium on Information Theory | 2,006 | 17 | 11 | 0 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 2006-01-21T00:00:00 | {
"name": "2006 IEEE International Symposium on Information Theory",
"volume": null,
"pages": "2764-2768"
} | [
"queuing models",
"discrete-time",
"capacity regions",
"broadcast channels",
"information theory",
"memoryless",
"combining techniques",
"communication",
"queueing theory"
] | [
"communication",
"broadcast",
"broadcast channels",
"discrete-time",
"queuing models",
"memoryless",
"information theory",
"capacity regions",
"service time",
"gaussian broadcast channel",
"data broadcast",
"arrival process"
] | [
"broadcast",
"queuing models",
"discrete-time",
"capacity regions",
"gaussian broadcast channel",
"service time",
"broadcast channels",
"arrival process",
"memoryless",
"combining techniques",
"data broadcast",
"communication",
"information theory",
"queueing theory"
] | [
"ad hoc networks",
"broadcasting",
"queuing network",
"discrete time control systems",
"channel capacity",
"gaussians",
"mimo systems",
"frequency shift keying",
"mobile computing",
"telecommunication traffic",
"routers",
"mobile telecommunication systems",
"internet protocols",
"quality of service",
"wireless local area networks (wlan)",
"multicasts",
"routing algorithms",
"sensors",
"communication channels",
"nonlinear control systems",
"linear matrix inequalities",
"signal to noise ratio",
"gaussian distribution",
"phase shift keying",
"rayleigh fading",
"signal receivers",
"wireless telecommunication systems",
"telecommunication networks",
"data communication systems",
"bandwidth",
"local area networks",
"computer networks",
"computer hardware",
"adaptive control systems",
"feedback systems",
"control theory",
"matrix algebra",
"signal processing",
"gaussian noise (electronic)",
"signal encoding",
"fading (radio)",
"fading channels",
"signal detection",
"communication systems",
"telecommunication systems",
"computer systems",
"computer science",
"process control",
"mathematics",
"engineering",
"bit error rate",
"automation",
"probability"
] |
403 | We study fundamental aspects related to the efficient processing of the SPARQL query language for RDF, proposed by the W3C to encode machine-readable information in the Semantic Web. Our key contributions are (i) a complete complexity analysis for all operator fragments of the SPARQL query language, which -- as a central result -- shows that the SPARQL operator Optional alone is responsible for the PSpace-completeness of the evaluation problem, (ii) a study of equivalences over SPARQL algebra, including both rewriting rules like filter and projection pushing that are well-known from relational algebra optimization as well as SPARQL-specific rewriting schemes, and (iii) an approach to the semantic optimization of SPARQL queries, built on top of the classical chase algorithm. While studied in the context of a theoretically motivated set semantics, almost all results carry over to the official, bag-based semantics and therefore are of immediate practical relevance. | 2022-09-04T01:38:45.106Z | {
"ACL": null,
"DBLP": "phd/de/Schmidt2010b",
"ArXiv": "0812.3788",
"MAG": "2126717690",
"CorpusId": "403",
"PubMed": null,
"DOI": "10.1145/1804669.1804675",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/2ee495cdf71dbab740771c4f02176a6f48827467 | Foundations of SPARQL query optimization | [
{
"authorId": "2109806772",
"name": "Michael Schmidt"
}
] | ICDT '10 | 2,008 | 164 | 344 | 40 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2008-12-19T00:00:00 | {
"name": "ArXiv",
"volume": "abs/0812.3788",
"pages": null
} | [
"query languages",
"query optimization",
"semantic web",
"sparql queries",
"optimization",
"resource description framework",
"sparql",
"semantics",
"relational algebra"
] | [
"sparql",
"resource description framework",
"query optimization",
"optimization",
"semantics",
"semantic web",
"relational algebra"
] | [
"query languages",
"query optimization",
"semantic web",
"sparql queries",
"optimization",
"resource description framework",
"sparql",
"semantics",
"relational algebra"
] | [
"database systems",
"query processing",
"world wide web",
"mathematics",
"relational database",
"computer systems",
"search engines",
"internet",
"knowledge based systems",
"computer science",
"artificial intelligence"
] |
404 | We present a comparative study of the application of a recently introduced heuristic algorithm to the optimization of transport on three major types of complex networks. The algorithm balances network traffic iteratively by minimizing the maximum node betweenness with as little path lengthening as possible. We show that by using this optimal routing, a network can sustain significantly higher traffic without jamming than in the case of shortest path routing. A formula is proved and tested with numerical simulation that allows quick computation of the average number of hops along the path and of the average travel times once the betweennesses of the nodes are computed. Using this formula, we show that routing optimization preserves the small-world character exhibited by networks under shortest path routing, and that it significantly reduces the average travel time on congested networks with only a negligible increase in the average travel time at low loads. Finally, we study the correlation between the weights of the links in the case of optimal routing and the betweennesses of the nodes connected by them. | 2022-09-01T17:48:42.909Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cond-mat-0701184",
"ArXiv": "cond-mat/0701184",
"MAG": "2049548647",
"CorpusId": "404",
"PubMed": "17614689",
"DOI": "10.1063/1.2731718",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/9521e2b34d4df08808734b5e8bae0badca24d525 | Transport optimization on complex networks | [
{
"authorId": "1767129",
"name": "B. Danila"
},
{
"authorId": "2111509048",
"name": "Yong Yu"
},
{
"authorId": "32716728",
"name": "J. Marsh"
},
{
"authorId": "1753823",
"name": "K. Bassler"
}
] | Chaos | 2,007 | 82 | 80 | 1 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Physics",
"source": "external"
},
{
"category": "Medicine",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-01-09T00:00:00 | {
"name": "Chaos",
"volume": "17 2",
"pages": "\n 026102\n "
} | [
"shortest path routing",
"network traffic",
"optimal routing",
"optimization",
"routing algorithms",
"betweenness",
"complex networks"
] | [
"optimization",
"complex networks",
"network architecture",
"network traffic",
"betweenness",
"routing scheme",
"optimal routing",
"shortest path routing",
"routing algorithms",
"shortest path"
] | [
"shortest path routing",
"network architecture",
"network traffic",
"optimal routing",
"optimization",
"routing scheme",
"routing algorithms",
"betweenness",
"complex networks",
"shortest path"
] | [
"network routing",
"computer networks",
"telecommunication traffic",
"intrusion detection",
"network security",
"mathematics",
"routing protocols",
"social networks",
"graph theory",
"topology",
"computer science",
"telecommunication networks",
"computer crime",
"cryptography",
"routers",
"wireless telecommunication systems",
"world wide web",
"theoretical computer science",
"telecommunication systems",
"security of data",
"cryptology",
"bandwidth",
"communication systems",
"internet",
"computer systems",
"computer security"
] |
405 | We present an unsupervised learning algorithm that mines large text corpora for patterns that express implicit semantic relations. For a given input word pair X:Y with some unspecified semantic relations, the corresponding output list of patterns (P1,..., Pm) is ranked according to how well each pattern Pi expresses the relations between X and Y. For example, given X = ostrich and Y = bird, the two highest ranking output patterns are "X is the largest Y" and "Y such as the X". The output patterns are intended to be useful for finding further pairs with the same relations, to support the construction of lexicons, ontologies, and semantic networks. The patterns are sorted by pertinence, where the pertinence of a pattern Pi for a word pair X:Y is the expected relational similarity between the given pair and typical pairs for Pi. The algorithm is empirically evaluated on two tasks, solving multiple-choice SAT word analogy questions and classifying semantic relations in noun-modifier pairs. On both tasks, the algorithm achieves state-of-the-art results, performing significantly better than several alternative pattern ranking algorithms, based on tf-idf. | 2022-09-04T06:41:01.232Z | {
"ACL": "P06-1040",
"DBLP": "journals/corr/abs-cs-0607120",
"ArXiv": "cs/0607120",
"MAG": "2102474120",
"CorpusId": "405",
"PubMed": null,
"DOI": "10.3115/1220175.1220215",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/83d9fec6bee4cf6e01445d6ff51aae58b6d96d5a | Expressing Implicit Semantic Relations without Supervision | [
{
"authorId": "1689647",
"name": "Peter D. Turney"
}
] | ACL | 2,006 | 37 | 118 | 16 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 2006-07-17T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0607120",
"pages": null
} | [
"semantic information",
"unsupervised learning",
"sat",
"semantics",
"ontology"
] | [
"semantics",
"semantic information",
"unsupervised learning",
"ontology",
"sat",
"sat solvers",
"adaptive algorithms",
"unsupervised learning method",
"network architecture"
] | [
"semantic information",
"unsupervised learning method",
"network architecture",
"unsupervised learning",
"sat",
"semantics",
"adaptive algorithms",
"sat solvers",
"ontology"
] | [
"computer networks",
"clustering algorithms",
"model checking",
"boolean functions",
"software",
"decision theory",
"satisfiability",
"computer science",
"data mining",
"embedded systems",
"architecture verification and validation",
"mathematics",
"artificial intelligence",
"formal logic",
"computer systems",
"architecting",
"software architecture",
"software design",
"software engineering"
] |
406 | We seek to find normative criteria of adequacy for nonmonotonic logic similar to the criterion of validity for deductive logic. Rather than stipulating that the conclusion of an inference be true in all models in which the premises are true, we require that the conclusion of a nonmonotonic inference be true in “almost all” models of a certain sort in which the premises are true. This “certain sort” specification picks out the models that are relevant to the inference, taking into account factors such as specificity and vagueness, and previous inferences. The frequencies characterizing the relevant models reflect known frequencies in our actual world. The criteria of adequacy for a default inference can be extended by thresholding to criteria of adequacy for an extension. We show that this avoids the implausibilities that might otherwise result from the chaining of default inferences. The model proportions, when construed in terms of frequencies, provide a verifiable grounding of default rules, and can become the basis for generating default rules from statistics. | 2022-08-25T16:02:39.126Z | {
"ACL": null,
"DBLP": "conf/nmr/KyburgT02",
"ArXiv": "cs/0207083",
"MAG": "3037907010",
"CorpusId": "406",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/2c8eaf3d4f9342a6390d62778f936588ff52cef0 | Evaluating defaults | [
{
"authorId": "70545772",
"name": "H. Kyburg"
},
{
"authorId": "34561494",
"name": "C. Teng"
}
] | NMR | 2,002 | 58 | 3 | 0 | false | [
{
"category": "Economics",
"source": "s2-fos-model"
},
{
"category": "Philosophy",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2002-07-24T00:00:00 | {
"name": "ArXiv",
"volume": "cs.AI/0207083",
"pages": null
} | [
"frequencies",
"thresholding",
"inference",
"correlation analysis"
] | [
"inference",
"correlation analysis",
"frequencies",
"default logic",
"probabilistic inference"
] | [
"correlation analysis",
"frequencies",
"probabilistic inference",
"thresholding",
"default logic",
"inference"
] | [
"mathematics",
"bandwidth",
"inference engines",
"bayesian methods",
"probability distributions",
"image segmentation",
"non-monotonic reasoning",
"computer networks",
"artificial intelligence",
"probability",
"image analysis",
"image processing",
"logic programming",
"knowledge representation",
"computer science",
"computer imaging and vision",
"computer programming languages",
"formal logic",
"knowledge based systems",
"semantics",
"computer programming"
] |
407 | Traffic grooming is widely employed to reduce the cost of WDM optical networks. In this paper, we deal with the grooming of dynamic traffic in WDM tree and star networks. To achieve better results, we groom the arbitrary dynamic traffic in WDM tree and star networks in a strictly non-blocking manner using the bifurcation techniques to split traffic. Three splitting methods, including Traffic-Cutting, Traffic-Dividing and Synthesized-Splitting were proposed. A genetic algorithm (GA) approach based on these methods was proposed to tackle such grooming problems in tree and star networks. The performance of these algorithms was tested under different conditions in star and tree networks. Computer simulation results showed that our algorithm is efficient in reducing both the numbers of ADM's and wavelengths. | 2022-09-05T00:10:13.350Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0610157",
"ArXiv": "cs/0610157",
"MAG": "1630605490",
"CorpusId": "407",
"PubMed": null,
"DOI": "10.6704/JMSSD.2010.7.1.1",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/fedc791c050943277b4c52a7d871f61032ded42c | A Genetic Algorithm Approach to the Grooming of Dynamic Traffic in Tree and Star Networks with Bifurcation | [
{
"authorId": "3052518",
"name": "Kun-hong Liu"
},
{
"authorId": "2146647570",
"name": "Yong Xu"
},
{
"authorId": "144930448",
"name": "De-shuang Huang"
}
] | ArXiv | 2,006 | 19 | 0 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2006-10-27T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0610157",
"pages": null
} | [
"wdm",
"genetic algorithms",
"wavelength",
"dynamic traffic",
"traffic grooming"
] | [
"genetic algorithms",
"traffic grooming",
"wdm",
"dynamic traffic",
"network architecture",
"optical networks",
"wavelength"
] | [
"wdm",
"network architecture",
"genetic algorithms",
"wavelength",
"optical networks",
"dynamic traffic",
"traffic grooming"
] | [
"computer networks",
"artificial intelligence",
"wavelength division multiplexing",
"fiber optic networks",
"optical materials",
"computer science",
"telecommunication traffic",
"optical fibers",
"telecommunication networks",
"sensors",
"telecommunication systems",
"computer hardware",
"computer systems"
] |
408 | Solutions to the coalition formation problem commonly assume agent rationality and, correspondingly, utility maximization. This in turn may prevent agents from making compromises. As shown in recent studies, compromise may facilitate coalition formation and increase agent utilities. In this study we leverage on those new results. We devise a novel coalition formation mechanism that enhances compromise. Our mechanism can utilize information on task dependencies to reduce formation complexity. Further, it works well with both cardinal and ordinal task values. Via experiments we show that the use of the suggested compromise-based coalition formation mechanism provides significant savings in the computation and communication complexity of coalition formation. Our results also show that when information on task dependencies is used, the complexity of coalition formation is further reduced. We demonstrate successful use of the mechanism for collaborative information filtering, where agents combine linguistic rules to analyze documents' contents. | 2022-06-20T10:13:28.161Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0502094",
"ArXiv": "cs/0502094",
"MAG": "1612978369",
"CorpusId": "408",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/261faa1dcf364b46bd58cf845bb755a60957e7d4 | Coalition Formation: Concessions, Task Relationships and Complexity Reduction | [
{
"authorId": "1734774",
"name": "S. Aknine"
},
{
"authorId": "2395016",
"name": "O. Shehory"
}
] | ArXiv | 2,005 | 10 | 6 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2005-02-27T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0502094",
"pages": null
} | [
"information filtering",
"linguistics",
"coalition formations",
"utility maximizations",
"communication"
] | [
"coalition formations",
"intelligent agents",
"software agents",
"utility maximizations",
"communication",
"information filtering",
"linguistics"
] | [
"information filtering",
"coalition formations",
"linguistics",
"utility maximizations",
"software agents",
"intelligent agents",
"communication"
] | [
"search engines",
"information retrieval systems",
"user interfaces",
"autonomous agents",
"game theory",
"wireless networks",
"multiagent system",
"world wide web",
"database systems",
"information retrieval",
"human computer interaction",
"artificial intelligence",
"wireless communications",
"packet networks",
"internet",
"computer systems",
"computer science",
"computer networks",
"telecommunication traffic",
"wireless telecommunication systems",
"telecommunication networks",
"communication systems",
"telecommunication systems"
] |
410 | A high-performance algorithm for searching for frequent patterns (FPs) in transactional databases is presented. The search for FPs is carried out by using an iterative sieve algorithm by computing the set of enclosed cycles. In each inner cycle of level FPs composed of elements are generated. The assigned number of enclosed cycles (the parameter of the problem) defines the maximum length of the desired FPs. The efficiency of the algorithm is produced by (i) the extremely simple logical searching scheme, (ii) the avoidance of recursive procedures, and (iii) the usage of only one-dimensional arrays of integers. | 2022-08-30T09:08:23.456Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0508120",
"ArXiv": "cs/0508120",
"MAG": "1620503534",
"CorpusId": "410",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/b93758f9b5c904cff32de6ed526900da679bf4a1 | Iterative Algorithm for Finding Frequent Patterns in Transactional Databases | [
{
"authorId": "145465904",
"name": "G. Berman"
},
{
"authorId": "2870308",
"name": "V. Gorshkov"
},
{
"authorId": "1850929",
"name": "E. MacKerrow"
},
{
"authorId": "2107999453",
"name": "Xidi Wang"
}
] | ArXiv | 2,005 | 12 | 1 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2005-08-26T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0508120",
"pages": null
} | [
"database systems",
"frequent patterns",
"one dimensional"
] | [
"frequent patterns",
"database systems",
"association rules",
"sub-arrays",
"adaptive algorithms"
] | [
"one dimensional",
"sub-arrays",
"adaptive algorithms",
"database systems",
"frequent patterns",
"association rules"
] | [
"two dimensional",
"numerical methods",
"direction of arrival",
"software",
"computer systems",
"data mining",
"image processing",
"mathematics",
"antenna arrays",
"sensors",
"computer science",
"computer imaging and vision",
"communication channels",
"antennas",
"signal to noise ratio",
"matrix algebra",
"computer hardware",
"wireless telecommunication systems",
"signal processing",
"computer networks",
"communication systems",
"telecommunication systems",
"engineering"
] |
412 | Making a linguistic theory is like making a programming language: one typically devises a type system to delineate the acceptable utterances and a denotational semantics to explain observations on their behavior. Via this connection, the programming language concept of delimited continuations can help analyze natural language phenomena such as quantification and polarity sensitivity. Using a logical metalanguage whose syntax includes control operators and whose semantics involves evaluation order, these analyses can be expressed in direct style rather than continuation-passing style, and these phenomena can be thought of as computational side effects. | 2022-09-04T21:40:35.749Z | {
"ACL": null,
"DBLP": "journals/corr/cs-CL-0404006",
"ArXiv": "cs/0404006",
"MAG": "1503291951",
"CorpusId": "412",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/b0553a8df9b127e1b2031e94415d9a2788fdb3d5 | Delimited continuations in natural language: quantification and polarity sensitivity | [
{
"authorId": "145663546",
"name": "Chung-chieh Shan"
}
] | ArXiv | 2,004 | 41 | 23 | 1 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2004-04-04T00:00:00 | {
"name": "ArXiv",
"volume": "cs.CL/0404006",
"pages": null
} | [
"denotational semantics",
"programming languages",
"natural languages",
"linguistics",
"semantics",
"type systems"
] | [
"natural languages",
"linguistics",
"programming languages",
"type systems",
"denotational semantics",
"semantics"
] | [
"denotational semantics",
"natural languages",
"programming languages",
"linguistics",
"semantics",
"type systems"
] | [
"operational semantics",
"computer programming languages",
"object oriented programming",
"program compilers",
"computer programming",
"parallel processing systems",
"computer science",
"distributed systems",
"distributed computer systems",
"computer systems"
] |
413 | This paper considers capacity scaling in the recently proposed two-way MIMO (multiple input multiple output) relay channel. In the two-way relay channel, two nodes use a relay for exchanging data with each other. Under the assumption that each node has perfect receive channel state information and all nodes work only in half duplex mode, this paper shows that the sum capacity scales linearly with the number of transmit antennas and logarithmically with the number of relays, as the number of relays grows large. This result shows that with two- way relay channels it is possible to asymptotically (in the number of relays) obtain full-duplex performance while using only half-duplex nodes. | 2022-09-04T10:23:52.199Z | {
"ACL": null,
"DBLP": "journals/corr/abs-0706-2906",
"ArXiv": "0706.2906",
"MAG": "2952740476",
"CorpusId": "413",
"PubMed": null,
"DOI": "10.1109/ISIT.2007.4557134",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/5c8d6346b302d87d586ce8966af972352d99e047 | Capacity Scaling for MIMO Two-Way Relaying | [
{
"authorId": "1703454",
"name": "R. Vaze"
},
{
"authorId": "1797630",
"name": "R. Heath"
}
] | 2007 IEEE International Symposium on Information Theory | 2,007 | 40 | 71 | 4 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-06-19T00:00:00 | {
"name": "2007 IEEE International Symposium on Information Theory",
"volume": null,
"pages": "1451-1455"
} | [
"half-duplex",
"two-way relay",
"mimo",
"two-way relay channels",
"relay channels",
"transmit antenna",
"full-duplex",
"sum capacity",
"channel state information",
"two-way relaying"
] | [
"mimo",
"decode-and-forward relay",
"relay channels",
"channel state",
"channel state information",
"sum capacity",
"transmit antenna",
"antennas",
"decode-and-forward relaying",
"relay node",
"half-duplex",
"multiple-input-multiple-output",
"two-way relay channels",
"radio channels",
"full-duplex",
"receive antenna"
] | [
"half-duplex",
"two-way relay",
"receive antenna",
"antennas",
"mimo",
"two-way relay channels",
"multiple-input-multiple-output",
"channel state",
"relay channels",
"transmit antenna",
"full-duplex",
"decode-and-forward relaying",
"radio channels",
"relay node",
"sum capacity",
"channel state information",
"decode-and-forward relay",
"two-way relaying"
] | [
"amplify-and-forward (af)",
"receiving antennas",
"wireless telecommunication systems",
"orthogonal frequency division multiplexing",
"communication channels",
"wireless networks",
"state feedback",
"channel estimation",
"fading (radio)",
"multiplexing",
"channel capacity",
"information theory",
"mimo systems",
"cooperative communication",
"closed-form expression",
"radio transmission",
"ad hoc networks",
"wireless sensor networks",
"network coding",
"fading channels",
"sum-rate",
"rayleigh fading",
"transmitters",
"relay selection",
"computer networks",
"communication systems",
"telecommunication systems",
"wireless communications",
"packet networks",
"feedback control",
"linear matrix inequalities",
"bit error rate",
"signal detection",
"signal to noise ratio",
"communication",
"routers",
"mobile telecommunication systems",
"internet protocols",
"quality of service",
"wireless local area networks (wlan)",
"multicasts",
"routing algorithms",
"sensors",
"energy utilization",
"sensor nodes",
"interference channels",
"beamforming",
"power allocations",
"numerical results",
"signal receivers",
"cooperative diversity",
"outages",
"outage probability",
"computer science",
"computer systems",
"telecommunication traffic",
"feedback systems",
"matrix algebra",
"probability",
"signal processing",
"bandwidth",
"telecommunication networks",
"local area networks",
"data communication systems",
"computer hardware",
"electricity",
"signal interference",
"numerical methods",
"diversity reception",
"mathematics",
"engineering",
"spurious signal noise"
] |
416 | Bounds on fingerprinting capacity have been derived in recent literature. In this paper we present an exact capacity formula and a universal fingerprinting scheme. Our problem setup unifies the signal-distortion and Boneh-Shaw formulations of fingerprinting. The proposed scheme has four useful properties: (1) the receiver does not need to know the coalition size and collusion channel; (2) a tunable parameter Delta trades off false-positive and false-negative error exponents; (3) the receiver provides a reliability metric for its decision; and (4) the decoder is capacity-achieving when the false-positive exponent Delta tends to zero. The new random coding scheme uses a "time-sharing" randomized sequence and produces conditionally constant-composition fingerprints. The decoder is a minimum penalized equivocation decoder, where the penalty term is proportional to coalition size. | 2022-09-03T13:25:16.520Z | {
"ACL": null,
"DBLP": "conf/isit/Moulin08a",
"ArXiv": "0801.3837",
"MAG": "2952590724",
"CorpusId": "416",
"PubMed": null,
"DOI": "10.1109/ISIT.2008.4594980",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/d94701fd2b39ae151297c3fca11d617f67913a97 | Universal fingerprinting: Capacity and random-coding exponents | [
{
"authorId": "1742248",
"name": "P. Moulin"
}
] | 2008 IEEE International Symposium on Information Theory | 2,008 | 33 | 79 | 9 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 2008-01-24T00:00:00 | {
"name": "2008 IEEE International Symposium on Information Theory",
"volume": null,
"pages": "220-224"
} | [
"fingerprint",
"coding scheme",
"signal distortion"
] | [
"fingerprint",
"signal distortion",
"transmission capacities",
"channel capacity",
"transmitters"
] | [
"transmitters",
"transmission capacities",
"fingerprint",
"signal distortion",
"channel capacity",
"coding scheme"
] | [
"signal receivers",
"antennas",
"ad hoc networks",
"multiplexing",
"biometrics",
"image compression",
"communication channels",
"signal to noise ratio",
"information theory",
"image coding",
"network coding",
"signal detection",
"wireless telecommunication systems",
"routers",
"mobile telecommunication systems",
"internet protocols",
"quality of service",
"wireless local area networks (wlan)",
"multicasts",
"routing algorithms",
"sensors",
"access control",
"image quality",
"signal processing",
"communication",
"image processing",
"computer networks",
"communication systems",
"telecommunication systems",
"telecommunication traffic",
"bandwidth",
"telecommunication networks",
"local area networks",
"data communication systems",
"computer hardware",
"computer security",
"image analysis",
"engineering",
"computer imaging and vision",
"computer science",
"computer systems"
] |
417 | Most existing implementations of multiple precision arithmetic demand that the user sets the precision a priori. A solution is to use the largest precision necessary to reach target accuracy. Some libraries are said adaptable in the sense that they dynamically change the precision of each intermediate operation individually to deliver the target accuracy according to the actual inputs. We present in this text a new adaptable numeric core inspired both from floating point expansions and from on-line arithmetic. The numeric core is cut down to five tools. The first tool that contains many arithmetic operations is proved to be correct. The proofs have been formally checked by the Coq assistant. Developing the proofs, we have formally proved many result published in the literature and we have extended a few of them. This work may let users (i) develop application specific adaptable libraries based on the toolset and / or (ii) write new formal proofs based on the set of validated facts. | 2022-08-28T21:32:33.513Z | {
"ACL": null,
"DBLP": "journals/corr/cs-MS-0107025",
"ArXiv": "cs/0107025",
"MAG": "1871294691",
"CorpusId": "417",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/9d9a9c989039ed00d96455cb0897beae57a43240 | Computer validated proofs of a toolset for adaptable arithmetic | [
{
"authorId": "1764701",
"name": "S. Boldo"
},
{
"authorId": "1775119",
"name": "M. Daumas"
},
{
"authorId": "1403846543",
"name": "Claire Moreau-Finot"
},
{
"authorId": "1734852",
"name": "Laurent Théry"
}
] | ArXiv | 2,001 | 72 | 9 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2001-07-19T00:00:00 | {
"name": "ArXiv",
"volume": "cs.MS/0107025",
"pages": null
} | [
"libraries",
"formal proofs",
"floating points"
] | [
"formal proofs",
"libraries",
"proof system",
"floating-point arithmetic",
"floating points"
] | [
"floating points",
"formal proofs",
"proof system",
"libraries",
"floating-point arithmetic"
] | [
"digital arithmetic",
"formal verifications",
"formal logic",
"programmable logic controllers",
"network security",
"education",
"field programmable gate array",
"mathematics",
"verification",
"artificial intelligence",
"microprocessor chips",
"cryptography",
"computer networks",
"computer hardware",
"verification and validation",
"computer science",
"cryptology",
"software quality",
"computer security",
"software design",
"software engineering"
] |
418 | With the increasing use of mobile workstations for a wide variety of tasks and associated information needs, and with many variations of available networks, access to data becomes a prime consideration. This paper discusses issues of workstation mobility and proposes a solution wherein the data structures are accessed in an encapsulated form - through the Portable File System (PFS) wrapper. The paper discusses an implementation of the Portable File System, highlighting the architecture and commenting upon performance of an experimental system. Although investigations have been focused upon mobile access of WWW documents, this technique could be applied to any mobile data access situation. | 2022-06-20T16:44:23.046Z | {
"ACL": null,
"DBLP": "journals/corr/cs-MA-9809036",
"ArXiv": "cs/9809036",
"MAG": "2106031749",
"CorpusId": "418",
"PubMed": null,
"DOI": "10.1145/330560.330847",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/b07f13f34877c07c384a88b1c5fbfc648d529104 | Document archiving, replication and migration container for mobile Web users | [
{
"authorId": "2393232",
"name": "P. Stañski"
},
{
"authorId": "48981615",
"name": "Stephen Giles"
},
{
"authorId": "52425525",
"name": "A. Zaslavsky"
}
] | SAC '98 | 1,998 | 14 | 2 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 1998-02-27T00:00:00 | {
"name": null,
"volume": null,
"pages": "400-404"
} | [
"mobile web",
"file systems",
"web content",
"information need"
] | [
"electronic document",
"text document",
"mobile web",
"web content",
"information need",
"handheld",
"file systems",
"mobile users",
"long-term preservation",
"network architecture",
"file access",
"mobile networks",
"location-aware",
"mobile terminal",
"mobile devices",
"world wide web",
"web information",
"computer workstations"
] | [
"mobile web",
"world wide web",
"mobile networks",
"mobile users",
"network architecture",
"electronic document",
"mobile devices",
"computer workstations",
"long-term preservation",
"file systems",
"location-aware",
"file access",
"mobile terminal",
"web information",
"web content",
"text document",
"information need",
"handheld"
] | [
"portable equipment",
"user interfaces",
"internet",
"mobile telecommunication systems",
"global system for mobile communications",
"computer networks",
"word processing",
"mobile computing",
"parallel processing systems",
"digital preservation",
"operating systems",
"location based services",
"ubiquitous computing",
"mobile phones",
"search engines",
"information technology",
"linguistics",
"text mining",
"information retrieval systems",
"hand held computers",
"human computer interaction",
"computer science",
"communication channels",
"telecommunication networks",
"text processing",
"wireless telecommunication systems",
"data communication systems",
"distributed systems",
"digital libraries",
"digital storage",
"computer hardware",
"database systems",
"information retrieval",
"telecommunication systems",
"natural language processing",
"computational linguistics",
"data mining",
"communication systems",
"computer systems",
"distributed computer systems",
"artificial intelligence",
"natural languages",
"semantics"
] |
419 | We analyze a slow-fading interference network with MN non-cooperating single-antenna sources and M non-cooperating single-antenna destinations. In particular, we assume that the sources are divided into M mutually exclusive groups of N sources each, every group is dedicated to transmit a common message to a unique destination, all transmissions occur concurrently and in the same frequency band and a dedicated 1-bit broadcast feedback channel from each destination to its corresponding group of sources exists. We provide a feedback-based iterative distributed (multi-user) beamforming algorithm, which "learns" the channels between each group of sources and its assigned destination. This algorithm is a straightforward generalization, to the multi-user case, of the feedback-based iterative distributed beamforming algorithm proposed recently by Mudumbai et al., in IEEE Trans. Inf. Th. (submitted) for networks with a single group of sources and a single destination. Putting the algorithm into a Markov chain context, we provide a simple convergence proof. We then show that, for M finite and N approaching infinity, spatial multiplexing based on the beamforming weights produced by the algorithm achieves full spatial multiplexing gain of M and full per-stream array gain of N, provided the time spent "learning'' the channels scales linearly in N. The network is furthermore shown to "crystallize''. Finally, we characterize the corresponding crystallization rate. | 2022-08-29T05:19:36.798Z | {
"ACL": null,
"DBLP": "journals/corr/abs-0710-1522",
"ArXiv": "0710.1522",
"MAG": "1494110528",
"CorpusId": "419",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/62acbab6c312b3c36aeaf23d2db75eb9419af42c | Distributed spatial multiplexing with 1-bit feedback | [
{
"authorId": "2842852",
"name": "J. Thukral"
},
{
"authorId": "1691809",
"name": "H. Bölcskei"
}
] | ArXiv | 2,007 | 5 | 16 | 1 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-10-08T00:00:00 | {
"name": "ArXiv",
"volume": "abs/0710.1522",
"pages": null
} | [
"broadcast",
"multiplexing gains",
"spatial multiplexing",
"beamforming algorithms",
"frequency bands",
"markov chains",
"array gain",
"distributed beamforming",
"beamforming"
] | [
"spatial multiplexing",
"multiplexing",
"single antenna",
"antennas",
"destination nodes",
"frequency bands",
"broadcast",
"markov chains",
"multiplexing gains",
"array gain"
] | [
"broadcast",
"multiplexing gains",
"antennas",
"spatial multiplexing",
"destination nodes",
"multiplexing",
"frequency bands",
"beamforming algorithms",
"markov chains",
"array gain",
"single antenna",
"distributed beamforming",
"beamforming"
] | [
"ad hoc networks",
"broadcasting",
"channel state information",
"space time adaptive processing",
"mim devices",
"wireless telecommunication systems",
"receiving antennas",
"antenna arrays",
"channel capacity",
"wireless sensor networks",
"routing protocols",
"communication channels",
"signal to noise ratio",
"markov processes",
"diversity gain",
"mobile antennas",
"multiple antenna",
"fading channels",
"routers",
"mobile telecommunication systems",
"internet protocols",
"quality of service",
"wireless local area networks (wlan)",
"multicasts",
"routing algorithms",
"sensors",
"fading (radio)",
"rayleigh fading",
"transmitters",
"mimo systems",
"block codes",
"data communication systems",
"computer networks",
"communication systems",
"telecommunication systems",
"matrix algebra",
"information theory",
"wireless communications",
"energy utilization",
"sensor nodes",
"signal processing",
"correlation analysis",
"directional patterns (antenna)",
"telecommunication traffic",
"bandwidth",
"telecommunication networks",
"local area networks",
"computer hardware",
"bit error rate",
"signal detection",
"signal receivers",
"computer systems",
"computer science",
"mathematics",
"communication",
"electricity",
"engineering",
"probability"
] |
420 | Backup or preservation of websites is often not considered until after a catastrophic event has occurred. In the face of complete website loss, “lazy” webmasters or concerned third parties may be able to recover some of their website from the Internet Archive. Other pages may also be salvaged from commercial search engine caches. We introduce the concept of “lazy preservation”- digital preservation performed as a result of the normal operations of the Web infrastructure (search engines and caches). We present Warrick, a tool to automate the process of website reconstruction from the Internet Archive, Google, MSN and Yahoo. Using Warrick, we have reconstructed 24 websites of varying sizes and composition to demonstrate the feasibility and limitations of website reconstruction from the public Web infrastructure. To measure Warrick’s window of opportunity, we have profiled the time required for new Web resources to enter and leave search engine caches. | 2022-08-28T10:03:45.089Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0512069",
"ArXiv": "cs/0512069",
"MAG": "1646304050",
"CorpusId": "420",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/afffb9a81e07e85118863484f44043e0cd52a4f1 | Reconstructing Websites for the Lazy Webmaster | [
{
"authorId": "3002002",
"name": "F. McCown"
},
{
"authorId": "2118966440",
"name": "Joan A. Smith"
},
{
"authorId": "1750903",
"name": "Michael L. Nelson"
},
{
"authorId": "1756468",
"name": "J. Bollen"
}
] | ArXiv | 2,005 | 43 | 9 | 1 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2005-12-16T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0512069",
"pages": null
} | [
"digital preservation",
"search engines",
"web resources",
"reconstruction",
"internet"
] | [
"web content",
"internet",
"search engines",
"engine",
"digital preservation",
"reconstruction",
"web resources"
] | [
"digital preservation",
"search engines",
"web resources",
"web content",
"reconstruction",
"internet",
"engine"
] | [
"digital libraries",
"digital storage",
"world wide web",
"image reconstruction",
"computer science",
"engineering",
"database systems",
"user interfaces",
"computer hardware",
"image analysis",
"image processing",
"computer systems",
"human computer interaction",
"computer imaging and vision"
] |
421 | The use of IP filtering as a means of improving system security is well established. Although there are limitations at what can be achieved doing relatively low-level filtering, IP level filtering has proved to be efficient and effective. In the design of a security policy there is always a trade-off between usability and security. Restricting access means that legitimate use of the network is prevented; allowing access means illegitimate use may be allowed. Static access list make finding a bal ance particularly stark — we pay the price of decreased security 100% of the time even if the benefi t of increased usability is only gained 1% of the time. Dynamic access lists would allow the rules to change for short periods of time, and to allow local changes by non-experts. The network administrator can set basic security guide-lines which allow certain basic services only. All other services are restric ted, but users are able to request temporary exceptions in order to allow additional access to the network. These exceptions are granted depending on the privileges of the user. This paper covers the following topics: (1) basic introduct ion to TCP/IP filtering; (2) semantics for dynamic access lists and; (3) a proposed protocol for allowing dynamic access; and (4) a method for representing access lists so that dynamic update and look-up can be done efficiently. | 2022-08-29T04:01:33.692Z | {
"ACL": null,
"DBLP": "journals/corr/cs-NI-0110013",
"ArXiv": "cs/0110013",
"MAG": "2144774344",
"CorpusId": "421",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/07af7052889f59df1c21d00bfa1a7c1810b5d262 | A Proposal for Dynamic Access Lists for TCP/IP Packet Filering | [
{
"authorId": "3295785",
"name": "S. Hazelhurst"
}
] | ArXiv | 2,001 | 15 | 17 | 1 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2001-10-03T00:00:00 | {
"name": "ArXiv",
"volume": "cs.NI/0110013",
"pages": null
} | [
"ip packets",
"tcp",
"security policy",
"packet filtering",
"semantics"
] | [
"tcp",
"data packet",
"network security",
"information security",
"data security",
"security policy",
"trade",
"semantics"
] | [
"trade",
"ip packets",
"tcp",
"security policy",
"data security",
"packet filtering",
"semantics",
"information security",
"network security",
"data packet"
] | [
"commerce",
"cellular radio systems",
"congestion control (communication)",
"wireless telecommunication systems",
"network protocols",
"access control",
"security systems",
"data privacy",
"computer system firewalls",
"packet networks",
"security of data",
"cryptography",
"computer networks",
"mobile ad hoc networks",
"wireless sensor networks",
"economics",
"communication channels",
"telecommunication traffic",
"signal to noise ratio",
"communication systems",
"telecommunication systems",
"internet",
"computer security",
"privacy",
"computer crime",
"cryptology",
"computer science",
"ad hoc networks",
"routing protocols",
"wireless communications",
"energy utilization",
"sensor nodes",
"routing algorithms",
"telecommunication networks",
"signal processing",
"computer systems",
"routers",
"mobile telecommunication systems",
"internet protocols",
"quality of service",
"wireless local area networks (wlan)",
"multicasts",
"sensors",
"electricity",
"engineering",
"bandwidth",
"local area networks",
"data communication systems",
"computer hardware"
] |
422 | Decision-making is a process of choosing among alternative courses of action for solving complicated problems where multi-criteria objectives are involved. The past few years have witnessed a growing recognition of Soft Computing (SC) technologies that underlie the conception, design and utilization of intelligent systems. In this paper, we present different SC paradigms involving an artificial neural network trained using the scaled conjugate gradient algorithm, two different fuzzy inference methods optimised using neural network learning/evolutionary algorithms and regression trees for developing intelligent decision support systems. We demonstrate the efficiency of the different algorithms by developing a decision support system for a Tactical Air Combat Environment (TACE). Some empirical comparisons between the different algorithms are also provided. | 2022-07-08T19:58:49.409Z | {
"ACL": null,
"DBLP": "journals/corr/cs-AI-0405052",
"ArXiv": "cs/0405052",
"MAG": "1657829965",
"CorpusId": "422",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/3a3eca7045d42cff3e66ac0395fa5c0f58773e0d | Decision Support Systems Using Intelligent Paradigms | [
{
"authorId": "144015533",
"name": "Cong Tran"
},
{
"authorId": "145731499",
"name": "A. Abraham"
},
{
"authorId": "1687772",
"name": "L. Jain"
}
] | ArXiv | 2,004 | 34 | 4 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2004-05-15T00:00:00 | {
"name": "ArXiv",
"volume": "cs.AI/0405052",
"pages": null
} | [
"evolutionary algorithms",
"decision support systems",
"soft computing",
"intelligent systems",
"inference",
"neural networks"
] | [
"decision support systems",
"soft computing",
"intelligent systems",
"neural networks",
"inference",
"evolutionary algorithms"
] | [
"evolutionary algorithms",
"decision support systems",
"soft computing",
"intelligent systems",
"inference",
"neural networks"
] | [
"genetic algorithms",
"artificial intelligence",
"computer systems",
"inference engines",
"machine learning",
"computer science"
] |
424 | This paper explores the possibility of enriching the content of existing ontologies. The overall goal is to overcome the lack of topical links among concepts in WordNet. Each concept is to be associated to a topic signature, i.e., a set of related words with associated weights. The signatures can be automatically constructed from the WWW or from sense-tagged corpora. Both approaches are compared and evaluated on a word sense disambiguation task. The results show that it is possible to construct clean signatures from the WWW using some filtering techniques. | 2022-09-04T10:06:28.648Z | {
"ACL": null,
"DBLP": "journals/corr/cs-CL-0109031",
"ArXiv": "cs/0109031",
"MAG": "1486093399",
"CorpusId": "424",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/7dfc14cb073253f6cd4472bd31a221832e5cd3cb | Enriching WordNet concepts with topic signatures | [
{
"authorId": "1733049",
"name": "Eneko Agirre"
},
{
"authorId": "2650591",
"name": "O. Ansa"
},
{
"authorId": "144547315",
"name": "E. Hovy"
},
{
"authorId": "143696281",
"name": "David Martínez"
}
] | ArXiv | 2,001 | 20 | 109 | 10 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2001-09-18T00:00:00 | {
"name": "ArXiv",
"volume": "cs.CL/0109031",
"pages": null
} | [
"ontology",
"word sense disambiguation",
"wordnet"
] | [
"wordnet",
"word sense disambiguation",
"word sense",
"ontology",
"fingerprint"
] | [
"word sense",
"word sense disambiguation",
"wordnet",
"fingerprint",
"ontology"
] | [
"word segmentation",
"lexical database",
"lexical semantics",
"biometrics",
"semantics",
"natural language processing",
"computational linguistics",
"character recognition",
"access control",
"artificial intelligence",
"natural languages",
"database systems",
"pattern recognition",
"computer security",
"computer science",
"linguistics",
"computer systems",
"machine learning"
] |
425 | There is no proof yet of convergence of Genetic Algorithms. We do not supply it too. Instead, we present some thoughts and arguments to convince the Reader, that Genetic Algorithms are essentially bound for success. For this purpose, we consider only the crossover operators, single- or multiple-point, together with selection procedure. We also give a proof that the soft selection is superior to other selection schemes. | 2022-06-20T11:39:43.446Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0512019",
"ArXiv": "cs/0512019",
"MAG": "1797034753",
"CorpusId": "425",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/4b3548fe9604bf234908e04a031e37eabd7e99eb | Amazing geometry of genetic space or are genetic algorithms convergent? | [
{
"authorId": "31466878",
"name": "M. Gutowski"
}
] | ArXiv | 2,005 | 8 | 0 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2005-12-05T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0512019",
"pages": null
} | [
"selection scheme",
"genetic algorithms",
"geometry",
"crossover operator",
"genetic selection"
] | [
"geometry",
"genetic algorithms",
"crossover operator",
"selection scheme",
"mutation operators",
"evolutionary programming",
"evolutionary algorithms",
"evolutionary computation techniques",
"simulated annealing",
"particle swarm optimization (pso)",
"adaptive algorithms",
"efficient algorithm",
"optimization problems"
] | [
"evolutionary algorithms",
"selection scheme",
"genetic algorithms",
"geometry",
"particle swarm optimization (pso)",
"optimization problems",
"crossover operator",
"evolutionary computation techniques",
"simulated annealing",
"mutation operators",
"efficient algorithm",
"genetic selection",
"adaptive algorithms",
"evolutionary programming"
] | [
"relay selection",
"artificial intelligence",
"optimization",
"swarm intelligence",
"correlation analysis",
"genetic programming",
"evolutionary computation",
"computational efficiency",
"genetic analysis",
"software",
"computer programming",
"channel state information",
"amplify-and-forward (af)",
"cooperative communication",
"relay node",
"cooperative diversity",
"outages",
"closed-form expression",
"outage probability",
"computer science",
"mathematics",
"theoretical computer science",
"bioinformatics",
"fading (radio)",
"rayleigh fading",
"multiplexing",
"channel capacity",
"transmitters",
"mimo systems",
"fading channels",
"wireless sensor networks",
"communication",
"wireless networks",
"ad hoc networks",
"network coding",
"diversity reception",
"bit error rate",
"probability",
"signal detection",
"communication channels",
"signal to noise ratio",
"information theory",
"signal receivers",
"antennas",
"wireless communications",
"energy utilization",
"sensor nodes",
"routing algorithms",
"packet networks",
"routers",
"mobile telecommunication systems",
"internet protocols",
"quality of service",
"wireless local area networks (wlan)",
"multicasts",
"sensors",
"signal processing",
"wireless telecommunication systems",
"computer networks",
"electricity",
"telecommunication traffic",
"bandwidth",
"telecommunication networks",
"local area networks",
"data communication systems",
"computer hardware",
"engineering",
"communication systems",
"telecommunication systems",
"computer systems"
] |
426 | This paper presents an analytical model for the fading channel correlation in general scattering environments. In contrast to the existing correlation models, our new approach treats the scattering environment as non-separable and it is modeled using a bi-angular power distribution. The bi-angular power distribution is parameterized by the mean departure and arrival angles, angular spreads of the univariate angular power distributions at the transmitter and receiver apertures, and a third parameter, the covariance between transmit and receive angles which captures the statistical interdependency between angular power distributions at the transmitter and receiver apertures. When this third parameter is zero, this new model reduces to the well known "Kronecker" model. Using the proposed model, we show that Kronecker model is a good approximation to the actual channel when the scattering channel consists of a single scattering cluster. In the presence of multiple remote scattering clusters we show that Kronecker model over estimates the performance by artificially increasing the number of multipaths in the channel. | 2022-08-28T21:20:17.516Z | {
"ACL": null,
"DBLP": "journals/corr/abs-math-ph-0512026",
"ArXiv": "math-ph/0512026",
"MAG": "2952358719",
"CorpusId": "426",
"PubMed": null,
"DOI": "10.1109/AUSCTW.2006.1625262",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/c7e15ea38c7ccfc95c9143195d83e79996ade9da | MIMO Channel Correlation in General Scattering Environments | [
{
"authorId": "1734818",
"name": "T. Lamahewa"
},
{
"authorId": "144071729",
"name": "R. Kennedy"
},
{
"authorId": "1711163",
"name": "T. Abhayapala"
},
{
"authorId": "2295117",
"name": "T. Betlehem"
}
] | 2006 Australian Communications Theory Workshop | 2,005 | 22 | 27 | 0 | true | [
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Physics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 2005-12-08T00:00:00 | {
"name": "2006 Australian Communications Theory Workshop",
"volume": null,
"pages": "93-98"
} | [
"transmitters",
"mimo channel",
"fading channels"
] | [
"mimo",
"transmitters",
"correlation coefficient",
"transceivers",
"transmitter and receiver"
] | [
"transmitters",
"correlation coefficient",
"transceivers",
"mimo",
"mimo channel",
"transmitter and receiver",
"fading channels"
] | [
"signal receivers",
"antennas",
"correlation analysis",
"communication channels",
"signal to noise ratio",
"orthogonal frequency division multiplexing",
"mim devices",
"channel capacity",
"mimo systems",
"matrix algebra",
"signal detection",
"wireless telecommunication systems",
"mathematics",
"signal processing",
"multiplexing",
"information theory",
"computer networks",
"communication systems",
"telecommunication systems",
"engineering",
"communication",
"computer science",
"computer systems"
] |
428 | Abstract The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specifications and code, and a refinement relation that models the notion of correct implementation. In this paper we extend and generalise earlier work on contextual refinement. Contextual refinement simplifies the refinement process by abstractly capturing the context of a subcomponent of a program, which typically includes information about the values of the free variables. This paper also extends and generalises module refinement. A module is a collection of procedures that operate on a common data type; module refinement between a specification module A and an implementation module C allows calls to the procedures of A to be systematically replaced with calls to the corresponding procedures of C. Based on the conditions for module refinement, we present a method for calculating an implementation module from a specification module. Both contextual and module refinement within the refinement calculus have been generalised from earlier work and the results are presented in a unified framework. | 2022-01-27T17:38:48.085Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0608110",
"ArXiv": "cs/0608110",
"MAG": "2018701156",
"CorpusId": "428",
"PubMed": null,
"DOI": "10.1017/S1471068407003043",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/e1f64eeb0ab7e61e19ea20cac510213561b17275 | Calculating modules in contextual logic program refinement | [
{
"authorId": "145745600",
"name": "R. Colvin"
},
{
"authorId": "1784126",
"name": "I. Hayes"
},
{
"authorId": "1700591",
"name": "P. Strooper"
}
] | Theory and Practice of Logic Programming | 2,006 | 43 | 2 | 0 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2006-08-28T00:00:00 | {
"name": "Theory and Practice of Logic Programming",
"volume": "8",
"pages": "1 - 31"
} | [
"logic programs"
] | [
"successive refinement",
"logic programs",
"formal specification",
"frequency bands",
"answer set semantics"
] | [
"formal specification",
"logic programs",
"frequency bands",
"answer set semantics",
"successive refinement"
] | [
"formal methods",
"real time systems",
"software engineering",
"formal languages",
"computer hardware description languages",
"computer programming languages",
"logic programming",
"antennas",
"answer set",
"source coding",
"signal distortion",
"formal logic",
"knowledge based systems",
"object oriented programming",
"mobile robots",
"field programmable gate array",
"embedded systems",
"online systems",
"digital signal processing",
"computer science",
"linguistics",
"formal languages and automata theory",
"computer programming",
"wireless telecommunication systems",
"answer set programming",
"signal encoding",
"channel coding",
"data compression",
"image compression",
"communication channels",
"signal to noise ratio",
"artificial intelligence",
"robotics",
"computer hardware",
"computer systems",
"signal processing",
"theoretical computer science",
"computer networks",
"communication systems",
"telecommunication systems",
"knowledge representation",
"image coding",
"bit error rate",
"fading channels",
"channel capacity",
"image quality",
"engineering",
"semantics",
"image processing",
"probability",
"information theory",
"image analysis",
"computer imaging and vision",
"mathematics",
"communication"
] |
429 | Professional standards are a significant issue for professions such as IT and Project Management, where certification and licensure are either necessary to practice or to demonstrate individual competence and capability. In many professions there is no basis for international reciprocity of professional standards. This paper documents the development of a standard for global reciprocity between already existing professional standards in the field of Project Management. Data are based on personal involvement by the authors and interviews with participants. This discussion addresses different approaches to standardisation, how common issues in the standardisation process have been addressed, and how the hindering influence of the professional associations’ proprietorial interest was avoided. Significantly different standards of development processes have been used compared to those typical in Project Management standards development, including: an emphasis on negotiation and joint modification rather than market dominance, and an open access approach, rather than one based on exclusion and gate-keeping. | 2022-09-04T23:44:17.602Z | {
"ACL": null,
"DBLP": "journals/jitsr/CrawfordP08",
"ArXiv": null,
"MAG": "1981209549",
"CorpusId": "429",
"PubMed": null,
"DOI": "10.4018/jitsr.2008010104",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/ada18bd4870a5a257b8509d45e27b9d4b98bf4d8 | Developing a Basis for Global Reciprocity: Negotiating Between the Many Standards for Project Management | [
{
"authorId": "39994292",
"name": "L. Crawford"
},
{
"authorId": "48315909",
"name": "Julien Pollack"
}
] | Int. J. IT Stand. Stand. Res. | 2,008 | 77 | 38 | 3 | true | [
{
"category": "Engineering",
"source": "s2-fos-model"
},
{
"category": "Business",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Political Science",
"source": "external"
}
] | [
"JournalArticle"
] | null | {
"name": "Int. J. IT Stand. Stand. Res.",
"volume": "6",
"pages": "70-84"
} | [
"open access",
"development processes"
] | [
"information management",
"development processes",
"open access",
"software development",
"integrated data"
] | [
"integrated data",
"software development",
"open access",
"development processes",
"information management"
] | [
"data integration",
"software project",
"software architecture",
"electronic publishing",
"process engineering",
"software design",
"information technology",
"database systems",
"data handling",
"world wide web",
"software engineering",
"process control",
"computer science",
"computer systems",
"internet",
"automation",
"engineering"
] |
430 | We present a number of results related to quantum algorithms with small error probability and quantum algorithms that are zero-error. First, we give a tight analysis of the trade-offs between the number of queries of quantum search algorithms, their error probability, the size of the search space, and the number of solutions in this space. Using this, we deduce new lower and upper bounds for quantum versions of amplification problems. Next, we establish nearly optimal quantum-classical separations for the query complexity of monotone functions in the zero-error model (where our quantum zero-error model is defined so as to be robust when the quantum gates are noisy). Also, we present a communication complexity problem related to a total function for which there is a quantum-classical communication complexity gap in the zero-error model. Finally, we prove separations for monotone graph properties in the zero-error and other error models which imply that the evasiveness conjecture for such properties does not hold for quantum computers. | 2022-09-05T03:27:22.488Z | {
"ACL": null,
"DBLP": "conf/focs/BuhrmanCWZ99",
"ArXiv": "cs/9904019",
"MAG": "2953272406",
"CorpusId": "430",
"PubMed": null,
"DOI": "10.1109/SFFCS.1999.814607",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/8d594b3e13d47897a3c9ea7b9c827063628bca9a | Bounds for small-error and zero-error quantum algorithms | [
{
"authorId": "1747509",
"name": "H. Buhrman"
},
{
"authorId": "144768999",
"name": "R. Cleve"
},
{
"authorId": "1863449",
"name": "R. D. Wolf"
},
{
"authorId": "2027296",
"name": "Christof Zalka"
}
] | 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) | 1,999 | 48 | 149 | 5 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Physics",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 1999-04-26T00:00:00 | {
"name": "40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)",
"volume": null,
"pages": "358-368"
} | [
"communication",
"probability",
"quantum gates"
] | [
"quantum gates",
"probability",
"trade",
"communication",
"search process"
] | [
"trade",
"probability",
"quantum gates",
"search process",
"communication"
] | [
"commerce",
"mathematics",
"logic gates",
"evolutionary algorithms",
"search engines",
"economics",
"field programmable gate array",
"genetic algorithms",
"world wide web",
"computer hardware",
"artificial intelligence",
"internet",
"computer science"
] |
431 | In this paper, we study the phenomenon that instruction sequences are split into fragments which somehow produce a joint behaviour. In order to bring this phenomenon better into the picture, we formalize a simple mechanism by which several instruction sequence fragments can produce a joint behaviour. We also show that, even in the case of this simple mechanism, it is a non-trivial matter to explain by means of a translation into a single instruction sequence what takes place on execution of a collection of instruction sequence fragments. | 2022-09-04T01:32:02.018Z | {
"ACL": null,
"DBLP": "journals/corr/abs-0802-1578",
"ArXiv": "0802.1578",
"MAG": "2123007131",
"CorpusId": "431",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/e3ef98899ab02625a54ffb2a1611aa0c41ead3cf | Thread Extraction for Polyadic Instruction Sequences | [
{
"authorId": "1731564",
"name": "J. Bergstra"
},
{
"authorId": "4969584",
"name": "K. Middelburg"
}
] | Sci. Ann. Comput. Sci. | 2,008 | 37 | 28 | 0 | false | [
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Psychology",
"source": "external"
}
] | [
"JournalArticle"
] | 2008-02-11T00:00:00 | {
"name": "ArXiv",
"volume": "abs/0802.1578",
"pages": null
} | [] | [
"microprocessor",
"multiple threads",
"information extraction",
"video signal",
"translation process"
] | [
"information extraction",
"video signal",
"translation process",
"microprocessor",
"multiple threads"
] | [
"natural language processing",
"data mining",
"information analysis",
"information retrieval",
"video coding",
"bit rates",
"imaging systems",
"machine translations",
"microprocessor chips",
"multithreaded",
"parallel architectures",
"artificial intelligence",
"natural languages",
"computer science",
"database systems",
"information systems",
"video processing",
"visual communication",
"motion estimation",
"image reconstruction",
"translation (languages)",
"information theory",
"computer hardware",
"multi core",
"parallel processing systems",
"linguistics",
"semantics",
"computer systems",
"computer imaging and vision",
"image coding",
"image analysis",
"image processing",
"computational linguistics",
"automata theory",
"communication",
"program processors",
"distributed systems",
"formal languages and automata theory",
"distributed computer systems",
"theoretical computer science"
] |
432 | A relational structure is a core, if all its endomorphisms are embeddings. This notion is important for computational complexity classification of constraint satisfaction problems. It is a fundamental fact that every finite structure has a core, i.e., has an endomorphism such that the structure induced by its image is a core; moreover, the core is unique up to isomorphism. Weprove that every \omega -categorical structure has a core. Moreover, every \omega-categorical structure is homomorphically equivalent to a model-complete core, which is unique up to isomorphism, and which is finite or \omega -categorical. We discuss consequences for constraint satisfaction with \omega -categorical templates. | 2022-09-05T02:36:37.989Z | {
"ACL": null,
"DBLP": "journals/lmcs/Bodirsky07",
"ArXiv": "cs/0612069",
"MAG": "2108266191",
"CorpusId": "432",
"PubMed": null,
"DOI": "10.2168/LMCS-3(1:2)2007",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/a770a84bcf1ab58b16bd8dd2025394e415ebf629 | Cores of Countably Categorical Structures | [
{
"authorId": "1726791",
"name": "M. Bodirsky"
}
] | Log. Methods Comput. Sci. | 2,006 | 40 | 59 | 5 | true | [
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2006-12-13T00:00:00 | {
"name": "Log. Methods Comput. Sci.",
"volume": "3",
"pages": null
} | [
"finite structures"
] | [
"constraint satisfaction problems (csp)",
"constraint networks",
"computational efficiency",
"classification models",
"constraint programming"
] | [
"finite structures",
"constraint networks",
"classification models",
"computational efficiency",
"constraint programming",
"constraint satisfaction problems (csp)"
] | [
"first order logic",
"computer programming",
"classification methods",
"theoretical computer science",
"artificial intelligence",
"formal logic",
"computer science",
"computer systems"
] |
435 | This is the current version of an annotated bibliography of papers which deal with or use ASMs. It is compiled to a great extent from references and annotations provided by the authors of the listed papers and extends the annotated bibliography which previously appeared in [20]. Comments, additions and corrections are welcome and should be sent to [email protected] and [email protected] 1 . Hartmut Ehrig asked the first author to write for this column what are the distinguishing features of the ASM approach to specification and verification of complex computing systems. In [21] an attempt had already been made to answer that question by discussing, in general comparative terms, some specific features which are characteristic for the ASM approach with respect to other well known approaches in the literature. That explanation seems to have been understood, as shown by the many positive reactions, but even more the numerous critical reactions of colleagues in the field who felt—rightly—that ASMs put justified doubt on cherished denotational, declarative, logical, functional and similar widespread beliefs in pure, i.e. not operational methods. Nevertheless some dissatisfaction remained with that paper because the discussion, in a sense unavoidably, remained in general terms which have been used during the last two or three decades again and again for the justification of many other methods. The attempt to answer the question in a more concrete way led the two authors of this commented bibliography to systematically review again, revising and updating [20], what are the achievements and failures of ASM research since the discovery of the notion by Yuri Gurevich in 1988. What follows here is a way of answering Hartmut Ehrig’s question; namely, we try to let the research results speak for the method. If somebody really wants to know whether there is anything useful in the notion of ASM which has not been covered by competing methods in the literature, he or she should try out the method on a challenging (not a toy) specification or verification problem. We have no doubt that then it will become clear why so much successful research could be done in such a short period by a relatively small number of researchers, as documented in the commented bibliography below. Current updates of this bibliography (as well as some of the papers listed below) will be available on the ASM web sites http://www.eecs.umich.edu/gasm and http://www.uni-paderborn.de/cs/asm.html. | 2022-09-03T14:00:55.622Z | {
"ACL": null,
"DBLP": "journals/corr/cs-SE-9811014",
"ArXiv": "cs/9811014",
"MAG": "2127391147",
"CorpusId": "435",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/f11ca651dba1004fe5c43d13b32dae2b655d4f17 | Abstract State Machines 1988-1998: Commented ASM Bibliography | [
{
"authorId": "1692943",
"name": "E. Börger"
},
{
"authorId": "7216701",
"name": "J. Huggins"
}
] | Bull. EATCS | 1,998 | 201 | 58 | 1 | false | [
{
"category": "Education",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Review"
] | 1998-11-09T00:00:00 | {
"name": "Bull. EATCS",
"volume": "64",
"pages": null
} | [
"verification",
"abstract state machines",
"verification problems",
"http",
"computing systems",
"html"
] | [
"abstract state machines",
"verification",
"verification method",
"computing systems",
"web content"
] | [
"verification",
"abstract state machines",
"verification problems",
"http",
"computing systems",
"web content",
"verification method",
"html"
] | [
"verification and validation",
"contour followers",
"formal methods",
"model checking",
"automata theory",
"servers",
"client server computer systems",
"internet protocols",
"computer systems",
"world wide web",
"formal verifications",
"xml",
"user interfaces",
"software quality",
"finite state machines",
"formal logic",
"embedded systems",
"architecture verification and validation",
"formal languages and automata theory",
"security of data",
"telecommunication traffic",
"multimedia systems",
"distributed computer systems",
"data communication systems",
"database systems",
"computer science",
"internet",
"human computer interaction",
"software design",
"finite automata",
"artificial intelligence",
"architecting",
"theoretical computer science",
"computer security",
"telecommunication networks",
"software engineering",
"software architecture",
"telecommunication systems"
] |
437 | Tabled evaluation is receiving increasing attention in the logic programming community. It avoids many of the shortcomings of SLD execution and provides a more flexible and often considerably more efficient execution mechanism for logic programs. In particular, tabled execution terminates more often than execution based on SLD-resolution. In this article, we introduce two notions of universal termination of logic programming with tabling: quasi-termination and (the stronger notion of) LG-termination. We present sufficient conditions for these two notions of termination, namely quasi-acceptability and LG-acceptability, and we show that these conditions are also necessary in case the selection of tabled predicates meets certain natural criteria. Starting from these conditions, we develop modular termination proofs, i.e., proofs capable of combining termination proofs of separate programs to obtain termination proofs of combined programs. Finally, in the presence of mode information, we state sufficient conditions which form the basis for automatically proving termination in a constraint-based way. | 2022-09-01T12:17:07.337Z | {
"ACL": null,
"DBLP": "journals/tocl/VerbaetenSS01",
"ArXiv": "cs/0003045",
"MAG": "2949106240",
"CorpusId": "437",
"PubMed": null,
"DOI": "10.1145/371282.371357",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/9b5e8766383d0ee4bafe109335afe5f93aa028af | Termination proofs for logic programs with tabling | [
{
"authorId": "1705866",
"name": "Sofie Verbaeten"
},
{
"authorId": "1714620",
"name": "D. D. Schreye"
},
{
"authorId": "1748894",
"name": "Konstantinos Sagonas"
}
] | TOCL | 2,000 | 47 | 37 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2000-03-09T00:00:00 | {
"name": "ACM Trans. Comput. Log.",
"volume": "2",
"pages": "57-92"
} | [
"logic programs",
"sufficient conditions",
"logic programming",
"genetic selection"
] | [
"formal proofs",
"logic programs",
"logic programming",
"sufficient conditions",
"programming languages"
] | [
"logic programs",
"logic programming",
"programming languages",
"formal proofs",
"sufficient conditions",
"genetic selection"
] | [
"computer programming languages",
"formal logic",
"linguistics",
"formal verifications",
"linear matrix inequalities",
"genetic analysis",
"computer programming",
"artificial intelligence",
"verification",
"matrix algebra",
"bioinformatics",
"computer science",
"verification and validation",
"mathematics",
"software quality",
"software design",
"software engineering"
] |
438 | We consider the computational complexity of producing the best
possible offspring in a crossover, given two solutions of the
parents. The crossover operators are studied on the class of
Boolean linear programming problems, where the Boolean vector of
variables is used as the solution representation. By means of
efficient reductions of the optimized gene transmitting crossover
problems (OGTC) we show the polynomial solvability of the OGTC for
the maximum weight set packing problem, the minimum weight set
partition problem and for one of the versions of the simple plant
location problem. We study a connection between the OGTC for
linear Boolean programming problem and the maximum weight
independent set problem on 2-colorable hypergraph and prove the
NP-hardness of several special cases of the OGTC problem in
Boolean linear programming. | 2022-06-20T12:21:59.197Z | {
"ACL": null,
"DBLP": "journals/corr/abs-0705-3766",
"ArXiv": "0705.3766",
"MAG": "2949608496",
"CorpusId": "438",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/8f9483846f3ef965c3e81d6b9fdef01a163a642b | On complexity of optimized crossover for binary representations | [
{
"authorId": "2529862",
"name": "A. Eremeev"
}
] | Theory of Evolutionary Algorithms | 2,007 | 21 | 3 | 0 | false | [
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-05-25T00:00:00 | {
"name": "ArXiv",
"volume": "abs/0705.3766",
"pages": null
} | [
"crossover operator"
] | [
"crossover operator",
"boolean functions",
"programming languages",
"mutation operators",
"fully polynomial time approximation schemes"
] | [
"boolean functions",
"programming languages",
"fully polynomial time approximation schemes",
"crossover operator",
"mutation operators"
] | [
"mathematics",
"computer programming languages",
"linguistics",
"polynomial approximation",
"approximation algorithms",
"evolutionary algorithms",
"particle swarm optimization (pso)",
"computer programming",
"graph theory",
"approximation theory",
"genetic algorithms",
"optimization problems",
"optimization",
"swarm intelligence",
"computer science",
"theoretical computer science",
"artificial intelligence",
"correlation analysis"
] |
440 | This paper describes a set of experiments involving small helicopters landing automated landing at unusual attitudes. By leveraging the increased agility of small air vehicles, we show that it is possible to automatically land a small helicopter on surfaces pitched at angles up to 60 degrees. Such maneuvers require considerable agility from the vehicle and its avionics system, and they pose significant technical and safety challenges. Our work builds upon previous activities in human-inspired, high-agility flight for small rotorcraft. However, it was not possible to leverage manual flight test data to extract landing maneuvers due to stringent attitude and position control requirements. Availability of low-cost, local navigation systems requiring no on-board instrumentation has proven particularly important for these experiments to be successful. | 2022-09-02T10:39:51.848Z | {
"ACL": null,
"DBLP": "journals/corr/abs-0709-1744",
"ArXiv": "0709.1744",
"MAG": "2950864332",
"CorpusId": "440",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/90eb126b402ee3b86af2b4cdb0535c815c11cabf | Experiments with small helicopter automated landings at unusual attitudes | [
{
"authorId": "1815779",
"name": "S. Bayraktar"
},
{
"authorId": "1774493",
"name": "E. Feron"
}
] | ArXiv | 2,007 | 28 | 18 | 1 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Engineering",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-09-11T00:00:00 | {
"name": "ArXiv",
"volume": "abs/0709.1744",
"pages": null
} | [
"vehicles",
"flight test",
"navigation systems",
"position control"
] | [
"vehicles",
"flight test",
"position control",
"navigation systems",
"agile methods"
] | [
"navigation systems",
"flight test",
"vehicles",
"agile methods",
"position control"
] | [
"mobile robots",
"flight control systems",
"engineering",
"software development",
"agile software development",
"motion control",
"robotic manipulators",
"sensors",
"robotics",
"control systems",
"software project",
"software architecture",
"software design",
"robots",
"motion planning",
"computer hardware",
"computer science",
"computer systems",
"software engineering"
] |
442 | Noise, corruptions, and variations in face images can seriously hurt the performance of face-recognition systems. To make these systems robust to noise and corruptions in image data, multiclass neural networks capable of learning from noisy data have been suggested. However on large face datasets such systems cannot provide the robustness at a high level. In this paper, we explore a pairwise neural-network system as an alternative approach to improve the robustness of face recognition. In our experiments, the pairwise recognition system is shown to outperform the multiclass-recognition system in terms of the predictive accuracy on the test face images. | 2022-08-24T23:49:18.570Z | {
"ACL": null,
"DBLP": "journals/ejasp/UglovJSM08",
"ArXiv": "0704.3515",
"MAG": "1983697767",
"CorpusId": "442",
"PubMed": null,
"DOI": "10.1155/2008/468693",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/0b19177107a102ee81e5ef1bb9fb2f2881441503 | Comparing Robustness of Pairwise and Multiclass Neural-Network Systems for Face Recognition | [
{
"authorId": "1405624657",
"name": "Jegor Uglov"
},
{
"authorId": "1678806",
"name": "L. Jakaite"
},
{
"authorId": "1714864",
"name": "V. Schetinin"
},
{
"authorId": "144834636",
"name": "C. Maple"
}
] | EURASIP J. Adv. Signal Process. | 2,007 | 18 | 20 | 2 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-04-26T00:00:00 | {
"name": "EURASIP Journal on Advances in Signal Processing",
"volume": "2008",
"pages": "1-7"
} | [
"face recognition systems",
"face recognition",
"face images",
"neural networks"
] | [
"neural networks",
"facial images",
"face recognition",
"face recognition systems",
"face images"
] | [
"facial images",
"face recognition",
"face recognition systems",
"face images",
"neural networks"
] | [
"pattern recognition",
"image processing",
"machine learning",
"computer imaging and vision",
"artificial intelligence",
"computer science"
] |
446 | First- and second-order Reed-Muller (RM(1) and RM(2), respectively) codes are two fundamental error-correcting codes which arise in communication as well as in probabilistically-checkable proofs and learning. In this paper, we take the first steps toward extending the quick randomized decoding tools of RM(1) into the realm of quadratic binary and, equivalently, Z_4 codes. Our main algorithmic result is an extension of the RM(1) techniques from Goldreich-Levin and Kushilevitz-Mansour algorithms to the Hankel code, a code between RM(1) and RM(2). That is, given signal s of length N, we find a list that is a superset of all Hankel codewords phi with dot product to s at least (1/sqrt(k)) times the norm of s, in time polynomial in k and log(N). We also give a new and simple formulation of a known Kerdock code as a subcode of the Hankel code. As a corollary, we can list-decode Kerdock, too. Also, we get a quick algorithm for finding a sparse Kerdock approximation. That is, for k small compared with 1/sqrt{N} and for epsilon > 0, we find, in time polynomial in (k log(N)/epsilon), a k-Kerdock-term approximation s~ to s with Euclidean error at most the factor (1+epsilon+O(k^2/sqrt{N})) times that of the best such approximation. | 2022-09-01T06:08:49.169Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0607098",
"ArXiv": "cs/0607098",
"MAG": "1633516544",
"CorpusId": "446",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/059fc8d6c748af720f4352ab8ec405ddd6501e20 | List decoding of noisy Reed-Muller-like codes | [
{
"authorId": "144003733",
"name": "A. Calderbank"
},
{
"authorId": "1795861",
"name": "A. Gilbert"
},
{
"authorId": "145542622",
"name": "M. Strauss"
}
] | ArXiv | 2,006 | 34 | 6 | 1 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 2006-07-20T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0607098",
"pages": null
} | [
"communication"
] | [
"communication",
"sparse approximations",
"block codes",
"adaptive algorithms",
"binary codes",
"code generation",
"source codes"
] | [
"source codes",
"block codes",
"sparse approximations",
"communication",
"adaptive algorithms",
"binary codes",
"code generation"
] | [
"software engineering",
"bit error rate",
"information theory",
"approximation algorithms",
"signal reconstruction",
"software",
"program compilers",
"computer science",
"communication channels",
"signal to noise ratio",
"probability",
"graph theory",
"approximation theory",
"signal processing",
"parallel processing systems",
"computer programming languages",
"wireless telecommunication systems",
"mathematics",
"theoretical computer science",
"engineering",
"distributed systems",
"computer programming",
"computer networks",
"communication systems",
"telecommunication systems",
"distributed computer systems",
"computer systems"
] |
448 | The advantages of mixed approach with using different kinds of programming techniques for symbolic manipulation are discussed. The main purpose of approach offered is merge the methods of object oriented programming that convenient for presentation data and algorithms for user with advantages of functional languages for data manipulation, internal presentation, and portability of software. | 2022-02-13T16:00:07.172Z | {
"ACL": null,
"DBLP": "journals/corr/cs-SC-9901006",
"ArXiv": "cs/9901006",
"MAG": "1572502462",
"CorpusId": "448",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/cc8cf387c35528e42874268cbab1f15d39758bbd | Object Oriented and Functional Programming for Symbolic Manipulation | [
{
"authorId": "31795541",
"name": "A. Vlasov"
}
] | ArXiv | 1,999 | 7 | 1 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 1999-01-13T00:00:00 | {
"name": "ArXiv",
"volume": "cs.SC/9901006",
"pages": null
} | [
"object oriented",
"object oriented programming",
"functional programming",
"functional languages",
"software"
] | [
"object oriented",
"functional programming",
"functional languages",
"programming languages",
"software"
] | [
"object oriented",
"object oriented programming",
"programming languages",
"functional programming",
"functional languages",
"software"
] | [
"computer programming",
"computer programming languages",
"linguistics",
"program compilers",
"computer science",
"parallel processing systems",
"distributed systems",
"distributed computer systems",
"computer systems"
] |
449 | In south India, there are traditional patterns of line-drawings encircling dots, called ``Kolam'', among which one-line drawings or the ``infinite Kolam'' provide very interesting questions in mathematics. For example, we address the following simple question: how many patterns of infinite Kolam can we draw for a given grid pattern of dots? The simplest way is to draw possible patterns of Kolam while judging if it is infinite Kolam. Such a search problem seems to be NP complete. However, it is certainly not. In this paper, we focus on diamond-shaped grid patterns of dots, (1-3-5-3-1) and (1-3-5-7-5-3-1) in particular. By using the knot-theory description of the infinite Kolam, we show how to find the solution, which inevitably gives a sketch of the proof for the statement ``infinite Kolam is not NP complete.'' Its further discussion will be given in the final section. | 2022-08-21T09:57:53.306Z | {
"ACL": null,
"DBLP": "journals/corr/abs-0710-1976",
"ArXiv": "0710.1976",
"MAG": "1530606456",
"CorpusId": "449",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/f037c33d4c61d37c3b614fc09b44ca6a2ed73496 | Solving Infinite Kolam in Knot Theory | [
{
"authorId": "2700185",
"name": "Y. Ishimoto"
}
] | ArXiv | 2,006 | 12 | 6 | 1 | false | [
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Physics",
"source": "external"
}
] | [
"JournalArticle"
] | 2006-10-01T00:00:00 | {
"name": "ArXiv",
"volume": "abs/0710.1976",
"pages": null
} | [
"mathematics",
"drawing (graphics)"
] | [
"line drawings",
"drawing (graphics)",
"mathematics",
"grid node",
"engineering drawing"
] | [
"line drawings",
"grid node",
"drawing (graphics)",
"engineering drawing",
"mathematics"
] | [
"3d data",
"3d modelling",
"3d scenes",
"3d object",
"3d objects",
"grid environments",
"graph theory",
"computer aided design",
"visualization",
"three dimensional computer graphics",
"grid computing",
"theoretical computer science",
"computer science",
"human computer interaction",
"computer imaging and vision",
"parallel processing systems",
"distributed systems",
"distributed computer systems",
"computer systems"
] |
451 | In this paper, we try to further demonstrate that the models of random CSP instances proposed by [Xu and Li, 2000; 2003] are of theoretical and practical interest. Indeed, these models, called RB and RD, present several nice features. First, it is quite easy to generate random instances of any arity since no particular structure has to be integrated, or property enforced, in such instances. Then, the existence of an asymptotic phase transition can be guaranteed while applying a limited restriction on domain size and on constraint tightness. In that case, a threshold point can be precisely located and all instances have the guarantee to be hard at the threshold, i.e., to have an exponential tree-resolution complexity. Next, a formal analysis shows that it is possible to generate forced satisfiable instances whose hardness is similar to unforced satisfiable ones. This analysis is supported by some representative results taken from an intensive experimentation that we have carried out, using complete and incomplete search methods. | 2022-09-05T00:48:02.178Z | {
"ACL": null,
"DBLP": "conf/ijcai/XuBHL05",
"ArXiv": "cs/0509032",
"MAG": "2952115075",
"CorpusId": "451",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/d4e93ac90c3f66cd6a7f8d104b7c1b37c09e8629 | A Simple Model to Generate Hard Satisfiable Instances | [
{
"authorId": "145389711",
"name": "Ke Xu"
},
{
"authorId": "2448376",
"name": "F. Boussemart"
},
{
"authorId": "1698499",
"name": "F. Hemery"
},
{
"authorId": "1723408",
"name": "Christophe Lecoutre"
}
] | IJCAI | 2,005 | 29 | 92 | 5 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Physics",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 2005-07-30T00:00:00 | {
"name": null,
"volume": null,
"pages": "337-342"
} | [
"communicating sequential processes"
] | [
"boolean formulae",
"propositional formulas",
"satisfying assignments",
"communicating sequential processes",
"standard model"
] | [
"standard model",
"satisfying assignments",
"communicating sequential processes",
"propositional formulas",
"boolean formulae"
] | [
"electronic document identification systems",
"the standard model",
"satisfiability",
"formal methods",
"model checking",
"computer programming languages",
"propositional logic",
"boolean functions",
"boolean algebra",
"authentication",
"cryptography",
"public key cryptography",
"formal logic",
"embedded systems",
"architecture verification and validation",
"computer programming",
"logic programming",
"mathematics",
"matrix algebra",
"security of data",
"cryptology",
"network security",
"artificial intelligence",
"computer systems",
"architecting",
"computer science",
"computer security",
"computer networks",
"software architecture",
"software design",
"software engineering"
] |
454 | We here introduce explicit constructions of minimum-delay perfect space-time codes for any number n/sub t/ of transmit antennas and any number n/sub t/ of receive antennas. We also proceed to construct non-minimal delay perfect space-time codes for any n/sub t/, n/sub r/ and any block length T /spl ges/ n/sub t/. Perfect space-time codes were first introduced in F. Oggier et al. (2004) for dimensions of 2 /spl times/ 2, 3 /spl times/ 3, 4 /spl times/ 4 and 6 /spl times/ 6, to be the space-time codes that have full rate, full diversity-gain, non-vanishing determinant for increasing spectral efficiency, uniform average transmitted energy per antenna and good shaping of the constellation. The term perfect corresponds to the fact that the code simultaneously satisfies all the above mentioned important criteria. As a result, perfect codes have proven to have extraordinary performance. Finally, we point out that the set of criteria in F. Oggier et al. (2004) of non-vanishing determinant, full diversity, and full rate, is a subset of the more general and more strict set of criteria for optimally in the diversity-multiplexing gain (D-MG) tradeoff [Elias, P. et al., 2004], [Kumar, K.R. et al., 2005], an approach that takes special significance when constructing non-minimal delay perfect codes. Both minimum and non-minimum delay perfect codes are shown to be D-MG optimal. | 2022-09-03T05:05:08.316Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0512023",
"ArXiv": "cs/0512023",
"MAG": "1728768935",
"CorpusId": "454",
"PubMed": null,
"DOI": "10.1109/WIRLES.2005.1549496",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/5252ee205bfaa00ff0a85284aed695fb190bbad9 | Perfect space-time codes with minimum and non-minimum delay for any number of antennas | [
{
"authorId": "1688531",
"name": "P. Elia"
},
{
"authorId": "145138395",
"name": "B. Sethuraman"
},
{
"authorId": "145874798",
"name": "P. V. Kumar"
}
] | 2005 International Conference on Wireless Networks, Communications and Mobile Computing | 2,005 | 109 | 76 | 2 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 2005-06-13T00:00:00 | {
"name": "2005 International Conference on Wireless Networks, Communications and Mobile Computing",
"volume": "1",
"pages": "722-727 vol.1"
} | [
"receive antenna",
"antennas",
"full rate",
"space-time coding",
"transmit antenna",
"spectral efficiencies",
"block lengths"
] | [
"space-time coding",
"antennas",
"receive antenna",
"transmit antenna",
"full rate",
"diversity gain",
"spectral efficiencies",
"space-time block codes",
"antenna element",
"antenna arrays",
"transmitting antenna",
"block codes",
"receiving antennas",
"antenna systems",
"software product line",
"product lines",
"stbc",
"alamouti codes",
"orthogonal space-time block codes",
"jitter",
"end to end delay",
"time delay",
"delay jitters",
"variability management",
"software product line engineerings",
"product derivation"
] | [
"transmitting antenna",
"stbc",
"block codes",
"space-time block codes",
"time delay",
"software product line engineerings",
"transmit antenna",
"spectral efficiencies",
"block lengths",
"jitter",
"receiving antennas",
"orthogonal space-time block codes",
"antenna systems",
"delay jitters",
"antenna arrays",
"variability management",
"diversity gain",
"product derivation",
"receive antenna",
"antennas",
"full rate",
"space-time coding",
"antenna element",
"end to end delay",
"software product line",
"product lines",
"alamouti codes"
] | [
"signal encoding",
"space time adaptive processing",
"ofdm",
"mimo",
"mimo systems",
"bit error rate",
"information theory",
"computer systems",
"wireless telecommunication systems",
"ldpc codes",
"bandwidth",
"fading (radio)",
"multiplexing",
"fading channels",
"rayleigh fading",
"antenna accessories",
"communication channels",
"signal to noise ratio",
"matrix algebra",
"mim devices",
"ad hoc networks",
"routing protocols",
"computer software reusability",
"network architecture",
"model checking",
"functional requirement",
"orthogonal frequency division multiplexing",
"data communication systems",
"probability",
"communication",
"computer science",
"computer networks",
"communication systems",
"telecommunication systems",
"low-density parity-check codes",
"signal detection",
"signal processing",
"mathematics",
"routers",
"mobile telecommunication systems",
"internet protocols",
"quality of service",
"wireless local area networks (wlan)",
"multicasts",
"routing algorithms",
"sensors",
"software design",
"object oriented programming",
"computer programming languages",
"embedded systems",
"architecture verification and validation",
"requirements engineering",
"iterative decoding",
"channel capacity",
"graph theory",
"engineering",
"telecommunication traffic",
"telecommunication networks",
"local area networks",
"computer hardware",
"software engineering",
"computer programming",
"architecting",
"theoretical computer science",
"software architecture"
] |
456 | This paper explores the automatic construction of a multilingual Lexical Knowledge Base from pre-existing lexical resources. We present a new and robust approach for linking already existing lexical/semantic hierarchies. We used a constraint satisfaction algorithm (relaxation labeling) to select -among all the candidate translations proposed by a bilingual dictionarythe right English WordNet synset for each sense in a taxonomy automatically derived from a Spanish monolingua] dictionary. Although on average, there are 15 possible WordNet connections for each sense in the taxonomy, the method achieves an accuracy over 80~. Finally, we also propose several ways in which this technique could be applied to enrich and improve existing lexical databases. | 2022-09-04T18:44:02.898Z | {
"ACL": "W99-0603",
"DBLP": "journals/corr/cs-CL-9906025",
"ArXiv": "cs/9906025",
"MAG": "1604592379",
"CorpusId": "456",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/a6421c4607f84c4b615c8c03dde859e77bf9a02b | Mapping Multilingual Hierarchies Using Relaxation Labeling | [
{
"authorId": "2336217",
"name": "J. Daudé"
},
{
"authorId": "1778523",
"name": "Lluís Padró"
},
{
"authorId": "1785173",
"name": "German Rigau"
}
] | EMNLP | 1,999 | 32 | 31 | 4 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Linguistics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 1999-06-01T00:00:00 | {
"name": "ArXiv",
"volume": "cs.CL/9906025",
"pages": null
} | [
"bilingual",
"wordnet",
"lexical semantics",
"lexical database",
"knowledge base"
] | [
"knowledge base",
"lexical database",
"wordnet",
"semantics",
"database systems"
] | [
"bilingual",
"lexical semantics",
"wordnet",
"lexical database",
"semantics",
"database systems",
"knowledge base"
] | [
"multilingualism",
"computational linguistics",
"natural language processing",
"computer systems",
"knowledge based systems",
"linguistics",
"artificial intelligence",
"natural languages",
"computer science"
] |
457 | We analyze a large-scale snapshot of del.icio.us and investigate how the number of different tags in the system grows as a function of a suitably defined notion of time. We study the temporal evolution of the global vocabulary size, i.e. the number of distinct tags in the entire system, as well as the evolution of local vocabularies, that is the growth of the number of distinct tags used in the context of a given resource or user. In both cases, we find power-law behaviors with exponents smaller than one. Surprisingly, the observed growth behaviors are remarkably regular throughout the entire history of the system and across very different resources being bookmarked. Similar sub-linear laws of growth have been observed in written text, and this qualitative universality calls for an explanation and points in the direction of non-trivial cognitive processes in the complex interaction patterns characterizing collaborative tagging. | 2022-09-04T11:53:31.365Z | {
"ACL": null,
"DBLP": "journals/corr/abs-0704-3316",
"ArXiv": "0704.3316",
"MAG": "1545699230",
"CorpusId": "457",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/a183996461fa9e83c9a83600e3dd075bc2002926 | Vocabulary growth in collaborative tagging systems | [
{
"authorId": "144300761",
"name": "C. Cattuto"
},
{
"authorId": "1730687",
"name": "A. Baldassarri"
},
{
"authorId": "2776193",
"name": "V. Servedio"
},
{
"authorId": "144347993",
"name": "V. Loreto"
}
] | ArXiv | 2,007 | 16 | 55 | 8 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Physics",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-04-25T00:00:00 | {
"name": "ArXiv",
"volume": "abs/0704.3316",
"pages": null
} | [
"vocabulary",
"cognitive process",
"collaborative tagging"
] | [
"vocabulary",
"collaborative tagging",
"social tagging",
"cognitive process",
"folksonomies",
"social bookmarking"
] | [
"vocabulary",
"collaborative tagging",
"cognitive process",
"folksonomies",
"social bookmarking",
"social tagging"
] | [
"linguistics",
"recommender systems",
"user interfaces",
"cognitive systems",
"web 2.0",
"social networks",
"search engines",
"information retrieval",
"human computer interaction",
"artificial intelligence",
"world wide web",
"computer science",
"internet"
] |
459 | In this paper, the problem of pinning control for synchronization of complex dynamical networks is discussed. A cost function of the controlled network is defined by the feedback gain and the coupling strength of the network. An interesting result is that lower cost is achieved by the control scheme of pinning nodes with smaller degrees. Some rigorous mathematical analysis is presented for achieving lower cost in the synchronization of different star-shaped networks. Numerical simulations on some non-regular complex networks generated by the Barabasi-Albert model and various star-shaped networks are shown for verification and illustration. | 2022-06-20T11:42:25.833Z | {
"ACL": null,
"DBLP": "journals/corr/abs-0710-2716",
"ArXiv": "0710.2716",
"MAG": "2950917646",
"CorpusId": "459",
"PubMed": null,
"DOI": "10.1088/1674-1056/18/1/018",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/25083d018d6307aaea64003f01077e23a3376608 | Cost and Effects of Pinning Control for Network Synchronization | [
{
"authorId": "2119921452",
"name": "Rong Li"
},
{
"authorId": "8200163",
"name": "Z. Duan"
},
{
"authorId": "145205045",
"name": "Guanrong Chen"
}
] | ArXiv | 2,007 | 24 | 11 | 0 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-10-14T00:00:00 | {
"name": "ArXiv",
"volume": "abs/0710.2716",
"pages": null
} | [
"verification",
"complex dynamical networks",
"complex networks",
"pinning control"
] | [
"network architecture",
"complex dynamical networks",
"dynamical networks",
"complex networks",
"verification"
] | [
"verification",
"complex dynamical networks",
"network architecture",
"pinning control",
"complex networks",
"dynamical networks"
] | [
"verification and validation",
"time varying networks",
"computer networks",
"topology",
"software quality",
"time varying control systems",
"computer science",
"software design",
"nonlinear control systems",
"linear control systems",
"lyapunov functions",
"software engineering",
"adaptive control systems",
"feedback systems",
"control theory",
"linear matrix inequalities",
"differential equations",
"process control",
"computer systems",
"mathematics",
"matrix algebra",
"numerical methods",
"automation",
"engineering"
] |
462 | The aim of this paper is to characterize the moveability of fully-parallel manipulators in the presence of obstacles. Fully parallel manipulators are used in applications where accuracy, stiffness or high speeds and accelerations are required \cite{Merlet:97}. However, one of its main drawbacks is a relatively small workspace compared to the one of serial manipulators. This is due mainly to the existence of potential internal collisions, and the existence of singularities. In this paper, the notion of free aspect is defined which permits to exhibit domains of the workspace and the joint space free of singularity and collision. The main application of this study is the moveability analysis in the workspace of the manipulator as well as path-planning, control and design. | 2022-06-18T20:49:44.957Z | {
"ACL": null,
"DBLP": "journals/corr/abs-0707-1957",
"ArXiv": "0707.1957",
"MAG": "1580335239",
"CorpusId": "462",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/a8fc23a4138cdfc8d72a3ec4630b010126f52088 | Moveability and Collision Analysis for Fully-Parallel Manipulators | [
{
"authorId": "1747337",
"name": "D. Chablat"
},
{
"authorId": "145408961",
"name": "P. Wenger"
}
] | ArXiv | 2,007 | 8 | 18 | 1 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-07-13T00:00:00 | {
"name": "ArXiv",
"volume": "abs/0707.1957",
"pages": null
} | [
"parallel manipulators",
"joint space",
"serial manipulators",
"robotic manipulators",
"path planning",
"singularity"
] | [
"parallel manipulators",
"serial manipulators",
"robotic manipulators",
"singularity",
"joint space",
"path planning"
] | [
"parallel manipulators",
"joint space",
"serial manipulators",
"robotic manipulators",
"path planning",
"singularity"
] | [
"inverse kinematics",
"redundant manipulators",
"machine design",
"robots",
"motion planning",
"robotics",
"mobile robots",
"computer science"
] |
464 | The Artificial Neural network is a functional imitation of simplified model of the biological neurons and their goal is to construct useful computers for real world problems. The ANN applications have increased dramatically in the last few years fired by both theoretical and practical applications in a wide variety of applications. A brief theory of ANN is presented and potential areas are identified and future trends are discussed. | 2022-08-30T03:43:22.913Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0505019",
"ArXiv": "cs/0505019",
"MAG": "1777236251",
"CorpusId": "464",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/f80840242bcb51f616e26ae8677a751f77a80885 | Artificial Neural Networks and their Applications | [
{
"authorId": "47929573",
"name": "Nitin Malik"
}
] | ArXiv | 2,005 | 27 | 30 | 2 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2005-05-09T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0505019",
"pages": null
} | [
"ann",
"neural networks"
] | [
"neural networks",
"ann",
"artificial neural network (ann)",
"feedforward neural networks",
"network architecture"
] | [
"artificial neural network (ann)",
"network architecture",
"feedforward neural networks",
"ann",
"neural networks"
] | [
"computer networks",
"backpropagation algorithm",
"machine learning",
"computer science",
"artificial intelligence"
] |
465 | This paper describes two new bunsetsu identification methods using supervised learning. Since Japanese syntactic analysis is usually done after bunsetsu identification, bunsetsu identification is important for analyzing Japanese sentences. In experiments comparing the four previously available machine-learning methods (decision tree, maximum-entropy method, example-based approach and decision list) and two new methods using category-exclusive rules, the new method using the category-exclusive rules with the highest similarity performed best. | 2022-09-02T06:29:27.804Z | {
"ACL": "C00-1082",
"DBLP": "journals/corr/cs-CL-0008031",
"ArXiv": "cs/0008031",
"MAG": "2952784406",
"CorpusId": "465",
"PubMed": null,
"DOI": "10.3115/990820.990902",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/c02aecb95a5d3ca9b045711b35e4f86adf2a0ae5 | Bunsetsu Identification Using Category-Exclusive Rules | [
{
"authorId": "1697381",
"name": "M. Murata"
},
{
"authorId": "1783611",
"name": "Kiyotaka Uchimoto"
},
{
"authorId": "145853732",
"name": "Q. Ma"
},
{
"authorId": "1714134",
"name": "H. Isahara"
}
] | COLING | 2,000 | 46 | 12 | 0 | true | [
{
"category": "Business",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 2000-07-31T00:00:00 | {
"name": null,
"volume": null,
"pages": "565-571"
} | [
"japanese",
"machine learning",
"syntactic analysis",
"decision trees"
] | [
"syntactic structure",
"syntactics",
"syntactic analysis",
"decision trees",
"part of speech"
] | [
"part of speech",
"syntactic analysis",
"syntactic structure",
"japanese",
"machine learning",
"decision trees",
"syntactics"
] | [
"natural language processing",
"asian continental ancestry group",
"artificial intelligence",
"data mining",
"classifiers",
"computational linguistics",
"natural languages",
"genotype",
"genetic association",
"computer science",
"database systems",
"linguistics",
"semantics",
"single nucleotide polymorphism",
"genetic analysis",
"computer systems",
"bioinformatics"
] |
467 | As the speed and the dynamic range of computer networks evolve, the issue of efficient traffic management becomes increasingly important. The paper describes an approach to traffic management using explicit rate information provided to the source by the network. The authors present an asynchronous distributed algorithm for optimal rate calculation across the network, where optimality is understood in the maxmin sense. The algorithm quickly converges to the optimal rates and is shown to be well-behaved in transience. | 2022-09-05T03:31:58.405Z | {
"ACL": null,
"DBLP": "journals/corr/cs-NI-9809082",
"ArXiv": "cs/9809082",
"MAG": "2952212545",
"CorpusId": "467",
"PubMed": null,
"DOI": "10.1109/ICC.1995.524537",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/035de2643bba93617dc51071baab10b8b1f37569 | Congestion control with explicit rate indication | [
{
"authorId": "2309212",
"name": "A. Charny"
},
{
"authorId": "2117734545",
"name": "D. Clark"
},
{
"authorId": "145889709",
"name": "R. Jain"
}
] | Proceedings IEEE International Conference on Communications ICC '95 | 1,995 | 71 | 308 | 21 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 1995-06-18T00:00:00 | {
"name": "Proceedings IEEE International Conference on Communications ICC '95",
"volume": "3",
"pages": "1954-1963 vol.3"
} | [
"computer networks",
"congestion control (communication)",
"distributed algorithm"
] | [
"congestion",
"congestion control (communication)",
"computer networks",
"network architecture",
"congestion avoidance"
] | [
"computer networks",
"network architecture",
"congestion control (communication)",
"distributed algorithm",
"congestion",
"congestion avoidance"
] | [
"computer science",
"parallel algorithms",
"telecommunication traffic",
"transmission control protocol",
"bandwidth",
"parallel processing systems",
"telecommunication networks",
"internet protocols",
"distributed systems",
"telecommunication systems",
"distributed computer systems",
"computer systems"
] |
468 | Presented are a methodology and a DFII-based tool for AC-stability analysis of a wide variety of closed-loop continuous-time systems (operational amplifiers and other linear circuits). The methodology used allows for easy identification and diagnostics of AC-stability problems including not only main-loop effects, but also local-instability loops in current mirrors, bias circuits and emitter or source followers without breaking the loop. The results of the analysis are easy to interpret. Estimated phase margin is readily available. Instability nodes and loops along with their respective oscillation frequencies are immediately identified and mapped to the existing circuit nodes, thus offering significant advantages compared to traditional "black-box" methods of stability analysis (transient overshoot, bode and phase margin plots, etc.). The tool for AC-stability analysis is written in SKILL/spl trade/ and is fully integrated in the DFII/spl trade/ environment. Its "pushbutton" graphical user interface (GUI) is easy to use and understand. The tool can be invoked directly from a Composer/spl trade/ schematic and does not require an active Analog Artist/spl trade/ session. The tool is not dependent on the use of a specific fabrication technology or process design kit customization. It requires OCEAN/spl trade/, Spectre/spl trade/ and waveform calculator capabilities to run. | 2022-09-01T09:11:45.544Z | {
"ACL": null,
"DBLP": "conf/date/MilevB05",
"ArXiv": "0710.4836",
"MAG": "2949752816",
"CorpusId": "468",
"PubMed": null,
"DOI": "10.1109/DATE.2005.42",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/fd61983d83953f335c4e44c2b47ee4e97b1da947 | A tool and methodology for AC-stability analysis of continuous-time closed-loop systems | [
{
"authorId": "29789091",
"name": "M. Milev"
},
{
"authorId": "52390878",
"name": "R. Burt"
}
] | Design, Automation and Test in Europe | 2,005 | 10 | 7 | 0 | true | [
{
"category": "Physics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Book"
] | 2005-03-07T00:00:00 | {
"name": "Design, Automation and Test in Europe",
"volume": null,
"pages": "204-208 Vol. 3"
} | [
"trade",
"continuous time systems",
"graphical user interfaces",
"continuous time",
"frequencies",
"closed loop systems"
] | [
"continuous time",
"continuous time systems",
"stability problem",
"frequencies",
"graphical user interfaces",
"user interfaces",
"software product line",
"product lines",
"global stability",
"asymptotic stability",
"asymptotical stability"
] | [
"graphical user interfaces",
"trade",
"continuous time systems",
"stability problem",
"asymptotical stability",
"continuous time",
"user interfaces",
"frequencies",
"software product line",
"product lines",
"asymptotic stability",
"closed loop systems",
"global stability"
] | [
"commerce",
"linear systems",
"linear matrix inequalities",
"stability criteria",
"control system stability",
"delay control systems",
"sufficient conditions",
"numerical example",
"human computer interaction",
"bandwidth",
"computer software reusability",
"network architecture",
"model checking",
"functional requirement",
"closed loop control systems",
"state feedback",
"lyapunov functions",
"adaptive control systems",
"economics",
"matrix algebra",
"control systems",
"control system analysis",
"time delay",
"numerical methods",
"computer science",
"computer networks",
"software design",
"object oriented programming",
"computer programming languages",
"embedded systems",
"architecture verification and validation",
"requirements engineering",
"nonlinear control systems",
"control system synthesis",
"feedback control",
"differential equations",
"process control",
"mathematics",
"computer systems",
"software engineering",
"computer programming",
"architecting",
"feedback systems",
"control theory",
"automation",
"software architecture",
"engineering"
] |
470 | We study codes on graphs combined with an iterative message passing algorithm for quantization. Specifically, we consider the binary erasure quantization (BEQ) problem which is the dual of the binary erasure channel (BEC) coding problem. We show that duals of capacity achieving codes for the BEC yield codes which approach the minimum possible rate for the BEQ. In contrast, low density parity check codes cannot achieve the minimum rate unless their density grows at least logarithmically with block length. Furthermore, we show that duals of efficient iterative decoding algorithms for the BEC yield efficient encoding algorithms for the BEQ. Hence our results suggest that graphical models may yield near optimal codes in source coding as well as in channel coding and that duality plays a key role in such constructions. | 2022-09-05T00:02:07.730Z | {
"ACL": null,
"DBLP": "journals/corr/cs-IT-0408008",
"ArXiv": "cs/0408008",
"MAG": "1544902333",
"CorpusId": "470",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/2701a556a256a9ddc4e284323463f76fb178241c | Iterative Quantization Using Codes On Graphs | [
{
"authorId": "1682783",
"name": "E. Martinian"
},
{
"authorId": "3198578",
"name": "J. Yedidia"
}
] | ArXiv | 2,004 | 9 | 91 | 12 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 2004-08-02T00:00:00 | {
"name": "ArXiv",
"volume": "cs.IT/0408008",
"pages": null
} | [
"source coding",
"quantization",
"iterative decoding algorithm",
"binary erasure channel",
"message passing algorithm",
"channel coding",
"graphical model",
"block lengths"
] | [
"quantizers",
"quantization",
"binary erasure channel",
"graphical model",
"channel coding",
"parity bits",
"ldpc codes",
"low-density parity-check codes",
"low density parity check (ldpc) codes",
"block codes",
"adaptive algorithms"
] | [
"source coding",
"quantization",
"iterative decoding algorithm",
"binary erasure channel",
"message passing algorithm",
"parity bits",
"low-density parity-check codes",
"channel coding",
"graphical model",
"quantizers",
"block lengths",
"block codes",
"ldpc codes",
"low density parity check (ldpc) codes",
"adaptive algorithms"
] | [
"signal encoding",
"data compression",
"image compression",
"signal processing",
"turbo codes",
"belief propagation",
"inference engines",
"information theory",
"distributed video coding",
"wyner-ziv",
"iterative decoding",
"channel capacity",
"graph theory",
"matrix algebra",
"image coding",
"bit error rate",
"fading channels",
"bayesian methods",
"graphic methods",
"software",
"communication channels",
"signal to noise ratio",
"image quality",
"engineering",
"quadrature amplitude modulation",
"convolutional codes",
"code division multiple access",
"additive white gaussian noise",
"data communication systems",
"backpropagation algorithm",
"artificial intelligence",
"communication",
"programming theory",
"video coding",
"imaging systems",
"theoretical computer science",
"mathematics",
"image processing",
"probability",
"computer science",
"wireless telecommunication systems",
"image analysis",
"fading (radio)",
"rayleigh fading",
"orthogonal frequency division multiplexing",
"white noise",
"gaussian noise (electronic)",
"computer systems",
"neural networks",
"computer programming languages",
"video processing",
"visual communication",
"motion estimation",
"image reconstruction",
"computer imaging and vision",
"computer networks",
"communication systems",
"telecommunication systems",
"signal detection",
"machine learning",
"computer programming"
] |
472 | Due to a large number of multipath components in a typical ultra wideband (UWB) system, selective rake (SRake) receivers, which combine energy from a subset of multipath components, are commonly employed. In order to optimize system performance, an optimal selection of multipath components to be employed at fingers of an SRake receiver needs to be considered. In this paper, this finger selection problem is investigated for a minimum mean square error (MMSE) UWB SRake receiver. Since the optimal solution is NP hard, a genetic algorithm (GA) based iterative scheme is proposed, which can achieve near-optimal performance after a reasonable number of iterations. Simulation results are presented to compare the performance of the proposed finger selection algorithm with those of the conventional and optimal schemes. | 2022-08-31T14:36:50.528Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0507005",
"ArXiv": "cs/0507005",
"MAG": "1515128459",
"CorpusId": "472",
"PubMed": null,
"DOI": "10.1109/ICU.2005.1569977",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/d7390e1cc50c854dcb0802cc9958f059ff2ffd76 | A genetic algorithm based finger selection scheme for UWB MMSE rake receivers | [
{
"authorId": "1761676",
"name": "S. Gezici"
},
{
"authorId": "116491218",
"name": "M. Chiang"
},
{
"authorId": "145967056",
"name": "H. Poor"
},
{
"authorId": "1764149",
"name": "H. Kobayashi"
}
] | 2005 IEEE International Conference on Ultra-Wideband | 2,005 | 23 | 27 | 0 | true | [
{
"category": "Business",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 2005-07-03T00:00:00 | {
"name": "2005 IEEE International Conference on Ultra-Wideband",
"volume": null,
"pages": "164-169"
} | [
"optimal solutions",
"rake receiver",
"uwb",
"ultra-wideband (uwb)",
"selection scheme",
"genetic algorithms",
"genetic selection",
"mean square error"
] | [
"genetic algorithms",
"selection scheme",
"uwb",
"ultra-wideband (uwb)",
"minimum mean-square error",
"rake receiver",
"wide-band",
"mean square",
"mean square error"
] | [
"optimal solutions",
"rake receiver",
"selection scheme",
"uwb",
"ultra-wideband (uwb)",
"genetic algorithms",
"minimum mean-square error",
"wide-band",
"mean square",
"genetic selection",
"mean square error"
] | [
"computer systems",
"radio receivers",
"code division multiple access",
"signal receivers",
"relay selection",
"broadband networks",
"multipath propagation",
"antennas",
"artificial intelligence",
"mimo systems",
"bandwidth",
"sufficient conditions",
"stochastic processes",
"genetic analysis",
"signal to noise ratio",
"computer science",
"fading (radio)",
"communication channels",
"signal detection",
"channel state information",
"amplify-and-forward (af)",
"cooperative communication",
"relay node",
"cooperative diversity",
"outages",
"closed-form expression",
"outage probability",
"telecommunication traffic",
"wireless telecommunication systems",
"computer networks",
"linear matrix inequalities",
"probability",
"bioinformatics",
"signal processing",
"bit error rate",
"rayleigh fading",
"multiplexing",
"channel capacity",
"transmitters",
"fading channels",
"wireless sensor networks",
"communication",
"wireless networks",
"ad hoc networks",
"network coding",
"diversity reception",
"telecommunication networks",
"communication systems",
"telecommunication systems",
"matrix algebra",
"mathematics",
"engineering",
"information theory",
"wireless communications",
"energy utilization",
"sensor nodes",
"routing algorithms",
"packet networks",
"routers",
"mobile telecommunication systems",
"internet protocols",
"quality of service",
"wireless local area networks (wlan)",
"multicasts",
"sensors",
"electricity",
"local area networks",
"data communication systems",
"computer hardware"
] |
474 | The LOCKSS digital preservation system collects content by crawling the web and preserves it in the format supplied by the publisher. Eventually, browsers will no longer understand that format. A process called format migration converts it to a newer format that the browsers do understand. The LOCKSS program has designed and tested an initial implementation of format migration for Web content that is transparent to readers, building on the content negotiation capabilities of HTTP. | 2022-09-01T09:16:06.122Z | {
"ACL": null,
"DBLP": "journals/dlib/RosenthalLRM05",
"ArXiv": "cs/0411077",
"MAG": "2952422204",
"CorpusId": "474",
"PubMed": null,
"DOI": "10.1045/january2005-rosenthal",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/21a7ec738ef6e69e2d90fda98c1ec5136e6d687d | Transparent Format Migration of Preserved Web Content | [
{
"authorId": "46838301",
"name": "D. Rosenthal"
},
{
"authorId": "2942799",
"name": "Thomas A. Lipkis"
},
{
"authorId": "2057022217",
"name": "Thomas Robertson"
},
{
"authorId": "34719093",
"name": "S. Morabito"
}
] | D Lib Mag. | 2,004 | 16 | 41 | 1 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2004-11-21T00:00:00 | {
"name": "D Lib Mag.",
"volume": "11",
"pages": null
} | [
"web content",
"digital preservation",
"http"
] | [
"web content",
"digital preservation",
"http",
"multimedia contents",
"digital contents"
] | [
"digital preservation",
"digital contents",
"http",
"multimedia contents",
"web content"
] | [
"digital libraries",
"digital storage",
"digital rights management",
"servers",
"client server computer systems",
"internet protocols",
"multimedia services",
"world wide web",
"database systems",
"user interfaces",
"computer hardware",
"digital watermarking",
"cryptography",
"security of data",
"telecommunication traffic",
"multimedia systems",
"distributed computer systems",
"data communication systems",
"internet",
"computer systems",
"human computer interaction",
"computer science",
"image processing",
"cryptology",
"computer security",
"telecommunication networks",
"computer imaging and vision",
"telecommunication systems"
] |
477 | A systematic, language-independent method of finding a minimal set of paths covering the code of a sequential program is proposed for application in White Box testing. Execution of all paths from the set ensures also statement coverage. Execution fault marks problematic areas of the code. The method starts from a UML activity diagram of a program. The diagram is transformed into a directed graph: graph's nodes substitute decision and action points; graph's directed edges substitute action arrows.
The number of independent paths equals easy-to-compute cyclomatic complexity of the graph. Association of a vector to each path creates a path vector space. Independence of the paths is equivalent to linear independence of the vectors. It is sufficient to test any base of the path space to complete the procedure. An effective algorithm for choosing the base paths is presented. | 2022-06-20T13:27:40.239Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0503050",
"ArXiv": "cs/0503050",
"MAG": "1642089629",
"CorpusId": "477",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/6d38b39129d2c04b2009d6c7fe4713fdbb889232 | Systematic Method for Path-Complete White Box Testing | [
{
"authorId": "1995923",
"name": "H. Makaruk"
},
{
"authorId": "1850650",
"name": "R. Owczarek"
},
{
"authorId": "2614207",
"name": "Nikita A. Sakhanenko"
}
] | ArXiv | 2,005 | 10 | 2 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2005-03-21T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0503050",
"pages": null
} | [
"sequential programs",
"uml activity diagrams",
"directed graphs"
] | [
"single path",
"routing scheme",
"unified modeling language",
"activity diagram",
"uml activity diagrams",
"directed graphs"
] | [
"unified modeling language",
"sequential programs",
"uml activity diagrams",
"single path",
"routing scheme",
"activity diagram",
"directed graphs"
] | [
"software engineering",
"object oriented programming",
"computer programming languages",
"model checking",
"program debugging",
"parallel program",
"multicore programming",
"program compilers",
"graphic methods",
"multi path routing",
"routing protocols",
"routing algorithms",
"graph theory",
"computer science",
"computer programming",
"embedded systems",
"architecture verification and validation",
"software quality",
"computer debugging",
"parallel programming",
"multi-core processor",
"parallel processing systems",
"routers",
"wireless telecommunication systems",
"computer networks",
"theoretical computer science",
"computer systems",
"architecting",
"software design",
"software",
"program processors",
"parallel algorithms",
"parallel architectures",
"multi core",
"distributed systems",
"telecommunication traffic",
"bandwidth",
"communication systems",
"telecommunication systems",
"software architecture",
"microprocessor chips",
"distributed computer systems",
"telecommunication networks",
"computer hardware"
] |
479 | In this paper, we describe an approach to sentence categorization which has the originality to be based on natural properties of languages with no training set dependency. The implementation is fast, small, robust and textual errors tolerant. Tested for french, english, spanish and german discrimination, the system gives very interesting results, achieving in one test 99.4% correct assignments on real sentences.
The resolution power is based on grammatical words (not the most common words) and alphabet. Having the grammatical words and the alphabet of each language at its disposal, the system computes for each of them its likelihood to be selected. The name of the language having the optimum likelihood will tag the sentence --- but non resolved ambiguities will be maintained. We will discuss the reasons which lead us to use these linguistic facts and present several directions to improve the system's classification performance.
Categorization sentences with linguistic properties shows that difficult problems have sometimes simple solutions. | 2022-09-02T18:48:52.348Z | {
"ACL": null,
"DBLP": "journals/corr/cmp-lg-9502039",
"ArXiv": "cmp-lg/9502039",
"MAG": "1572370751",
"CorpusId": "479",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/13be77bf3271737fcfb283c466b87eab92c4a050 | Multilingual Sentence Categorization according to Language | [
{
"authorId": "46733587",
"name": "Emmanuel Giguet"
}
] | ArXiv | 1,995 | 11 | 17 | 1 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 1995-02-28T00:00:00 | {
"name": "ArXiv",
"volume": "cmp-lg/9502039",
"pages": null
} | [
"classification methods",
"training sample",
"linguistics"
] | [
"syntactic structure",
"linguistics",
"classification methods",
"part of speech",
"document classification"
] | [
"classification methods",
"part of speech",
"training sample",
"document classification",
"syntactic structure",
"linguistics"
] | [
"computer systems",
"natural language processing",
"machine learning",
"text processing",
"information retrieval systems",
"syntactics",
"computer science",
"artificial intelligence",
"natural languages",
"computational linguistics",
"data mining",
"information retrieval",
"database systems",
"semantics"
] |
482 | Reduced feedback schemes facilitate scheduling and rate adaptation in orthogonal frequency division multiplexing systems while reducing the number of subchannels (SCs) for which channel state information (CSI) is fed back. In the popular selective feedback scheme, each user feeds back CSI about only its strongest SC to the base station (BS). We focus on the less studied, but practically important problem of transmitting reliably even on SCs that are fed back by no user or few users. We derive a constrained, non-linear minimum mean square error estimator that enables the BS to estimate the power gains of all the unreported SCs of a user. The novelty of the estimator lies in its exploitation of the structure of feedback generated by the selective feedback scheme. It improves the average cell throughput compared to several conventional approaches - without any additional feedback overhead. The improvements occur for both uncorrelated and correlated SCs, and for the channel-aware greedy and fair round-robin schedulers. | 2022-08-28T11:14:49.496Z | {
"ACL": null,
"DBLP": "conf/globecom/AnanyaM15",
"ArXiv": null,
"MAG": "2289340818",
"CorpusId": "482",
"PubMed": null,
"DOI": "10.1109/GLOCOM.2014.7416989",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/7e0942f828cfa0199881fe6319e95061575b545c | A Novel Constrained Estimator for Selective Feedback in OFDM and Its Implications | [
{
"authorId": "145281594",
"name": "S. Ananya"
},
{
"authorId": "1737149",
"name": "N. Mehta"
}
] | 2015 IEEE Global Communications Conference (GLOBECOM) | 2,014 | 19 | 1 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 2014-12-01T00:00:00 | {
"name": "2015 IEEE Global Communications Conference (GLOBECOM)",
"volume": null,
"pages": "1-6"
} | [
"power gains",
"csi",
"ofdm",
"rate adaptation",
"feedback scheme",
"base stations",
"feedback overhead",
"orthogonal frequency division",
"channel state information",
"frequency division multiplexing",
"mean square error",
"subchannels"
] | [
"ofdm",
"orthogonal frequency division multiplexing",
"feedback scheme",
"rate adaptation",
"orthogonal frequency division",
"frequency division multiplexing",
"multiplexing",
"subchannels",
"channel state",
"channel state information",
"csi",
"base stations",
"mean square",
"mean square error",
"power gains"
] | [
"orthogonal frequency division multiplexing",
"power gains",
"csi",
"ofdm",
"multiplexing",
"channel state",
"rate adaptation",
"feedback scheme",
"base stations",
"mean square",
"feedback overhead",
"orthogonal frequency division",
"channel state information",
"frequency division multiplexing",
"mean square error",
"subchannels"
] | [
"wireless telecommunication systems",
"communication channels",
"signal to noise ratio",
"wireless networks",
"state feedback",
"channel estimation",
"local area networks",
"limited feedback",
"mobile telecommunication systems",
"sufficient conditions",
"stochastic processes",
"precoding",
"frequency division multiple access",
"orthogonal functions",
"fading (radio)",
"rayleigh fading",
"channel capacity",
"transmitters",
"mimo systems",
"frequency allocation",
"computer networks",
"communication systems",
"telecommunication systems",
"signal processing",
"wireless communications",
"packet networks",
"feedback control",
"linear matrix inequalities",
"mim devices",
"beamforming",
"feedback systems",
"telecommunication networks",
"probability",
"bit error rate",
"signal detection",
"fading channels",
"information theory",
"signal receivers",
"antennas",
"telecommunication traffic",
"data communication systems",
"computer science",
"computer systems",
"engineering",
"matrix algebra",
"mathematics",
"communication"
] |
483 | This paper proposes the hardware implementation of RSA encryption/decryption algorithm using the algorithms of Ancient Indian Vedic Mathematics that have been modified to improve performance. The recently proposed hierarchical overlay multiplier architecture is used in the RSA circuitry for multiplication operation. The most significant aspect of the paper is the development of a division architecture based on Straight Division algorithm of Ancient Indian Vedic Mathematics and embedding it in RSA encryption/decryption circuitry for improved efficiency. The coding is done in Verilog HDL and the FPGA synthesis is done using Xilinx Spartan library. The results show that RSA circuitry implemented using Vedic division and multiplication is efficient in terms of area/speed compared to its implementation using conventional multiplication and division architectures. | 2022-09-02T13:41:22.362Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0609028",
"ArXiv": "cs/0609028",
"MAG": "1634607880",
"CorpusId": "483",
"PubMed": null,
"DOI": "10.1117/12.607697",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/8b90ad80ed111e554daa004d72946bb903df7ae9 | VLSI implementation of RSA encryption system using ancient Indian Vedic mathematics | [
{
"authorId": "2452409",
"name": "H. Thapliyal"
},
{
"authorId": "145978057",
"name": "M. Srinivas"
}
] | SPIE Microtechnologies | 2,005 | 13 | 65 | 0 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Engineering",
"source": "external"
}
] | [
"JournalArticle"
] | 2005-06-30T00:00:00 | {
"name": null,
"volume": "5837",
"pages": null
} | [
"multiplier",
"verilog hdl",
"rsa",
"encryption system",
"vlsi implementation",
"hardware implementations",
"multiplication",
"libraries",
"mathematics",
"encryption/decryption",
"field programmable gate array"
] | [
"vlsi",
"vlsi implementation",
"hardware implementations",
"rsa",
"encryption",
"decryption",
"encryption system",
"mathematics",
"computer hardware",
"field programmable gate array",
"multiplier",
"architecture designs",
"multiplication",
"verilog",
"verilog hdl",
"libraries",
"public key cryptosystems",
"cryptosystems",
"encryption/decryption",
"vhdl",
"data encryption",
"encryption technique",
"adaptive algorithms",
"system architectures",
"novel architecture",
"computational efficiency",
"diffie-hellman",
"parallel architectures",
"hardware design",
"hardware architecture",
"xilinx fpga"
] | [
"multiplier",
"encryption system",
"novel architecture",
"mathematics",
"vhdl",
"encryption/decryption",
"adaptive algorithms",
"cryptosystems",
"hardware design",
"parallel architectures",
"encryption",
"hardware implementations",
"libraries",
"architecture designs",
"data encryption",
"decryption",
"computer hardware",
"public key cryptosystems",
"encryption technique",
"system architectures",
"vlsi implementation",
"diffie-hellman",
"computational efficiency",
"verilog",
"hardware architecture",
"verilog hdl",
"rsa",
"multiplication",
"xilinx fpga",
"vlsi",
"field programmable gate array"
] | [
"frequency multiplying circuits",
"ciphertexts",
"proposed architectures",
"computer hardware description languages",
"network security",
"software",
"public key cryptography",
"parallel processing systems",
"security of data",
"cryptography",
"education",
"software architecture",
"computer science",
"software engineering",
"object oriented programming",
"network architecture",
"embedded systems",
"sensors",
"theoretical computer science",
"multiplying circuits",
"vlsi circuits",
"computer networks",
"authentication",
"distributed systems",
"computer security",
"cryptology",
"software design",
"computer programming",
"computer systems",
"adders",
"integrated circuit layout",
"digital signal processing",
"distributed computer systems",
"digital arithmetic",
"computer aided design",
"microprocessor chips",
"signal processing",
"engineering"
] |
484 | In this paper we extend the new family of (quantitative) belief conditioning rules (BCR) recently developed in the Dezert-Smarandache theory (DSmT) to their qualitative counterpart for belief revision. Since the revision of quantitative as well as qualitative belief assignment given the occurrence of a new event (the conditioning constraint) can be done in many possible ways, we present here only what we consider as the most appealing qualitative belief conditioning rules (QBCR) which allow to revise the belief directly with words and linguistic labels and thus avoids the introduction of ad-hoc translations of quantitative beliefs into quantitative ones for solving the problem. | 2022-08-29T01:08:27.402Z | {
"ACL": null,
"DBLP": "conf/fusion/SmarandacheD07",
"ArXiv": "0709.0522",
"MAG": "2951880107",
"CorpusId": "484",
"PubMed": null,
"DOI": "10.1109/ICIF.2007.4407995",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/8dac2c2e540d95128d5dc9fecb509256e63d194f | Qualitative belief conditioning rules (QBCR) | [
{
"authorId": "3270656",
"name": "F. Smarandache"
},
{
"authorId": "2319431",
"name": "J. Dezert"
}
] | 2007 10th International Conference on Information Fusion | 2,007 | 3 | 12 | 0 | true | [
{
"category": "Economics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 2007-07-09T00:00:00 | {
"name": "2007 10th International Conference on Information Fusion",
"volume": null,
"pages": "1-8"
} | [
"linguistics"
] | [
"rule base",
"linguistics",
"dempster-shafer theory",
"system theory",
"default logic"
] | [
"system theory",
"dempster-shafer theory",
"linguistics",
"default logic",
"rule base"
] | [
"artificial intelligence",
"formal logic",
"data fusion",
"non-monotonic reasoning",
"knowledge based systems",
"computer science",
"sensors",
"logic programming",
"knowledge representation",
"computer hardware",
"computer programming languages",
"semantics",
"computer programming"
] |
486 | Binary logic programs can be obtained from ordinary logic programs by a binarizing transformation. In most cases, binary programs obtained this way are less efficient than the original programs. (Demoen, 1992) showed an interesting example of a logic program whose computational behaviour was improved when it was transformed to a binary program and then specialized by partial deduction. The class of B-stratifiable logic programs is defined. It is shown that for every B-stratifiable logic program, binarization and subsequent partial deduction produce a binary program which does not contain variables for continuations introduced by binarization. Such programs usually have a better computational behaviour than the original ones. Both binarization and partial deduction can be easily automated. A comparison with other related approaches to program transformation is given. | 2022-02-13T16:01:25.395Z | {
"ACL": null,
"DBLP": "journals/corr/cs-PL-0312026",
"ArXiv": "cs/0312026",
"MAG": "2137485986",
"CorpusId": "486",
"PubMed": null,
"DOI": "10.1017/S147106840300190X",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/4e03eb359799f281bb9d4c80adc469c49a1a87c0 | Speedup of logic programs by binarization and partial deduction | [
{
"authorId": "1694853",
"name": "J. Hruza"
},
{
"authorId": "2070981861",
"name": "Peter Stepanek"
}
] | Theory and Practice of Logic Programming | 2,003 | 22 | 4 | 2 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2003-12-15T00:00:00 | {
"name": "Theory and Practice of Logic Programming",
"volume": "4",
"pages": "355 - 369"
} | [
"logic programs",
"binarizations"
] | [
"logic programs",
"binarizations",
"answer set semantics",
"dynamic logic",
"multivalued logic"
] | [
"logic programs",
"dynamic logic",
"binarizations",
"answer set semantics",
"multivalued logic"
] | [
"logic programming",
"modal logic",
"character recognition",
"image segmentation",
"answer set",
"many valued logics",
"computer programming languages",
"formal logic",
"pattern recognition",
"image analysis",
"image processing",
"answer set programming",
"logic gates",
"logic design",
"boolean functions",
"computer programming",
"artificial intelligence",
"machine learning",
"computer imaging and vision",
"knowledge representation",
"field programmable gate array",
"mathematics",
"computer science",
"knowledge based systems",
"semantics",
"computer hardware"
] |
487 | This paper announces the availability of a fixed point toolbox for the Matlab compatible software package Octave. This toolbox is released under the GNU Public License, and can be used to model the losses in algorithms implemented in hardware. Furthermore, this paper presents as an example of the use of this toolbox, the effects of a fixed point implementation on the precision of an OFDM modulator. | 2022-09-04T20:38:33.610Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0604039",
"ArXiv": "cs/0604039",
"MAG": "1574847285",
"CorpusId": "487",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/861cf8a9829b36c875606777d7c64202ddac2463 | A Fixed-Point Type for Octave | [
{
"authorId": "2060491936",
"name": "David Bateman"
},
{
"authorId": "9371557",
"name": "L. Mazet"
},
{
"authorId": "1403178916",
"name": "V. Buzenac-Settineri"
},
{
"authorId": "143910960",
"name": "M. Muck"
}
] | ArXiv | 2,006 | 10 | 0 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2006-04-10T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0604039",
"pages": null
} | [
"ofdm",
"computer hardware",
"software",
"matlab"
] | [
"matlab",
"software",
"computer hardware",
"ofdm",
"orthogonal frequency division multiplexing"
] | [
"orthogonal frequency division multiplexing",
"computer hardware",
"matlab",
"ofdm",
"software"
] | [
"wireless telecommunication systems",
"computer science",
"computer networks",
"communication systems",
"telecommunication systems",
"computer systems"
] |
488 | We argue that some of the computational complexity associated with estimation of stochastic attribute value grammars can be reduced by training upon an informative subset of the full training set. Results using the parsed Wall Street Journal corpus show that in some circumstances, it is possible to obtain better estimation results using an informative sample than when training upon all the available material. Further experimentation demonstrates that with unlexicalised models, a Gaussian prior can reduce overfitting. However, when models are lexicalised and contain overlapping features, overfitting does not seem to be a problem, and a Gaussian prior makes minimal difference to performance. Our approach is applicable for situations when there are an infeasibly large number of parses in the training set, or else for when recovery of these parses from a packed representation is itself computationally expensive. | 2022-09-04T21:08:15.175Z | {
"ACL": "C00-1085",
"DBLP": "conf/coling/Osborne00",
"ArXiv": "cs/0008024",
"MAG": "2952366359",
"CorpusId": "488",
"PubMed": null,
"DOI": "10.3115/990820.990905",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/827598a57a6f8ee03a7b3d993c50705b751e380e | Estimation of Stochastic Attribute-Value Grammars using an Informative Sample | [
{
"authorId": "2057788",
"name": "M. Osborne"
}
] | COLING | 2,000 | 25 | 50 | 0 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 2000-07-31T00:00:00 | {
"name": null,
"volume": null,
"pages": "586-592"
} | [
"training sample",
"stochastic",
"gaussians"
] | [
"estimation method",
"stochastic",
"gaussians",
"context-free",
"stochastic processes"
] | [
"estimation method",
"training sample",
"stochastic processes",
"stochastic",
"gaussians",
"context-free"
] | [
"numerical model",
"machine learning",
"probability",
"stochasticity",
"gaussian distribution",
"context free languages",
"mathematics",
"artificial intelligence",
"gaussian noise (electronic)",
"automata theory",
"formal languages",
"computer science",
"signal to noise ratio",
"formal languages and automata theory",
"linguistics",
"signal processing",
"theoretical computer science",
"engineering"
] |
490 | Resources in a cloud can be identified using identifiers based on random numbers. When using a distributed hash table to resolve such identifiers to network locations, the straightforward approach is to store the network location directly in the hash table entry associated with an identifier. When a mobile host contains a large number of resources, this requires that all of the associated hash table entries must be updated when its network address changes. We propose an alternative approach where we store a host identifier in the entry associated with a resource identifier and the actual network address of the host in a separate host entry. This can drastically reduce the time required for updating the distributed hash table when a mobile host changes its network address. We also investigate under which circumstances our approach should or should not be used. We evaluate and confirm the usefulness of our approach with experiments run on top of OpenDHT. | 2022-07-10T02:11:25.071Z | {
"ACL": null,
"DBLP": "journals/corr/abs-0706-0580",
"ArXiv": "0706.0580",
"MAG": "3106352025",
"CorpusId": "490",
"PubMed": null,
"DOI": "10.1109/ISPA.2010.73",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/45006542b5ebe43193d52ff2b81376a3d72e7a4e | Efficient Batch Update of Unique Identifiers in a Distributed Hash Table for Resources in a Mobile Host | [
{
"authorId": "3350794",
"name": "Y. Chung"
}
] | International Symposium on Parallel and Distributed Processing with Applications | 2,007 | 31 | 1 | 0 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Business",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-06-04T00:00:00 | {
"name": "International Symposium on Parallel and Distributed Processing with Applications",
"volume": null,
"pages": "625-630"
} | [
"hash",
"random numbers",
"distributed hash tables"
] | [
"hash",
"random numbers",
"hash value",
"network interface",
"hash functions"
] | [
"network interface",
"hash",
"hash value",
"distributed hash tables",
"random numbers",
"hash functions"
] | [
"noc",
"computer interfaces",
"overlay networks",
"random number generation",
"authentication",
"network security",
"routers",
"microprocessor chips",
"network architecture",
"human computer interaction",
"peer-to-peer",
"multicasts",
"number theory",
"random processes",
"cryptography",
"security of data",
"computer networks",
"telecommunication traffic",
"bandwidth",
"computer hardware",
"computer science",
"internet",
"distributed computer systems",
"wireless telecommunication systems",
"telecommunication networks",
"data communication systems",
"numerical methods",
"probability",
"cryptology",
"computer security",
"computer systems",
"communication systems",
"telecommunication systems",
"mathematics"
] |
492 | The classical alternating minimization (or projection) algorithm has been successful in the context of solving optimization problems over two variables. The iterative nature and simplicity of the algorithm has led to its application in many areas such as signal processing, information theory, control, and finance. A general set of sufficient conditions for the convergence and correctness of the algorithm are known when the underlying problem parameters are fixed. In many practical situations, however, the underlying problem parameters are changing over time, and the use of an adaptive algorithm is more appropriate. In this paper, we study such an adaptive version of the alternating minimization algorithm. More precisely, we consider the impact of having a slowly time-varying domain over which the minimization takes place. As a main result of this paper, we provide a general set of sufficient conditions for the convergence and correctness of the adaptive algorithm. Perhaps somewhat surprisingly, these conditions seem to be the minimal ones one would expect in such an adaptive setting. We present applications of our results to adaptive decomposition of mixtures, adaptive log-optimal portfolio selection, and adaptive filter design. | 2022-09-04T20:12:41.594Z | {
"ACL": null,
"DBLP": "journals/tit/NiesenSW09",
"ArXiv": "cs/0701043",
"MAG": "2025301163",
"CorpusId": "492",
"PubMed": null,
"DOI": "10.1109/TIT.2008.2011442",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/3a2c9780b5a952be83232add4a79175a4338e15d | Adaptive Alternating Minimization Algorithms | [
{
"authorId": "2486282",
"name": "Urs Niesen"
},
{
"authorId": "145081804",
"name": "D. Shah"
},
{
"authorId": "1779692",
"name": "G. Wornell"
}
] | IEEE Transactions on Information Theory | 2,007 | 28 | 95 | 3 | 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-08T00:00:00 | {
"name": "IEEE Transactions on Information Theory",
"volume": "55",
"pages": "1423-1429"
} | [
"portfolio selection",
"filter designs",
"sufficient conditions",
"adaptive algorithms",
"information theory",
"signal processing",
"adaptive filters",
"optimization problems"
] | [
"adaptive algorithms",
"optimization",
"optimization problems",
"signal processing",
"information theory",
"sufficient conditions",
"adaptive filters",
"portfolio selection",
"filter designs"
] | [
"portfolio selection",
"filter designs",
"optimization",
"sufficient conditions",
"adaptive algorithms",
"information theory",
"signal processing",
"adaptive filters",
"optimization problems"
] | [
"financial data processing",
"linear matrix inequalities",
"mathematics",
"software",
"communication",
"engineering",
"adaptive filtering",
"correlation analysis",
"investments",
"information technology",
"matrix algebra",
"computer science",
"economics"
] |
493 | The question how social norms can emerge from microscopic interactions between individuals is a key problem in social sciences to explain collective behavior. In this paper, we propose an agent-based model to show that randomly distributed social behavior by way of local interaction converges to a state with a multimodal distribution of behavior. This can be interpreted as a coexistence of different social norms, a result that goes beyond previous investigations. The model is discrete in time and space, behavior is characterized in a continuous state space. The adaptation of social behavior by each agent is based on attractive and repulsive forces caused by friendly and adversary relations among agents. The model is analyzed both analytically and by means of spatio-temporal computer simulations. It provides conditions under which we find convergence towards a single norm, coexistence of two opposing norms, and coexistence of a multitude of norms. For the latter case, we also show the evolution of the spatio-temporal distribution of behavior. | 2022-08-25T10:58:04.012Z | {
"ACL": null,
"DBLP": "journals/advcs/FentGS07",
"ArXiv": "0708.4155",
"MAG": "2167305353",
"CorpusId": "493",
"PubMed": null,
"DOI": "10.1142/S0219525907000970",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/1960483988ff9eedb8e7de08eb84ad4f22ea412b | Coexistence of Social Norms Based on in- and Out-Group Interactions | [
{
"authorId": "2991055",
"name": "T. Fent"
},
{
"authorId": "2461760",
"name": "Patrick Groeber"
},
{
"authorId": "1733303",
"name": "F. Schweitzer"
}
] | Adv. Complex Syst. | 2,007 | 35 | 17 | 0 | true | [
{
"category": "Economics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Physics",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-06-01T00:00:00 | {
"name": "Adv. Complex Syst.",
"volume": "10",
"pages": "271-286"
} | [
"agent based",
"social sciences",
"continuous state space"
] | [
"social sciences",
"continuous state",
"continuous state space",
"state space",
"intelligent agents",
"software agents",
"social relations",
"social relationships",
"social computing",
"social aspect",
"autonomous agents",
"potential field"
] | [
"social aspect",
"social sciences",
"social computing",
"state space",
"autonomous agents",
"continuous state",
"software agents",
"potential field",
"intelligent agents",
"agent based",
"social relationships",
"continuous state space",
"social relations"
] | [
"sociology",
"social networks",
"social media",
"ubiquitous computing",
"interactive computer systems",
"human engineering",
"online systems",
"state space methods",
"multiagent system",
"action spaces",
"robots",
"motion planning",
"reinforcement learning",
"world wide web",
"user interfaces",
"human computer interaction",
"computer systems",
"matrix algebra",
"artificial intelligence",
"robotics",
"mobile robots",
"machine learning",
"internet",
"computer science",
"mathematics"
] |
495 | This paper describes an approach to the design of a population of cooperative robots based on concepts borrowed from Systems Theory and Artificial Intelligence. The research has been developed under the SocRob project, carried out by the Intelligent Systems Laboratory at the Institute for Systems and Robotics - Instituto Superior Técnico (ISR/IST) in Lisbon. The acronym of the project stands both for “Society of Robots” and “Soccer Robots”, the case study where we are testing our population of robots. Designing soccer robots is a very challenging problem, where the robots must act not only to shoot a ball towards the goal, but also to detect and avoid static (walls, stopped robots) and dynamic (moving robots) obstacles. Furthermore, they must cooperate to defeat an opposing team. Our past and current research in soccer robotics includes cooperative sensor fusion for world modeling, object recognition and tracking, robot navigation, multi-robot distributed task planning and coordination, including cooperative reinforcement learning in cooperative and adversarial environments, and behavior-based architectures for real time task execution of cooperating robot teams. | 2022-09-03T07:45:20.981Z | {
"ACL": null,
"DBLP": "journals/corr/cs-RO-0411018",
"ArXiv": "cs/0411018",
"MAG": "2950006166",
"CorpusId": "495",
"PubMed": null,
"DOI": "10.5772/5630",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/27d406d606cf2814dd2e3c1d4a4dcefcfd50b20a | Artificial Intelligence and Systems Theory: Applied to Cooperative Robots | [
{
"authorId": "1883749",
"name": "P. Lima"
},
{
"authorId": "21646240",
"name": "L. Custódio"
}
] | ArXiv | 2,004 | 23 | 38 | 0 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2004-09-01T00:00:00 | {
"name": "International Journal of Advanced Robotic Systems",
"volume": "1",
"pages": null
} | [
"system theory",
"robot navigation",
"multi-robot",
"robots",
"reinforcement learning",
"sensor fusion",
"artificial intelligence",
"soccer robot",
"robot teams",
"intelligent systems",
"robotics",
"task planning",
"object recognition"
] | [
"artificial intelligence",
"intelligent systems",
"robots",
"mobile robots",
"robotics",
"soccer robot",
"sensors",
"sensor fusion",
"object recognition",
"robot navigation",
"task planning",
"reinforcement learning",
"robot teams",
"autonomous robot",
"robot system",
"humanoid robot",
"robotic systems",
"autonomous mobile robot",
"multiple robot",
"single robots",
"expert systems",
"multi-robot",
"non-cooperative",
"architecture designs",
"data fusion"
] | [
"robot navigation",
"soccer robot",
"single robots",
"object recognition",
"autonomous robot",
"non-cooperative",
"system theory",
"robots",
"sensors",
"architecture designs",
"humanoid robot",
"intelligent systems",
"autonomous mobile robot",
"robotics",
"task planning",
"expert systems",
"artificial intelligence",
"robot teams",
"robot system",
"robotic systems",
"data fusion",
"multi-robot",
"sensor fusion",
"multiple robot",
"reinforcement learning",
"mobile robots"
] | [
"motion control",
"navigation systems",
"computer vision",
"robot applications",
"multi-robot systems",
"pattern recognition",
"image segmentation",
"nash equilibrium",
"computer hardware",
"software architecture",
"intelligent robots",
"computer systems",
"motion planning",
"computer science",
"robot programming",
"multipurpose robots",
"sensor data fusion",
"machine learning",
"computer imaging and vision",
"image analysis",
"image processing",
"game theory",
"software design",
"robotic manipulators",
"robot learning",
"industrial robots",
"signal processing",
"software engineering",
"engineering"
] |
497 | We present, in a unifying way, the main components of three asynchronous event-driven algorithms for simulating physical systems of interacting particles. The first example, hard-particle molecular dynamics, is well known. We also present a recently developed diffusion kinetic Monte Carlo algorithm, as well as a novel stochastic molecular-dynamics algorithm that builds on the Direct Simulation Monte Carlo. We explain how to effectively combine asynchronous event-driven with classical time-driven or with synchronous event-driven handling. Finally, we discuss some promises and challenges for event-driven simulation of realistic physical systems. | 2022-09-04T05:48:38.162Z | {
"ACL": null,
"DBLP": "journals/simulation/Donev09",
"ArXiv": "cs/0703096",
"MAG": "2169750419",
"CorpusId": "497",
"PubMed": null,
"DOI": "10.1109/PADS.2007.15",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/c66533abffe7ffc29e1288d92e4d02bd796f75d8 | Asynchronous Event-Driven Particle Algorithms | [
{
"authorId": "2420467",
"name": "A. Donev"
}
] | 21st International Workshop on Principles of Advanced and Distributed Simulation (PADS'07) | 2,007 | 54 | 21 | 1 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Physics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-03-20T00:00:00 | {
"name": "SIMULATION",
"volume": "85",
"pages": "229 - 242"
} | [
"stochastic"
] | [
"asynchronous system",
"stochastic",
"adaptive algorithms",
"efficient algorithm",
"optimization problems"
] | [
"stochastic",
"efficient algorithm",
"adaptive algorithms",
"asynchronous system",
"optimization problems"
] | [
"stochastic processes",
"stochasticity",
"computational efficiency",
"software",
"fault tolerant computer systems",
"correlation analysis",
"probability",
"numerical model",
"theoretical computer science",
"computer science",
"computer networks",
"distributed computer systems",
"mathematics",
"computer systems"
] |
498 | Excellent results have been reported for Data-Oriented Parsing (DOP) of natural language texts (Bod, 1993). Unfortunately, existing algorithms are both computationally intensive and difficult to implement. Previous algorithms are expensive due to two factors: the exponential number of rules that must be generated and the use of a Monte Carlo parsing algorithm. In this paper we solve the first problem by a novel reduction of the DOP model to a small, equivalent probabilistic context-free grammar. We solve the second problem by a novel deterministic parsing strategy that maximizes the expected number of correct constituents, rather than the probability of a correct parse tree. Using the optimizations, experiments yield a 97% crossing brackets rate and 88% zero crossing brackets rate. This differs significantly from the results reported by Bod, and is comparable to results from a duplication of Pereira and Schabes's (1992) experiment on the same data. We show that Bod's results are at least partially due to an extremely fortuitous choice of test data, and partially due to using cleaner data than other researchers. | 2022-09-05T00:45:01.471Z | {
"ACL": "W96-0214",
"DBLP": "journals/corr/cmp-lg-9604008",
"ArXiv": "cmp-lg/9604008",
"MAG": "2952110792",
"CorpusId": "498",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/155a2680a1a7fe495d0ab47224fcdbbfb3d1caaa | Efficient Algorithms for Parsing the DOP Model | [
{
"authorId": "17446277",
"name": "J. Goodman"
}
] | EMNLP | 1,996 | 23 | 89 | 18 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 1996-04-01T00:00:00 | {
"name": "ArXiv",
"volume": "cmp-lg/9604008",
"pages": null
} | [
"natural language text",
"parsing algorithm",
"deterministic",
"probability",
"optimization",
"parse trees",
"efficient algorithm",
"context-free"
] | [
"efficient algorithm",
"parsing algorithm",
"natural languages",
"natural language text",
"deterministic",
"probability",
"parse trees",
"optimization"
] | [
"natural language text",
"parsing algorithm",
"natural languages",
"deterministic",
"probability",
"optimization",
"parse trees",
"efficient algorithm",
"context-free"
] | [
"natural language processing",
"computational linguistics",
"formal languages",
"linguistics",
"semantics",
"stochastic",
"mathematics",
"translation (languages)",
"syntactics",
"computational efficiency",
"context free languages",
"artificial intelligence",
"database systems",
"formal languages and automata theory",
"stochastic processes",
"stochasticity",
"automata theory",
"theoretical computer science",
"computer science",
"computer systems",
"numerical model"
] |
499 | We call a CNF formula linear if any two clauses have at most one variable in common. Let Linear k-SAT be the problem of deciding whether a given linear k-CNF formula is satisfiable. Here, a k-CNF formula is a CNF formula in which every clause has size exactly k. It was known that for k >= 3, Linear k-SAT is NP-complete if and only if an unsatisfiable linear k-CNF formula exists, and that they do exist for k >= 4. We prove that unsatisfiable linear k-CNF formulas exist for every k. Let f(k) be the minimum number of clauses in an unsatisfiable linear k-CNF formula. We show that f(k) is Omega(k2^k) and O(4^k*k^4), i.e., minimum size unsatisfiable linear k-CNF formulas are significantly larger than minimum size unsatisfiable k-CNF formulas. Finally, we prove that, surprisingly, linear k-CNF formulas do not allow for a larger fraction of clauses to be satisfied than general k-CNF formulas. | 2022-09-02T05:44:29.109Z | {
"ACL": null,
"DBLP": "journals/corr/abs-0708-2336",
"ArXiv": "0708.2336",
"MAG": "1633286018",
"CorpusId": "499",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/0ccc72af31832ec1c9627806cec773ca0ecce3f7 | Unsatisfiable Linear k-CNFs Exist, for every k | [
{
"authorId": "1794842",
"name": "Dominik Scheder"
}
] | ArXiv | 2,007 | 8 | 7 | 0 | false | [
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-08-17T00:00:00 | {
"name": "ArXiv",
"volume": "abs/0708.2336",
"pages": null
} | [
"cnf formulas"
] | [
"cnf formulas",
"propositional formulas",
"sat",
"boolean formulae",
"sat solvers"
] | [
"propositional formulas",
"sat",
"boolean formulae",
"sat solvers",
"cnf formulas"
] | [
"propositional logic",
"boolean functions",
"model checking",
"boolean algebra",
"decision theory",
"satisfiability",
"logic programming",
"mathematics",
"embedded systems",
"architecture verification and validation",
"formal logic",
"matrix algebra",
"artificial intelligence",
"computer programming languages",
"computer systems",
"architecting",
"computer science",
"computer programming",
"software architecture",
"software design",
"software engineering"
] |
501 | During the last decade there has been a huge interest in Grid technologies, and numerous Grid projects have been initiated with various visions of the Grid. While all these visions have the same goal of resource sharing, they differ in the functionality that a Grid supports, characterization, programming environments, etc. We present a new Grid system dedicated to dealing with data issues, called DGET (Data Grid Environment and Tools). DGET is characterized by its peerto- peer communication system and entity-based architecture, therefore, taking advantage of the main functionality of both systems; P2P and Grid. DGET is currently under development and a prototype implementing the main components is in its first phase of testing. In this paper we limit our description to the system architectural features and to the main differences with other systems. Keywords: Grid Computing, Peer to Peer, Peer to Peer Grid | 2022-09-03T10:50:32.945Z | {
"ACL": null,
"DBLP": "conf/pdpta/HudziaEMK06",
"ArXiv": "cs/0608113",
"MAG": "1524641679",
"CorpusId": "501",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/5f6ce8c03492d9233c970f6ba281c8b5b379e234 | A Java Based Architecture of P2P-Grid Middleware | [
{
"authorId": "2393476",
"name": "B. Hudzia"
},
{
"authorId": "8643906",
"name": "T. Ellahi"
},
{
"authorId": "40140069",
"name": "L. McDermott"
},
{
"authorId": "144549246",
"name": "M. Kechadi"
}
] | PDPTA | 2,006 | 19 | 7 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2006-08-29T00:00:00 | {
"name": null,
"volume": null,
"pages": "113-119"
} | [
"data grid",
"peer-to-peer",
"grid technologies",
"grid environments",
"grid systems",
"grid computing",
"communication systems",
"resource sharing",
"java"
] | [
"java",
"peer-to-peer",
"grid node",
"grid environments",
"grid middleware",
"grid technologies",
"grid computing",
"resource sharing",
"data grid",
"communication",
"computational grids",
"grid systems"
] | [
"data grid",
"grid middleware",
"peer-to-peer",
"grid technologies",
"grid environments",
"grid node",
"grid systems",
"computational grids",
"communication",
"grid computing",
"communication systems",
"resource sharing",
"java"
] | [
"distributed computer systems",
"internet",
"computer networks",
"parallel processing systems",
"computer systems",
"object oriented programming",
"computer programming languages",
"high level languages",
"computer science",
"distributed systems",
"computer programming"
] |
503 | We present a new method for segmenting, and a new user interface for indexing and visualizing, the semantic content of extended instructional videos. Using various visual filters, key frames are first assigned a media type (board, class, computer, illustration, podium, and sheet). Key frames of media type board and sheet are then clustered based on contents via an algorithm with near-linear cost. A novel user interface, the result of two user studies, displays related topics using icons linked topologically, allowing users to quickly locate semantically related portions of the video. We analyze the accuracy of the segmentation tool on 17 instructional videos, each of which is from 75 to 150 minutes in duration (a total of 40 hours); it exceeds 96%. | 2022-09-02T03:36:24.042Z | {
"ACL": null,
"DBLP": "journals/corr/cs-IR-0302024",
"ArXiv": "cs/0302024",
"MAG": "2950100881",
"CorpusId": "503",
"PubMed": null,
"DOI": "10.1109/ICME.2003.1221714",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/ab5ed72fadf447ce794c9bb642289f3927db0f79 | Analysis and interface for instructional video | [
{
"authorId": "1718576",
"name": "A. Haubold"
},
{
"authorId": "1719062",
"name": "J. Kender"
}
] | 2003 International Conference on Multimedia and Expo. ICME '03. Proceedings (Cat. No.03TH8698) | 2,003 | 11 | 18 | 2 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 2003-02-16T00:00:00 | {
"name": "2003 International Conference on Multimedia and Expo. ICME '03. Proceedings (Cat. No.03TH8698)",
"volume": "2",
"pages": "II-705"
} | [
"user interfaces",
"key frames",
"semantics"
] | [
"user interfaces",
"semantics",
"multimedia contents",
"key frames",
"frames",
"video streams",
"digital videos",
"video contents"
] | [
"digital videos",
"user interfaces",
"frames",
"multimedia contents",
"semantics",
"key frames",
"video streams",
"video contents"
] | [
"video processing",
"multimedia systems",
"human computer interaction",
"structural frames",
"multimedia services",
"visual communication",
"video streaming",
"computer imaging and vision",
"internet",
"computer science",
"hidden markov models",
"markov random fields",
"hidden markov model (hmm)",
"internet protocols",
"image coding",
"markov processes",
"image segmentation",
"telecommunication traffic",
"image processing",
"correlation analysis",
"image analysis",
"telecommunication networks",
"mathematics",
"telecommunication systems",
"computer systems"
] |
505 | We introduce a memory-based approach to part of speech tagging. Memory-based learning is a form of supervised learning based on similarity-based reasoning. The part of speech tag of a word in a particular context is extrapolated from the most similar cases held in memory. Supervised learning approaches are useful when a tagged corpus is available as an example of the desired output of the tagger. Based on such a corpus, the tagger-generator automatically builds a tagger which is able to tag new text the same way, diminishing development time for the construction of a tagger considerably. Memory-based tagging shares this advantage with other statistical or machine learning approaches. Additional advantages specific to a memory-based approach include (i) the relatively small tagged corpus size sufficient for training, (ii) incremental learning, (iii) explanation capabilities, (iv) flexible integration of information in case representations, (v) its non-parametric nature, (vi) reasonably good results on unknown words without morphological analysis, and (vii) fast learning and tagging. In this paper we show that a large-scale application of the memory-based approach is feasible: we obtain a tagging accuracy that is on a par with that of known statistical approaches, and with attractive space and time complexity properties when using IGTree, a tree-based formalism for indexing and searching huge case bases. The use of IGTree has as additional advantage that optimal context size for disambiguation is dynamically computed. 1 I n t r o d u c t i o n Part of Speech (POS) tagging is a process in which syntactic categories are assigned to words. It can be seen as a mapping from sentences to strings of tags. Automatic tagging is useful for a number of applications: as a preprocessing stage to parsing, in information retrieval, in text to speech systems, in corpus linguistics, etc. The two factors determining the syntactic category of a word are its lexical probability (e.g. without context, man is more probably a noun than a verb), and its contextual probability (e.g. after a pronoun, man is more probably a verb than a noun, as in they man the boats). Several approaches have been proposed to construct automatic taggers. Most work on statistical methods has used n-gram models or Hidden Markov Model-based taggers (e.g. Church, 1988; DeRose, 1988; Cutting et al. 1992; Merialdo, 1994, etc.). In | 2022-09-04T20:38:58.501Z | {
"ACL": "W96-0102",
"DBLP": "conf/acl-vlc/DaelemansZBG96",
"ArXiv": "cmp-lg/9607012",
"MAG": "1551773846",
"CorpusId": "505",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/6082156a2270b6567ebdc85f6570ffacc3d903c2 | MBT: A Memory-Based Part of Speech Tagger-Generator | [
{
"authorId": "1735272",
"name": "Walter Daelemans"
},
{
"authorId": "3316623",
"name": "Jakub Zavrel"
},
{
"authorId": "2561559",
"name": "P. Berck"
},
{
"authorId": "47567800",
"name": "S. Gillis"
}
] | VLC@COLING | 1,996 | 53 | 426 | 29 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 1996-07-01T00:00:00 | {
"name": "ArXiv",
"volume": "cmp-lg/9607012",
"pages": null
} | [
"reasoning",
"parsing algorithm",
"statistical methods",
"machine learning",
"linguistics",
"case base",
"probability",
"n-gram language models",
"similar case",
"case representation",
"syntactics",
"information retrieval"
] | [
"speech signals",
"reasoning",
"similar case",
"case base",
"machine learning",
"case representation",
"statistical methods",
"syntactics",
"parsing algorithm",
"information retrieval",
"linguistics",
"probability",
"hidden markov models",
"hidden markov model (hmm)",
"markov model"
] | [
"reasoning",
"hidden markov models",
"parsing algorithm",
"statistical methods",
"machine learning",
"linguistics",
"case base",
"probability",
"speech signals",
"n-gram language models",
"similar case",
"case representation",
"syntactics",
"hidden markov model (hmm)",
"information retrieval",
"markov model"
] | [
"ontology",
"formal languages",
"markov processes",
"natural language processing",
"computational linguistics",
"correlation analysis",
"artificial intelligence",
"case based reasoning",
"mathematics",
"speech communication",
"language model",
"cbr",
"computer science",
"semantics",
"formal languages and automata theory",
"natural languages",
"database systems",
"knowledge based systems",
"theoretical computer science",
"computer systems"
] |
506 | The distribution of files using decentralized, peer-to-peer (P2P) systems, has significant advantages over centralized approaches. It is however more difficult to settle on the best approach for file sharing. Most file sharing systems are based on query string searches, leading to a relatively simple but inefficient broadcast or to an efficient but relatively complicated index in a structured environment. In this paper we use a browsable peer-to-peer file index consisting of files which serve as directory nodes, interconnecting to form a directory network. We implemented the system based on BitTorrent and Kademlia. The directory network inherits all of the advantages of decentralization and provides browsable, efficient searching. To avoid conflict between users in the P2P system while also imposing no additional restrictions, we allow multiple versions of each directory node to simultaneously exist -- using popularity as the basis for default browsing behavior. Users can freely add files and directory nodes to the network. We show, using a simulation of user behavior and file quality, that the popularity based system consistently leads users to a high quality directory network; above the average quality of user updates. Q | 2022-06-20T16:22:39.538Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0701190",
"ArXiv": "cs/0701190",
"MAG": "1614193546",
"CorpusId": "506",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/86359bd3e46bfa8a7b69f349edfff3bb52ac53b5 | A Peer-to-Peer Browsable File Index using a Popularity Based Global Namespace | [
{
"authorId": "143975765",
"name": "T. Jacobs"
},
{
"authorId": "145098019",
"name": "A. Harwood"
}
] | ArXiv | 2,007 | 32 | 0 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-01-29T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0701190",
"pages": null
} | [
"broadcast",
"file sharing",
"peer-to-peer",
"bittorrent",
"kademlia"
] | [
"peer-to-peer",
"file sharing",
"broadcast",
"bittorrent",
"kademlia"
] | [
"broadcast",
"file sharing",
"peer-to-peer",
"bittorrent",
"kademlia"
] | [
"ad hoc networks",
"broadcasting",
"distributed computer systems",
"internet",
"computer networks",
"distributed hash tables",
"routers",
"mobile telecommunication systems",
"internet protocols",
"quality of service",
"wireless local area networks (wlan)",
"multicasts",
"routing algorithms",
"sensors",
"communication channels",
"computer systems",
"computer science",
"overlay networks",
"telecommunication traffic",
"bandwidth",
"telecommunication networks",
"local area networks",
"wireless telecommunication systems",
"data communication systems",
"computer hardware",
"telecommunication systems",
"communication systems"
] |
507 | Predicate abstraction provides a powerful tool for verifying properties of infinite-state systems using a combination of a decision procedure for a subset of first-order logic and symbolic methods originally developed for finite-state model checking. We consider models containing first-order state variables, where the system state includes mutable functions and predicates. Such a model can describe systems containing arbitrarily large memories, buffers, and arrays of identical processes. We describe a form of predicate abstraction that constructs a formula over a set of universally quantified variables to describe invariant properties of the first-order state variables. We provide a formal justification of the soundness of our approach and describe how it has been used to verify several hardware and software designs, including a directory-based cache coherence protocol. | 2022-09-02T05:18:25.208Z | {
"ACL": null,
"DBLP": "journals/tocl/LahiriB07",
"ArXiv": "cs/0407006",
"MAG": "2951800949",
"CorpusId": "507",
"PubMed": null,
"DOI": "10.1145/1297658.1297662",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/3718386e170a8f2190ce68d5840dfd2161049b0a | Predicate abstraction with indexed predicates | [
{
"authorId": "145474353",
"name": "Shuvendu K. Lahiri"
},
{
"authorId": "34673652",
"name": "R. Bryant"
}
] | TOCL | 2,004 | 67 | 51 | 4 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2004-07-01T00:00:00 | {
"name": "ArXiv",
"volume": "cs.LO/0407006",
"pages": null
} | [
"cache coherence protocols",
"computer hardware",
"infinite state systems",
"model checking",
"decision procedure",
"software design",
"first order logic"
] | [
"model checking",
"infinite state systems",
"decision procedure",
"first order logic",
"computer hardware",
"software",
"software design",
"cache",
"cache coherence",
"coherence protocol",
"cache coherence protocols",
"software model checking",
"bounded model checking"
] | [
"bounded model checking",
"cache coherence protocols",
"cache",
"computer hardware",
"infinite state systems",
"model checking",
"coherence protocol",
"decision procedure",
"software design",
"cache coherence",
"first order logic",
"software model checking",
"software"
] | [
"operating systems",
"buffer storage",
"cache memory",
"storage allocation (computer)",
"computer science",
"embedded systems",
"architecture verification and validation",
"chip multiprocessor",
"shared memories",
"decision theory",
"computability and decidability",
"satisfiability",
"software engineering",
"multiprocessing systems",
"formal logic",
"telecommunication traffic",
"bandwidth",
"data communication systems",
"parallel processing systems",
"microprocessor chips",
"computer systems",
"architecting",
"program processors",
"parallel architectures",
"artificial intelligence",
"automata theory",
"formal languages",
"graph theory",
"telecommunication networks",
"computer networks",
"distributed systems",
"software architecture",
"formal languages and automata theory",
"linguistics",
"theoretical computer science",
"telecommunication systems",
"distributed computer systems"
] |
510 | Previous approaches of analyzing spontaneously spoken language often have been based on encoding syntactic and semantic knowledge manually and symbolically. While there has been some progress using statistical or connectionist language models, many current spoken-language systems still use a relatively brittle, hand-coded symbolic grammar or symbolic semantic component.
In contrast, we describe a so-called screening approach for learning robust processing of spontaneously spoken language. A screening approach is a flat analysis which uses shallow sequences of category representations for analyzing an utterance at various syntactic, semantic and dialog levels. Rather than using a deeply structured symbolic analysis, we use a flat connectionist analysis. This screening approach aims at supporting speech and language processing by using (1) data-driven learning and (2) robustness of connectionist networks. In order to test this approach, we have developed the screen system which is based on this new robust, learned and flat analysis.
In this paper, we focus on a detailed description of screen's architecture, the flat syntactic and semantic analysis, the interaction with a speech recognizer, and a detailed evaluation analysis of the robustness under the influence of noisy or incomplete input. The main result of this paper is that flat representations allow more robust processing of spontaneous spoken language than deeply structured representations. In particular, we show how the fault-tolerance and learning capability of connectionist networks can support a flat analysis for providing more robust spoken-language processing within an overall hybrid symbolic/connectionist framework. | 2022-09-05T03:02:22.528Z | {
"ACL": null,
"DBLP": "journals/jair/WermterW97",
"ArXiv": "cs/9701102",
"MAG": "1662350148",
"CorpusId": "510",
"PubMed": null,
"DOI": "10.1613/jair.282",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/30ed0a5b5503f0c7c693e07b159f5c04a8e33872 | SCREEN: Learning a Flat Syntactic and Semantic Spoken Language Analysis Using Artificial Neural Networks | [
{
"authorId": "1736513",
"name": "S. Wermter"
},
{
"authorId": "145231370",
"name": "V. Weber"
}
] | J. Artif. Intell. Res. | 1,996 | 93 | 40 | 0 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 1996-12-31T00:00:00 | {
"name": "J. Artif. Intell. Res.",
"volume": "6",
"pages": "35-85"
} | [
"semantic information",
"spoken language processing",
"syntactics",
"speech recognition systems",
"semantics",
"fault tolerance",
"language model",
"neural networks"
] | [
"syntactic structure",
"syntactics",
"semantics",
"semantic information",
"neural networks",
"language model",
"speech recognition systems",
"fault tolerance",
"network architecture",
"robust performance",
"spoken language processing",
"correlation analysis"
] | [
"semantic information",
"spoken language processing",
"network architecture",
"correlation analysis",
"syntactic structure",
"robust performance",
"syntactics",
"speech recognition systems",
"semantics",
"fault tolerance",
"language model",
"neural networks"
] | [
"natural language processing",
"computer networks",
"mathematics",
"robust control",
"computational linguistics",
"speech communication",
"software quality",
"fault tolerant computer systems",
"machine learning",
"artificial intelligence",
"natural languages",
"computer science",
"adaptive control systems",
"linear matrix inequalities",
"database systems",
"linguistics",
"software design",
"distributed computer systems",
"process control",
"matrix algebra",
"computer systems",
"software engineering",
"automation",
"engineering"
] |
511 | This paper uses the software program Linux and the discourse around it in order to examine how software programs can be used to articulate and defend social and economic positions. Although I do not use the term "expression" in a strict legal sense, I claim that in order to make policy decisions involving software, it is important to understand how the functionality of software is expressive. Another way to state this is that software programs like Linux are socially meaningful through functionality and talk about functionality.
In section I, I review some recent legal scholarship about software and explain why understanding how embedded technical expression works is important given the increasingly large role of software in governance. In section II, I explore software construction as a combination of social and technical practices. In section III, I describe some examples of meaning-making around the software program Linux. In section IV I conclude with a short description of why such analyses are important. | 2022-06-21T11:59:26.772Z | {
"ACL": null,
"DBLP": "journals/corr/cs-CY-0109103",
"ArXiv": "cs/0109103",
"MAG": "2136052029",
"CorpusId": "511",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/6b3d5cf18020885f66c260162d0b53b7ab2d2c77 | Leveraging Software, Advocating Ideology: Free Software and Open Source | [
{
"authorId": "48923937",
"name": "M. Ratto"
}
] | ArXiv | 2,001 | 0 | 1 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Review"
] | 2001-09-24T00:00:00 | {
"name": "ArXiv",
"volume": "cs.CY/0109103",
"pages": null
} | [
"economics",
"linux",
"software"
] | [
"software",
"linux",
"economics",
"software component",
"software project"
] | [
"software component",
"software project",
"software",
"economics",
"linux"
] | [
"software design",
"computer science",
"operating systems",
"software engineering"
] |
513 | Cooperative optimization is a new way for finding global optima of complicated functions of many variables. It has some important properties not possessed by any conventional optimization methods. It has been successfully applied in solving many large scale optimization problems in image processing, computer vision, and computational chemistry. This paper shows the application of this optimization principle in decoding LDPC codes, which is another hard combinatorial optimization problem. The cooperative optimization algorithm is much simpler in computation than the classical sum-product algorithm. Compared to the sum-product algorithm, our algorithm lowered the error floor more than one order of magnitude in decoding an experimental LDPC code for China's HDTV | 2022-08-30T14:25:32.976Z | {
"ACL": null,
"DBLP": "conf/isit/Huang05",
"ArXiv": "cs/0504021",
"MAG": "2038112230",
"CorpusId": "513",
"PubMed": null,
"DOI": "10.1109/ISIT.2005.1523343",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/afc21372f600a0c8add8c20940aaeafb72767959 | Near perfect decoding of LDPC codes | [
{
"authorId": "2107902836",
"name": "Xiaofei Huang"
}
] | Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. | 2,005 | 20 | 10 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2005-04-06T00:00:00 | {
"name": "Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.",
"volume": null,
"pages": "302-306"
} | [
"error floor",
"optimization",
"hdtv",
"sum-product algorithm",
"ldpc codes",
"computer vision",
"combinatorial optimization",
"image processing",
"optimization problems"
] | [
"ldpc codes",
"optimization problems",
"optimization",
"combinatorial optimization",
"image processing",
"computer vision",
"error floor",
"hdtv"
] | [
"optimization",
"hdtv",
"sum-product algorithm",
"ldpc codes",
"image processing",
"computer vision",
"combinatorial optimization",
"error floor",
"optimization problems"
] | [
"mathematics",
"high definition television",
"signal encoding",
"low-density parity-check codes",
"computer imaging and vision",
"coding errors",
"correlation analysis",
"video processing",
"digital television",
"communication channels",
"signal to noise ratio",
"iterative decoding",
"channel capacity",
"graph theory",
"matrix algebra",
"computer science",
"image compression",
"bit error rate",
"signal processing",
"wireless telecommunication systems",
"information theory",
"theoretical computer science",
"image quality",
"image coding",
"probability",
"engineering",
"computer networks",
"communication systems",
"telecommunication systems",
"communication",
"image analysis",
"computer systems"
] |
514 | This paper introduces a new combinatorial construction for q-ary constant-weight codes which yields several families of optimal codes and asymptotically optimal codes. The construction reveals intimate connection between q-ary constant-weight codes and sets of pairwise disjoint combinatorial designs of various types | 2022-09-03T05:20:04.813Z | {
"ACL": null,
"DBLP": "journals/tit/CheeL07",
"ArXiv": "0705.0081",
"MAG": "2152919403",
"CorpusId": "514",
"PubMed": null,
"DOI": "10.1109/TIT.2006.887499",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/99907857afc35feae4586006965881a8c3f81054 | Constructions for $q$-Ary Constant-Weight Codes | [
{
"authorId": "1718686",
"name": "Y. Chee"
},
{
"authorId": "143630342",
"name": "S. Ling"
}
] | IEEE Transactions on Information Theory | 2,007 | 47 | 53 | 4 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-05-01T00:00:00 | {
"name": "IEEE Transactions on Information Theory",
"volume": "53",
"pages": "135-146"
} | [] | [
"block codes",
"combinatorial problems",
"mutual informations",
"cad tool"
] | [
"cad tool",
"combinatorial problems",
"block codes",
"mutual informations"
] | [
"computer aided design",
"combinatorial mathematics",
"bit error rate",
"information theory",
"computer science",
"graph theory",
"communication channels",
"signal to noise ratio",
"probability",
"communication",
"theoretical computer science",
"wireless telecommunication systems",
"signal processing",
"mathematics",
"computer networks",
"communication systems",
"telecommunication systems",
"engineering",
"computer systems"
] |
517 | Many functional logic languages are based on narrowing, a unification-based goal-solving mechanism which subsumes the reduction mechanism of functional languages and the resolution principle of logic languages. Needed narrowing is an optimal evaluation strategy which constitutes the basis of modern (narrowing-based) lazy functional logic languages. In this work, we present the fundamentals of partial evaluation in such languages. We provide correctness results for partial evaluation based on needed narrowing and show that the nice properties of this strategy are essential for the specialization process. In particular, the structure of the original program is preserved by partial evaluation and, thus, the same evaluation strategy can be applied for the execution of specialized programs. This is in contrast to other partial evaluation schemes for lazy functional logic programs which may change the program structure in a negative way. Recent proposals for the partial evaluation of declarative multi-paradigm programs use (some form of) needed narrowing to perform computations at partial evaluation time. Therefore, our results constitute the basis for the correctness of such partial evaluators. | 2022-09-02T03:16:47.385Z | {
"ACL": null,
"DBLP": "journals/corr/cs-PL-0403011",
"ArXiv": "cs/0403011",
"MAG": "1500364302",
"CorpusId": "517",
"PubMed": null,
"DOI": "10.1017/S1471068404002303",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/ebe38b20a610ee13e6636761d93f77c87c6c5676 | Specialization of functional logic programs based on needed narrowing | [
{
"authorId": "145230294",
"name": "M. Alpuente"
},
{
"authorId": "1765031",
"name": "M. Hanus"
},
{
"authorId": "2056629573",
"name": "S. Lucas"
},
{
"authorId": "144050626",
"name": "G. Vidal"
}
] | Theory and Practice of Logic Programming | 2,004 | 102 | 39 | 1 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2004-03-09T00:00:00 | {
"name": "Theory and Practice of Logic Programming",
"volume": "5",
"pages": "273 - 303"
} | [
"logic programs",
"functional languages",
"partial evaluation"
] | [
"logic programs",
"functional languages",
"partial evaluation",
"formal proofs",
"functional programs",
"dynamic logic",
"multivalued logic",
"programming languages"
] | [
"functional programs",
"logic programs",
"programming languages",
"formal proofs",
"functional languages",
"partial evaluation",
"dynamic logic",
"multivalued logic"
] | [
"functional programming",
"logic programming",
"computer programming languages",
"linguistics",
"formal verifications",
"formal logic",
"program compilers",
"program interpreters",
"modal logic",
"many valued logics",
"computer programming",
"verification",
"artificial intelligence",
"parallel processing systems",
"object oriented programming",
"logic gates",
"logic design",
"boolean functions",
"computer science",
"verification and validation",
"distributed systems",
"field programmable gate array",
"mathematics",
"software quality",
"distributed computer systems",
"computer hardware",
"software design",
"computer systems",
"software engineering"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.