jpwahle/dblp-discovery-dataset · Datasets at Hugging Face

708

There is a trend toward the use of predictive systems in communications networks. At the systems and network management level predictive capabilities are focused on anticipating network faults and performance degradation. Simultaneously, mobile communication networks are being developed with predictive location and tracking mechanisms. The interactions and synergies between these systems present a new set of problems. A new predictive network management framework is developed and examined. The interaction between a predictive mobile network and the proposed network management system is discussed. The Rapidly Deployable Radio Network is used as a specific exampl e to illustrate these interactions. 1

2022-09-02T09:27:40.447Z

{ "ACL": null, "DBLP": "journals/corr/cs-NI-9904013", "ArXiv": "cs/9904013", "MAG": "1534617295", "CorpusId": "708", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/903edc6a3d2f74deeee21183cbc7292f5dd10b62

Network Management of Predictive Mobile Networks

[ { "authorId": "2193825", "name": "S. Bush" }, { "authorId": "1755417", "name": "V. Frost" }, { "authorId": "1764435", "name": "Joseph B. Evans" } ]

ArXiv

1,999

47

7

0

false

[ { "category": "Business", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

1999-04-21T00:00:00

{ "name": "ArXiv", "volume": "cs.NI/9904013", "pages": null }

[ "mobile communications", "mobile networks", "network management", "communication networks", "radio networks", "network management systems" ]

[ "network architecture", "network management", "network management systems", "mobile networks", "communication networks", "communication", "mobile communications", "radio", "wireless communications", "radio communication", "mobile terminal", "snmp", "service management", "cellular network", "wireless networks" ]

[ "mobile communications", "service management", "mobile networks", "network architecture", "wireless communications", "radio communication", "network management", "communication networks", "mobile terminal", "cellular network", "communication", "wireless networks", "radio networks", "radio", "network management systems", "snmp" ]

[ "mobile telecommunication systems", "quality of service", "telecommunication services", "information technology", "computer networks", "communication channels", "telecommunication networks", "mobile phones", "wireless telecommunication systems", "packet networks", "ad hoc networks", "broadcasting", "radio broadcasting", "telecommunication traffic", "bandwidth", "data communication systems", "computer science", "telecommunication systems", "computer hardware", "communication systems", "routers", "internet protocols", "wireless local area networks (wlan)", "multicasts", "routing algorithms", "sensors", "computer systems", "local area networks" ]

709

ADOMIT is an algorithm for Automatic Detection of OMIssions in Translations. The algorithm relics solely on geometric analysis of bitext maps and uses no linguistic information. This property allows it to deal equally well with omissions that do not correspond to linguistic units, such as might result from word-processing mishaps. ADOMIT has proven itself by discovering many errors in a hand-constructed gold standard for evaluating bitext mapping algorithms. Quantitative evaluation on simulated omissions showed that, even with today's poor bitext mapping technology, ADOMIT is a valuable quality control tool for translators and translation bureaus.

2022-09-02T15:39:07.278Z

{ "ACL": "C96-2129", "DBLP": "journals/corr/cmp-lg-9609010", "ArXiv": "cmp-lg/9609010", "MAG": "2088791674", "CorpusId": "709", "PubMed": null, "DOI": "10.3115/993268.993301", "PubMedCentral": null }

https://www.semanticscholar.org/paper/1476a9580e4e5ba21561b1bb69000746212cb2de

Automatic Detection of Omissions in Translations

[ { "authorId": "144599392", "name": "I. D. Melamed" } ]

COLING

1,996

12

38

0

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle", "Conference" ]

1996-08-05T00:00:00

{ "name": "ArXiv", "volume": "cmp-lg/9609010", "pages": null }

[ "mapping algorithms", "linguistics" ]

[ "word alignment", "linguistics", "word processing", "mapping algorithms", "detection algorithm" ]

[ "statistical machine translation", "text processing", "conformal mapping", "signal detection", "speech transmission", "statistical methods", "natural language processing", "computational linguistics", "data mining", "information retrieval", "mathematics", "signal processing", "translation (languages)", "speech communication", "information theory", "correlation analysis", "artificial intelligence", "natural languages", "database systems", "computer science", "engineering", "automata theory", "communication", "semantics", "computer systems", "formal languages and automata theory", "theoretical computer science" ]

710

The Metaphone algorithm applies the phonetic encoding of orthographic sequences to simplify words prior to comparison. While Metaphone has been highly successful for the English language, for which it was designed, it may not be applied directly to Ethiopian languages. The paper details how the principles of Metaphone can be applied to Ethiopic script and uses Amharic as a case study. Match results improve as specific considerations are made for Amharic writing practices. Results are shown to improve further when common errors from Amharic input methods are considered.

2022-08-24T13:43:44.605Z

{ "ACL": null, "DBLP": "journals/corr/cs-CL-0408052", "ArXiv": "cs/0408052", "MAG": "1652017806", "CorpusId": "710", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/2f71033d74d2f17a9502867e4a43dc4374500726

Application of the Double Metaphone Algorithm to Amharic Orthography

[ { "authorId": "2580038", "name": "D. Yacob" } ]

ArXiv

2,004

11

14

1

false

[ { "category": "Linguistics", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2004-08-22T00:00:00

{ "name": "ArXiv", "volume": "cs.CL/0408052", "pages": null }

[ "orthography" ]

[ "orthography", "adaptive algorithms", "hybrid algorithms", "phonology", "part of speech" ]

[ "part of speech", "hybrid algorithms", "orthography", "phonology", "adaptive algorithms" ]

[ "natural language processing", "evolutionary algorithms", "particle swarm optimization (pso)", "linguistics", "software", "artificial intelligence", "natural languages", "genetic algorithms", "optimization problems", "optimization", "swarm intelligence", "computer science", "semantics", "correlation analysis", "mathematics" ]

712

The common approach to radial distortion is by the means of polynomial approximation, which introduces distortion-specific parameters into the camera model and requires estimation of these distortion parameters. The task of estimating radial distortion is to find a radial distortion model that allows easy undistortion as well as satisfactory accuracy. This paper presents a new class of rational radial distortion models with easy analytical undistortion formulae. Experimental results are presented to show that with this class of rational radial distortion models, satisfactory and comparable accuracy is achieved.

2022-06-20T13:00:17.431Z

{ "ACL": null, "DBLP": "journals/corr/cs-CV-0307047", "ArXiv": "cs/0307047", "MAG": "1675534934", "CorpusId": "712", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/cbf5e7952334335fbf94f11e213dec684081fda6

Rational Radial Distortion Models with Analytical Undistortion Formulae

[ { "authorId": "47687321", "name": "Lili Ma" }, { "authorId": "50580551", "name": "Y. Chen" }, { "authorId": "1685104", "name": "K. Moore" } ]

ArXiv

2,003

29

10

0

false

[ { "category": "Physics", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2003-07-19T00:00:00

{ "name": "ArXiv", "volume": "cs.CV/0307047", "pages": null }

[ "polynomial approximation" ]

[ "signal distortion", "polynomial approximation", "standard model", "stochastic processes", "correlation analysis" ]

[ "polynomial approximation", "standard model", "correlation analysis", "signal distortion", "stochastic processes" ]

[ "graph theory", "electronic document identification systems", "the standard model", "mathematics", "image compression", "communication channels", "signal to noise ratio", "probability", "theoretical computer science", "authentication", "cryptography", "public key cryptography", "image quality", "image coding", "wireless telecommunication systems", "signal processing", "computer science", "security of data", "cryptology", "network security", "image analysis", "image processing", "computer networks", "communication systems", "telecommunication systems", "engineering", "computer security", "computer imaging and vision", "computer systems" ]

713

Abstract The Kripke semantics of classical propositional normal modal logic is made algebraic via an embedding of Kripke structures into the larger class of pointed stably supported quantales. This algebraic semantics subsumes the traditional algebraic semantics based on lattices with unary operators, and it suggests natural interpretations of modal logic, of possible interest in the applications, in structures that arise in geometry and analysis, such as foliated manifolds and operator algebras, via topological groupoids and inverse semigroups. We study completeness properties of the quantale based semantics for the systems K, T, K4, S4 and S5, in particular obtaining an axiomatization for S5 which does not use negation or the modal necessity operator. As additional examples we describe intuitionistic propositional modal logic, the logic of programs PDL and the ramified temporal logic CTL.

2022-06-27T12:14:54.516Z

{ "ACL": null, "DBLP": "journals/corr/abs-0704-1886", "ArXiv": "0704.1886", "MAG": "3098602556", "CorpusId": "713", "PubMed": null, "DOI": "10.1017/S0305004108001667", "PubMedCentral": null }

https://www.semanticscholar.org/paper/3913fbf7c026f945fec434e6e885b98c5cf85696

An algebraic generalization of Kripke structures†

[ { "authorId": "1764153", "name": "Sérgio Marcelino" }, { "authorId": "143950011", "name": "P. Resende" } ]

Mathematical Proceedings of the Cambridge Philosophical Society

2,007

24

9

0

true

[ { "category": "Philosophy", "source": "s2-fos-model" }, { "category": "Mathematics", "source": "external" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2007-04-14T00:00:00

{ "name": "Mathematical Proceedings of the Cambridge Philosophical Society", "volume": "145", "pages": "549 - 577" }

[ "modal logic", "kripke semantics", "geometry", "temporal logic", "semantics" ]

[ "kripke model", "kripke semantics", "modal logic", "semantics", "geometry", "temporal logic" ]

[ "modal logic", "kripke semantics", "geometry", "temporal logic", "semantics", "kripke model" ]

[ "formal logic", "artificial intelligence", "computer science" ]

716

A novel algorithm for tunable compression to within the precision of reproduction targets, or storage, is proposed. The new algorithm is termed the `Perceptron Algorithm', which utilises simple existing concepts in a novel way, has multiple immediate commercial application aspects as well as it opens up a multitude of fronts in computational science and technology. The aims of this paper are to present the concepts underlying the algorithm, observations by its application to some example cases, and the identification of a multitude of potential areas of applications such as: image compression by orders of magnitude, signal compression including sound as well, image analysis in a multilayered detailed analysis, pattern recognition and matching and rapid database searching (e.g. face recognition), motion analysis, biomedical applications e.g. in MRI and CAT scan image analysis and compression, as well as hints on the link of these ideas to the way how biological memory might work leading to new points of view in neural computation. Commercial applications of immediate interest are the compression of images at the source (e.g. photographic equipment, scanners, satellite imaging systems), DVD film compression, pay-per-view downloads acceleration and many others identified in the present paper at its conclusion and future work section.

2022-02-13T16:01:26.630Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0601105", "ArXiv": "cs/0601105", "MAG": "1638305083", "CorpusId": "716", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/bcf198b8743459031df1878e7291ad1cff84164e

The Perceptron Algorithm: Image and Signal Decomposition, Compression, and Analysis by Iterative Gaussian Blurring

[ { "authorId": "40352011", "name": "V. Vassiliadis" } ]

ArXiv

2,006

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2006-01-24T00:00:00

{ "name": "ArXiv", "volume": "abs/cs/0601105", "pages": null }

[ "imaging systems", "pattern recognition", "face recognition", "database systems", "image compression", "motion analysis", "gaussians", "image analysis" ]

[ "backpropagation algorithm", "gaussians", "image compression", "image analysis", "pattern recognition", "database systems", "motion analysis", "imaging systems" ]

[ "imaging systems", "pattern recognition", "image analysis", "backpropagation algorithm", "face recognition", "image compression", "motion analysis", "gaussians", "database systems" ]

[ "image reconstruction", "machine learning", "computer imaging and vision", "neural networks", "image processing", "image quality", "image coding", "motion estimation", "gaussian distribution", "computer systems", "artificial intelligence", "computer science", "gaussian noise (electronic)", "signal to noise ratio", "signal processing", "engineering" ]

720

In this paper, we describe a new method combining the polynomial neural network and decision tree techniques in order to derive comprehensible classification rules from clinical electroencephalograms (EEGs) recorded from sleeping newborns. These EEGs are heavily corrupted by cardiac, eye movement, muscle, and noise artifacts and, as a consequence, some EEG features are irrelevant to classification problems. Combining the polynomial network and decision tree techniques, we discover comprehensible classification rules while also attempting to keep their classification error down. This technique is shown to outperform a number of commonly used machine learning technique applied to automatically recognize artifacts in the sleep EEGs.

2022-09-04T20:49:00.787Z

{ "ACL": null, "DBLP": "journals/titb/SchetininS04", "ArXiv": "cs/0504070", "MAG": "2145745502", "CorpusId": "720", "PubMed": "15055799", "DOI": "10.1109/TITB.2004.824735", "PubMedCentral": null }

https://www.semanticscholar.org/paper/b89e460caa1cbf8382d393bb366248f32d9d7db7

The combined technique for detection of artifacts in clinical electroencephalograms of sleeping newborns

[ { "authorId": "1714864", "name": "V. Schetinin" }, { "authorId": "2068307", "name": "J. Schult" } ]

IEEE Transactions on Information Technology in Biomedicine

2,004

60

30

3

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" }, { "category": "Medicine", "source": "external" } ]

[ "Study", "JournalArticle" ]

2004-03-01T00:00:00

{ "name": "IEEE Transactions on Information Technology in Biomedicine", "volume": "8", "pages": "28-35" }

[ "classification rules", "machine learning", "decision trees", "neural networks" ]

[ "neural networks", "decision trees", "classification models", "classification rules", "machine learning", "eeg recording", "decision tables", "decision tree induction", "rule induction", "eeg signals" ]

[ "eeg signals", "eeg recording", "machine learning", "decision trees", "decision tree induction", "classification models", "classification rules", "rule induction", "decision tables", "neural networks" ]

[ "brain computer interface", "signal processing", "artificial intelligence", "data mining", "classifiers", "classification methods", "decision theory", "computer interfaces", "engineering", "computer science", "computer systems", "human computer interaction" ]

721

The problem of known signal detection in Additive White Gaussian Noise is considered. In this paper a new detection algorithm based on Discrete Wavelet Transform pre-processing and threshold comparison is introduced. Current approaches described in [7] use the maximum value obtained in the wavelet domain for decision. Here, we use all available information in the wavelet domain with excellent results. Detector performance is presented in Probability of detection curves for a fixed probability of false alarm.

2022-09-01T19:11:34Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0505046", "ArXiv": "cs/0505046", "MAG": "1523125523", "CorpusId": "721", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/0ff52f8c45343655f5b302e595e4680923ccfa9c

Optimum Signal Linear Detector in the Discrete Wavelet Transform-Domain

[ { "authorId": "2146618", "name": "I. Melgar" }, { "authorId": "2111324749", "name": "Jaime Gómez" }, { "authorId": "145007483", "name": "J. Seijas" } ]

ArXiv

2,005

11

6

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" }, { "category": "Mathematics", "source": "external" } ]

[ "JournalArticle" ]

2005-05-18T00:00:00

{ "name": "ArXiv", "volume": "abs/cs/0505046", "pages": null }

[ "wavelet", "wavelet domain", "white gaussian noise", "probability", "signal detection", "discrete wavelet transform", "detection algorithm" ]

[ "detection algorithm", "discrete wavelet transform", "wavelet transforms", "wavelet", "wavelet domain", "transform domain", "signal detection", "white gaussian noise", "gaussian noise (electronic)", "gaussians", "probability", "wavelet packet transforms", "additive noise", "wavelet decomposition" ]

[ "wavelet decomposition", "gaussian noise (electronic)", "wavelet domain", "wavelet", "additive noise", "white gaussian noise", "probability", "signal detection", "transform domain", "discrete wavelet transform", "wavelet packet transforms", "gaussians", "wavelet transforms", "detection algorithm" ]

[ "wavelet analysis", "signal to noise ratio", "wavelet coefficients", "spurious signal noise", "white noise", "mathematics", "signal processing", "discrete cosine transforms", "gaussian distribution", "image processing", "communication channels", "engineering", "cosine transforms", "mathematical transformations", "computer imaging and vision", "wireless telecommunication systems", "image compression", "image enhancement", "computer science", "computer networks", "communication systems", "telecommunication systems", "image quality", "image coding", "image analysis", "computer systems" ]

722

The optimal decoder achieving the outage capacity under imperfect channel estimation is investigated. First, by searching into the family of nearest neighbor decoders, which can be easily implemented on most practical coded modulation systems, we derive a decoding metric that minimizes the average of the transmission error probability over all channel estimation errors. This metric, for arbitrary memoryless channels, achieves the capacity of a composite (more noisy) channel. Next, according to the notion of estimation-induced outage capacity (EIO capacity) introduced in our previous work, we characterize maximal achievable information rates associated to the proposed decoder. The performance of the proposed decoding metric over uncorrelated Rayleigh fading MIMO channels is compared to both the classical mismatched maximum-likelihood (ML) decoder and the theoretical limits given by the EIO capacity (i.e. the best decoder in presence of channel estimation errors). Numerical results show that the derived metric provides significant gains, in terms of achievable information rates and bit error rate (BER), in a bit interleaved coded modulation (BICM) framework, without introducing any additional decoding complexity.

2022-05-13T00:29:41.136Z

{ "ACL": null, "DBLP": "conf/isit/PiantanidaSD07", "ArXiv": "0706.2809", "MAG": "2056268697", "CorpusId": "722", "PubMed": null, "DOI": "10.1109/ISIT.2007.4557559", "PubMedCentral": null }

https://www.semanticscholar.org/paper/ae6d98d22faaeebc7c9501a311ae13a3bbb86a2a

On the Outage Capacity of a Practical Decoder Using Channel Estimation Accuracy

[ { "authorId": "1743922", "name": "P. Piantanida" }, { "authorId": "1749633", "name": "S. Sadough" }, { "authorId": "1694313", "name": "P. Duhamel" } ]

2007 IEEE International Symposium on Information Theory

2,007

14

0

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": "2281-2285" }

[ "bit error rate", "rayleigh fading", "channel estimation", "numerical results", "outage capacity", "mimo channel", "maximum likelihood", "coded modulation", "probability", "imperfect channel estimation", "decoding complexity", "k-nearest neighbors", "memoryless", "channel estimation errors", "ber" ]

[ "outages", "outage capacity", "channel estimation", "estimation method", "imperfect channel estimation", "channel estimation errors", "k-nearest neighbors", "probability", "memoryless", "mimo", "mimo channel", "maximum likelihood", "numerical results", "bit error rate", "ber", "radio channels", "outage probability", "average spectral efficiency", "outage performance", "ergodic capacity", "imperfect channel state information", "transmission capacities", "channel capacity", "imperfect csi", "multiple-input-multiple-output", "wireless channel", "control channels", "channel estimator", "channel estimation method", "carrier frequency offsets", "pilot symbols", "ofdma systems", "ofdm systems", "conditional probabilities", "posterior probability" ]

[ "estimation method", "carrier frequency offsets", "channel estimation", "channel estimator", "mimo channel", "probability", "decoding complexity", "outages", "radio channels", "control channels", "channel estimation errors", "channel capacity", "ber", "ergodic capacity", "bit error rate", "transmission capacities", "mimo", "outage capacity", "ofdm systems", "ofdma systems", "conditional probabilities", "imperfect csi", "rayleigh fading", "maximum likelihood", "imperfect channel estimation", "posterior probability", "multiple-input-multiple-output", "outage probability", "imperfect channel state information", "numerical results", "pilot symbols", "coded modulation", "outage performance", "wireless channel", "k-nearest neighbors", "memoryless", "average spectral efficiency", "channel estimation method" ]

[ "numerical model", "signal encoding", "frequency estimation", "communication channels", "mim devices", "fading channels", "mimo systems", "matrix algebra", "mathematics", "iterative decoding", "block codes", "fading (radio)", "radio transmission", "antennas", "cognitive radio", "radio systems", "medium access control", "mobile telecommunication systems", "channel state information", "signal to noise ratio", "information theory", "ofdm", "closed-form expression", "ad hoc networks", "multiplexing", "orthogonal frequency division multiplexing", "frequency allocation", "ofdma", "maximum likelihood estimation", "likelihood functions", "probability distributions", "beamforming", "wireless telecommunication systems", "numerical methods", "turbo codes", "cooperative communication", "wireless networks", "clustering algorithms", "capacity regions", "gaussians", "adaptive modulation", "spectral efficiencies", "signal detection", "network protocols", "telecommunication networks", "transmitters", "signal processing", "communication", "routers", "internet protocols", "quality of service", "wireless local area networks (wlan)", "multicasts", "routing algorithms", "sensors", "telecommunication traffic", "data communication systems", "frequency division multiple access", "correlation analysis", "computer networks", "communication systems", "telecommunication systems", "quadrature amplitude modulation", "low-density parity-check codes", "convolutional codes", "code division multiple access", "additive white gaussian noise", "wireless sensor networks", "wireless communications", "packet networks", "data mining", "broadcast channels", "gaussian distribution", "power control", "internet", "signal receivers", "engineering", "bandwidth", "local area networks", "computer hardware", "computer systems", "computer science", "graph theory", "white noise", "gaussian noise (electronic)", "energy utilization", "sensor nodes", "broadcasting", "theoretical computer science", "electricity" ]

726

The churn rate of a peer-to-peer system places direct limitations on the rate at which messages can be effectively communicated to a group of peers. These limitations are independent of the topology and message transmission latency. In this paper we consider a peer-to-peer network, based on the Engset model, where peers arrive and depart independently at random. We show how the arrival and departure rates directly limit the capacity for message streams to be broadcast to all other peers, by deriving mean field models that accurately describe the system behavior. Our models cover the unit and more general k buffer cases, i.e. where a peer can buffer at most k messages at any one time, and we give results for both single and multi-source message streams. We define coverage rate as peer-messages per unit time, i.e. the rate at which a number of peers receive messages, and show that the coverage rate is limited by the churn rate and buffer size. Our theory introduces an Instantaneous Message Exchange (IME) model and provides a template for further analysis of more complicated systems. Using the IME model, and assuming random processes, we have obtained very accurate equations of the system dynamics in a variety of interesting cases, that allow us to tune a peer-to-peer system. It remains to be seen if we can maintain this accuracy for general processes and when applying a non-instantaneous model.

2022-09-03T14:20:49.108Z

{ "ACL": null, "DBLP": "journals/corr/abs-0705-2065", "ArXiv": "0705.2065", "MAG": "1614404949", "CorpusId": "726", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/217a6511321ba4ecea3e82a862f799aa28811d71

Mean Field Models of Message Throughput in Dynamic Peer-to-Peer Systems

[ { "authorId": "145098019", "name": "A. Harwood" }, { "authorId": "144849964", "name": "O. Ohrimenko" } ]

ArXiv

2,007

11

2

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2007-05-14T00:00:00

{ "name": "ArXiv", "volume": "abs/0705.2065", "pages": null }

[ "peer-to-peer", "random processes", "topology", "broadcast" ]

[ "topology", "data stream", "random processes", "peer-to-peer", "differential equations" ]

[ "broadcast", "peer-to-peer", "topology", "data stream", "random processes", "differential equations" ]

[ "ad hoc networks", "broadcasting", "distributed computer systems", "internet", "computer networks", "data mining", "data communication systems", "database systems", "probability", "numerical methods", "routers", "mobile telecommunication systems", "internet protocols", "quality of service", "wireless local area networks (wlan)", "multicasts", "routing algorithms", "sensors", "communication channels", "computer systems", "computer science", "mathematics", "telecommunication traffic", "bandwidth", "telecommunication networks", "local area networks", "wireless telecommunication systems", "computer hardware", "telecommunication systems", "communication systems" ]

728

Recently we introduced the rich-club phenomenon as a quantitative metric to characterize the tier structure of the Autonomous Systems level Internet topology (AS graph) and we proposed the Interactive Growth (IG) model, which closely matches the degree distribution and hierarchical structure of the AS graph and compares favourble with other available Internet power-law topology generators. Our research was based on the widely used BGP AS graph obtained from the Oregon BGP routing tables. Researchers argue that Traceroute AS graph, extracted from the traceroute data collected by the CAIDA's active probing tool, Skitter, is more complete and reliable. To be prudent, in this paper we analyze and compare topological structures of Traceroute AS graph and BGP AS graph. Also we compare with two synthetic Internet topologies generated by the IG model and the well-known Barabasi-Albert (BA) model. Result shows that both AS graphs show the rich-club phenomenon and have similar tier structures, which are closely matched by the IG model, however the BA model does not show the rich-club phenomenon at all.

2022-07-19T13:47:28.687Z

{ "ACL": null, "DBLP": "journals/corr/cs-NI-0303030", "ArXiv": "cs/0303030", "MAG": "2299553038", "CorpusId": "728", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/f354eb035b18eefb1ddd321acbc9757fb7f8f5c2

Analyzing and modelling the AS-level Internet topology

[ { "authorId": "145012879", "name": "Shi Zhou" }, { "authorId": "144231643", "name": "R. Mondragón" } ]

ArXiv

2,003

29

6

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2003-03-26T00:00:00

{ "name": "ArXiv", "volume": "cs.NI/0303030", "pages": null }

[ "topological structure", "hierarchical structures", "routing table", "bgp", "topology", "degree distributions", "internet" ]

[ "internet", "network topology", "topology", "topological structure", "degree distributions", "hierarchical structures", "bgp" ]

[ "topological structure", "hierarchical structures", "network topology", "routing table", "topology", "bgp", "degree distributions", "internet" ]

[ "hierarchical system", "computer networks", "routing protocols", "routing algorithms", "gateways (computer networks)", "graph theory", "computer science", "computer systems", "routers", "wireless telecommunication systems", "internet protocols", "theoretical computer science", "telecommunication traffic", "bandwidth", "communication systems", "telecommunication systems", "telecommunication networks" ]

729

Using the cavity equations of Mézard, Parisi, and Zecchina Science 297 (2002), 812 ; Mézard and Zecchina, Phys Rev E 66 (2002), 056126 we derive the various threshold values for the number of clauses per variable of the random K‐satisfiability problem, generalizing the previous results to K ≥ 4. We also give an analytic solution of the equations, and some closed expressions for these thresholds, in an expansion around large K. The stability of the solution is also computed. For any K, the satisfiability threshold is found to be in the stable region of the solution, which adds further credit to the conjecture that this computation gives the exact satisfiability threshold.© 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006

2022-09-04T23:17:05.523Z

{ "ACL": null, "DBLP": "journals/corr/cs-CC-0309020", "ArXiv": "cs/0309020", "MAG": "2097532582", "CorpusId": "729", "PubMed": null, "DOI": "10.1002/rsa.20090", "PubMedCentral": null }

https://www.semanticscholar.org/paper/b335c4b8b52c3dd729c86ffd86d097f498daf492

Threshold values of random K‐SAT from the cavity method

[ { "authorId": "1699268", "name": "S. Mertens" }, { "authorId": "2338183", "name": "M. Mézard" }, { "authorId": "1719010", "name": "R. Zecchina" } ]

Random Struct. Algorithms

2,003

44

134

12

true

[ { "category": "Mathematics", "source": "s2-fos-model" }, { "category": "Mathematics", "source": "external" }, { "category": "Computer Science", "source": "external" }, { "category": "Physics", "source": "external" } ]

[ "JournalArticle" ]

2003-09-12T00:00:00

{ "name": "Random Structures & Algorithms", "volume": "28", "pages": null }

[ "satisfiability problems", "sat", "satisfiability" ]

[ "satisfiability", "satisfiability problems", "propositional formulas", "differential equations", "social sciences" ]

[ "satisfiability", "satisfiability problems", "social sciences", "propositional formulas", "sat", "differential equations" ]

[ "formal logic", "sociology", "propositional logic", "boolean functions", "model checking", "numerical methods", "artificial intelligence", "logic programming", "mathematics", "embedded systems", "architecture verification and validation", "computer science", "computer programming languages", "computer systems", "architecting", "computer programming", "software architecture", "software design", "software engineering" ]

731

We investigate the lattice of machine invariant classes. This is an infinite completely distributive lattice but it is not a Boolean lattice. We show the subword complexity and the growth function create machine invariant classes. So the lattice would serve as a measure of words cryptographic quality if we like to identify new stream ciphers suitable for widespread adoption.

2022-09-03T19:16:11.602Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0502064", "ArXiv": "cs/0502064", "MAG": "1653747787", "CorpusId": "731", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/79b32859136188436b1e4de7978001fc0f2435e1

The Lattice of Machine Invariant Sets and Subword Complexity

[ { "authorId": "2060025365", "name": "J. Buls" } ]

ArXiv

2,005

19

2

0

false

[ { "category": "Mathematics", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2005-02-14T00:00:00

{ "name": "ArXiv", "volume": "abs/cs/0502064", "pages": null }

[ "stream ciphers" ]

[ "stream ciphers", "block ciphers", "boolean functions", "data stream", "differential cryptanalysis" ]

[ "boolean functions", "stream ciphers", "block ciphers", "data stream", "differential cryptanalysis" ]

[ "mathematics", "security of data", "cryptography", "data mining", "data communication systems", "database systems", "lyapunov methods", "cryptanalysis", "computer security", "cryptology", "computer science", "computer systems", "lyapunov exponent", "riccati equations", "time-varying delay", "lyapunov stability theory", "robotic manipulators", "time delay", "authentication", "lyapunov functions", "discrete time control systems", "optimal control systems", "linear systems", "time varying control systems", "adaptive control systems", "linear matrix inequalities", "control systems", "robots", "differential equations", "nonlinear control systems", "optimal control", "matrix algebra", "linear control systems", "process control", "robotics", "numerical methods", "feedback systems", "control theory", "optimization", "automation", "engineering" ]

732

We present an algorithm which attains O(\sqrt{T}) internal (and thus external) regret for finite games with partial monitoring under the local observability condition. Recently, this condition has been shown by (Bartok, Pal, and Szepesvari, 2011) to imply the O(\sqrt{T}) rate for partial monitoring games against an i.i.d. opponent, and the authors conjectured that the same holds for non-stochastic adversaries. Our result is in the affirmative, and it completes the characterization of possible rates for finite partial-monitoring games, an open question stated by (Cesa-Bianchi, Lugosi, and Stoltz, 2006). Our regret guarantees also hold for the more general model of partial monitoring with random signals.

2022-09-04T20:49:01.076Z

{ "ACL": null, "DBLP": "journals/corr/abs-1108-6088", "ArXiv": "1108.6088", "MAG": "2114827048", "CorpusId": "732", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/7beaabddcd6ec7f2204cad8e95ce7f3376e492cf

No Internal Regret via Neighborhood Watch

[ { "authorId": "145346320", "name": "Dean P. Foster" }, { "authorId": "1680046", "name": "A. Rakhlin" } ]

AISTATS

2,011

11

32

3

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" }, { "category": "Mathematics", "source": "external" } ]

[ "JournalArticle" ]

2011-08-30T00:00:00

{ "name": "ArXiv", "volume": "abs/1108.6088", "pages": null }

[ "observability" ]

[ "role-playing game", "videogames", "computer games", "remote monitoring", "observability", "stochastic" ]

[ "observability", "videogames", "remote monitoring", "role-playing game", "computer games", "stochastic" ]

[ "nonlinear control systems", "linear matrix inequalities", "human computer interaction", "remote control", "interactive computer graphics", "game theory", "stochastic processes", "stochasticity", "adaptive control systems", "feedback systems", "control theory", "matrix algebra", "computer science", "robots", "user interfaces", "computer imaging and vision", "artificial intelligence", "probability", "numerical model", "process control", "computer systems", "mathematics", "robotics", "automation", "engineering" ]

735

Phishing is an increasingly sophisticated method to steal personal user information using sites that pretend to be legitimate. In this paper, we take the following steps to identify phishing URLs. First, we carefully select lexical features of the URLs that are resistant to obfuscation techniques used by attackers. Second, we evaluate the classification accuracy when using only lexical features, both automatically and hand-selected, vs. when using additional features. We show that lexical features are sufficient for all practical purposes. Third, we thoroughly compare several classification algorithms, and we propose to use an online method (AROW) that is able to overcome noisy training data. Based on the insights gained from our analysis, we propose PhishDef, a phishing detection system that uses only URL names and combines the above three elements. PhishDef is a highly accurate method (when compared to state-of-the-art approaches over real datasets), lightweight (thus appropriate for online and client-side deployment), proactive (based on online classification rather than blacklists), and resilient to training data inaccuracies (thus enabling the use of large noisy training data).

2022-09-04T12:29:55.416Z

{ "ACL": null, "DBLP": "conf/infocom/LeMF11", "ArXiv": "1009.2275", "MAG": "2023973750", "CorpusId": "735", "PubMed": null, "DOI": "10.1109/INFCOM.2011.5934995", "PubMedCentral": null }

https://www.semanticscholar.org/paper/6cb98992cba5f0e0cca19526ee70c496b783bcbb

PhishDef: URL names say it all

[ { "authorId": "145473009", "name": "Anh Le" }, { "authorId": "1706319", "name": "A. Markopoulou" }, { "authorId": "2771914", "name": "M. Faloutsos" } ]

2011 Proceedings IEEE INFOCOM

2,010

24

184

18

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2010-09-12T00:00:00

{ "name": "2011 Proceedings IEEE INFOCOM", "volume": null, "pages": "191-195" }

[ "user information", "obfuscation", "phishing", "real data sets" ]

[ "phishing", "user information", "classification models", "web content", "hyperlinks" ]

[ "phishing", "classification models", "hyperlinks", "user information", "real data sets", "web content", "obfuscation" ]

[ "world wide web", "computer crime", "electronic mail", "classification methods", "hypertext systems", "recommender systems", "personal information", "clustering algorithms", "database systems", "reverse engineering", "data privacy", "malwares", "internet", "security of data", "computer systems", "information retrieval", "privacy", "data mining", "architecting", "operating systems", "network security", "computer science", "computer security", "software architecture", "cryptography", "computer networks", "software design", "cryptology", "software engineering" ]

736

A multi-source quickest detection problem is considered. Assume there are two independent Poisson processes X1and X2with disorder times θ<inf>1</inf>and θ<inf>2</inf>, respectively: that is the intensities of X1and X2change at random unobservable times θ<inf>1</inf>and θ<inf>2</inf>, respectively. θ<inf>1</inf>and θ<inf>2</inf>are independent of each other and are exponentially distributed. Define θ\#25B5\θ<inf>1</inf>\#22C0\θ<inf>2</inf>=min {θ<inf>1</inf>, θ<inf>2</inf>}. For any stopping time τ that is measurable with respect to the filtration generated by the observations define a penalty function of the form R<inf>τ</inf>=\#2219\(τ<θ)+c\#1D404\[(τ-θ)+], where c > 0 and (τ - 0)+is the positive part of τ - 0. It is of interest to find a stopping time τ that minimizes the above performance index. Since both observations X1and X2reveal information about the disorder time θ, even this simple problem is more involved than solving the disorder problems for X1and X2separately. This problem is formulated in terms of a two dimensional sufficient statistic, and the corresponding optimal stopping problem is examined. Using a suitable single jump operator, this problem is solved explicitly.

2022-08-31T16:23:33.274Z

{ "ACL": null, "DBLP": "journals/siamco/BayraktarP07", "ArXiv": "cs/0509029", "MAG": "2096242314", "CorpusId": "736", "PubMed": null, "DOI": "10.1137/050630933", "PubMedCentral": null }

https://www.semanticscholar.org/paper/6a22d0622c36bfad8c9b7cbaa1b111cc3a5d2237

Quickest Detection of a Minimum of Disorder Times

[ { "authorId": "144781380", "name": "E. Bayraktar" }, { "authorId": "145967056", "name": "H. Poor" } ]

Proceedings of the 44th IEEE Conference on Decision and Control

2,005

16

11

3

true

[ { "category": "Physics", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" }, { "category": "Mathematics", "source": "external" } ]

[ "JournalArticle", "Conference" ]

2005-09-10T00:00:00

{ "name": "Proceedings of the 44th IEEE Conference on Decision and Control", "volume": null, "pages": "326-331" }

[ "two dimensional", "correlation analysis", "detection problems", "penalty function", "unobservable" ]

[ "detection algorithm", "unobservable", "penalty function", "correlation analysis", "combinatorial problems" ]

[ "two dimensional", "correlation analysis", "detection algorithm", "detection problems", "combinatorial problems", "penalty function", "unobservable" ]

[ "image processing", "mathematics", "signal detection", "detection performance", "combinatorial mathematics", "genetic algorithms", "constrained optimization", "discrete event systems", "observability", "computer imaging and vision", "signal processing", "graph theory", "artificial intelligence", "optimization problems", "discrete time control systems", "petri nets", "nonlinear control systems", "linear matrix inequalities", "computer science", "engineering", "theoretical computer science", "adaptive control systems", "feedback systems", "control theory", "matrix algebra", "process control", "computer systems", "automation" ]

737

We propose an algorithm to maximize the instantaneous sum data rate transmitted by a base station in the downlink of a multiuser multiple-input, multiple-output system. The transmitter and the receivers may each be equipped with multiple antennas and each user may receive more than one data stream. We show that maximizing the sum rate is closely linked to minimizing the product of mean squared errors (PMSE). The algorithm employs an uplink/downlink duality to iteratively design transmit-receive linear precoders, decoders, and power allocations that minimize the PMSE for all data streams under a sum power constraint. Numerical simulations illustrate the effectiveness of the algorithm and support the use of the PMSE criterion in maximizing the overall instantaneous data rate.

2022-08-26T05:00:33.138Z

{ "ACL": null, "DBLP": "journals/corr/abs-0801-0340", "ArXiv": "0801.0340", "MAG": "1501481149", "CorpusId": "737", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/c322c1897b7499a6d45d393a6526674c93624611

Sum Rate Maximization using Linear Precoding and Decoding in the Multiuser MIMO Downlink

[ { "authorId": "2774922", "name": "Adam J. Tenenbaum" }, { "authorId": "9346468", "name": "R. Adve" } ]

ArXiv

2,008

36

8

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Mathematics", "source": "external" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2008-01-01T00:00:00

{ "name": "ArXiv", "volume": "abs/0801.0340", "pages": null }

[ "transmitters", "mean square error", "power constraints", "power allocations", "multiple antenna", "linear pre-coding", "multi-user mimo downlinks", "base stations", "uplink", "data stream", "multiple-input-multiple-output", "sum-rate", "linear precoders" ]

[ "sum-rate", "linear pre-coding", "precoding", "multi-user mimo", "multi-user mimo downlinks", "precoders", "mimo", "base stations", "transmitters", "multiple antenna", "antennas", "data stream", "mean square", "mean square error", "linear precoders", "power allocations", "multi-antenna", "weighted sum-rate", "transmit beamforming", "precoder design", "stream data" ]

[ "precoder design", "power allocations", "multi-user mimo", "multiple antenna", "uplink", "precoders", "linear precoders", "mimo", "power constraints", "weighted sum-rate", "multi-user mimo downlinks", "multi-antenna", "base stations", "mean square", "data stream", "mean square error", "transmitters", "precoding", "linear pre-coding", "transmit beamforming", "multiple-input-multiple-output", "sum-rate", "stream data", "antennas" ]

[ "channel state information", "wireless telecommunication systems", "multipath propagation", "beamforming", "multiplexing", "mimo systems", "ofdma", "mobile telecommunication systems", "code division multiple access", "zero-forcing", "mimo channel", "orthogonal frequency division multiplexing", "sufficient conditions", "stochastic processes", "data mining", "data communication systems", "database systems", "signal to noise ratio", "signal receivers", "communication channels", "interference channels", "numerical results", "fading (radio)", "rayleigh fading", "channel capacity", "computer networks", "communication systems", "telecommunication systems", "fading channels", "frequency division multiple access", "telecommunication networks", "mim devices", "matrix algebra", "linear matrix inequalities", "probability", "computer science", "computer systems", "signal processing", "signal detection", "signal interference", "information theory", "numerical methods", "bit error rate", "frequency allocation", "mathematics", "engineering", "spurious signal noise", "communication", "telecommunication traffic" ]

738

A mobile ad-hoc network is an autonomous collection of mobile nodes that communicate over bandwidth constrained wireless links. Due to nodal mobility, the network topology may change rapidly and unpredictably over time. The routing protocols meant for wired network cannot be used for mobile ad-hoc network because of mobility of network. A number of routing protocols like Destination-Sequenced Distance-Vector (DSDV), Ad-Hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Temporally Ordered Routing Algorithm have been implemented. The ad-hoc routing protocols can be divided into two classes; Table-Driven and On-Demand. This paper examines two routing protocols for mobile ad-hoc networks—the Destination Sequenced Distance Vector (DSDV), the table-driven protocol and the Ad-Hoc On- Demand Distance Vector routing (AODV), an on-demand protocol and propose an algorithm that facilitates efficient routing of the packet and failure recovery mechanism

2022-08-31T20:48:56.401Z

{ "ACL": null, "DBLP": "journals/ijcns/PawanTNN10", "ArXiv": null, "MAG": "2007580270", "CorpusId": "738", "PubMed": null, "DOI": "10.4236/ijcns.2010.33037", "PubMedCentral": null }

https://www.semanticscholar.org/paper/6a8b283107a4fd25564606f521dc945d688fd858

A Mobile Ad-Hoc Routing Algorithm with Comparative Study of Earlier Proposed Algorithms

[ { "authorId": "2095584240", "name": "Kumar Verma Pawan" }, { "authorId": "2085859", "name": "Gupta Tarun" }, { "authorId": "80089877", "name": "N. Rakesh" }, { "authorId": "8970218", "name": "Nitin" } ]

Int. J. Commun. Netw. Syst. Sci.

2,010

16

8

0

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Business", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2010-03-31T00:00:00

{ "name": "Int. J. Commun. Netw. Syst. Sci.", "volume": "3", "pages": "289-293" }

[ "routing protocols", "aodv", "mobile ad hoc networks", "dsr", "network topology", "bandwidth", "failure recovery", "recovery mechanisms", "routing algorithms", "efficient routing", "mobile nodes", "wireless link" ]

[ "mobile ad hoc", "routing algorithms", "efficient routing", "routing protocols", "mobile nodes", "wireless link", "wireless", "network topology", "topology", "aodv", "dsr", "failure recovery" ]

[ "routing protocols", "aodv", "mobile ad hoc networks", "dsr", "network topology", "efficient routing", "mobile ad hoc", "bandwidth", "topology", "wireless", "recovery mechanisms", "routing algorithms", "failure recovery", "mobile nodes", "wireless link" ]

[ "routers", "wireless telecommunication systems", "ad hoc networks", "computer networks", "radio", "computer system recovery", "fault tolerance", "mobile telecommunication systems", "internet protocols", "wireless networks", "telecommunication traffic", "communication systems", "telecommunication systems", "quality of service", "wireless local area networks (wlan)", "multicasts", "sensors", "computer science", "operating systems", "fault tolerant computer systems", "data communication systems", "software quality", "communication channels", "telecommunication networks", "wireless communications", "packet networks", "computer systems", "local area networks", "computer hardware", "distributed computer systems", "software design", "software engineering" ]

739

Research concerning organization and coordination within multi-agent systems continues to draw from a variety of architectures and methodologies. The work presented in this paper combines techniques from game theory and multi-agent systems to produce self-organizing, polymorphic, lightweight, embedded agents for systems scheduling within a large-scale real-time systems environment. Results show how this approach is used to experimentally produce optimum real-time scheduling through the emergent behavior of thousands of agents. These results are obtained using a SWARM simulation of systems scheduling within a high energy physics experiment consisting of 2500 digital signal processors.

2022-09-03T09:46:11.712Z

{ "ACL": null, "DBLP": "conf/his/MessieO04", "ArXiv": "cs/0504108", "MAG": "2129377242", "CorpusId": "739", "PubMed": null, "DOI": "10.1109/ICHIS.2004.35", "PubMedCentral": null }

https://www.semanticscholar.org/paper/6e9c302086200206f9178749f5880fb711e1fb2d

Cooperative game theory within multi-agent systems for systems scheduling

[ { "authorId": "2922060", "name": "D. Messie" }, { "authorId": "144293701", "name": "Jae C. Oh" } ]

Fourth International Conference on Hybrid Intelligent Systems (HIS'04)

2,004

20

7

0

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle", "Conference" ]

2004-12-05T00:00:00

{ "name": "Fourth International Conference on Hybrid Intelligent Systems (HIS'04)", "volume": null, "pages": "166-171" }

[ "digital signal processors", "real time systems", "game theory", "real time scheduling", "cooperative game", "self organizing", "multiagent system" ]

[ "cooperative game", "game theory", "multi-agent", "multiagent system", "agent systems", "real time systems", "real time scheduling", "digital signal processors" ]

[ "digital signal processors", "agent systems", "real time systems", "multi-agent", "game theory", "real time scheduling", "cooperative game", "self organizing", "multiagent system" ]

[ "digital signal processing", "intelligent agents", "mobile agents", "knowledge based systems", "object oriented programming", "mobile robots", "field programmable gate array", "embedded systems", "online systems", "artificial intelligence", "self organizing maps", "signal processing", "mobile computing", "mobile telecommunication systems", "distributed computer systems", "computer programming", "robotics", "computer hardware", "computer systems", "computer science", "conformal mapping", "engineering", "wireless telecommunication systems", "telecommunication networks", "data communication systems", "communication channels", "mathematics", "computer networks", "communication systems", "telecommunication systems" ]

741

Three approaches to content-and-structure XML retrieval are analysed in this paper: first by using Zettair, a fulltext information retrieval system; second by using eXist, a native XML database, and third by using a hybrid XML retrieval system that uses eXist to produce the final answers from likely relevant articles retrieved by Zettair. INEX 2003 content-and-structure topics can be classified in two categories: the first retrieving full articles as final answers, and the second retrieving more specific elements within articles as final answers. We show that for both topic categories our initial hybrid system improves the retrieval effectiveness of a native XML database. For ranking the final answer elements, we propose and evaluate a novel retrieval model that utilises the structural relationships between the answer elements of a native XML database and retrieves Coherent Retrieval Elements. The final results of our experiments show that when the XML retrieval task focusses on highly relevant elements our hybrid XML retrieval system with the Coherent Retrieval Elements module is 1.8 times more effective than Zettair and 3 times more effective than eXist, and yields an effective content-and-structure XML retrieval.

2022-09-02T11:49:22.366Z

{ "ACL": null, "DBLP": "conf/tdm/PehcevskiTV04", "ArXiv": "cs/0508017", "MAG": "1636705990", "CorpusId": "741", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/e0fc0e268725975e808c9f4b3f36039ba50844fe

Enhancing Content-And-Structure Information Retrieval using a Native XML Database

[ { "authorId": "3324944", "name": "J. Pehcevski" }, { "authorId": "145608528", "name": "J. Thom" }, { "authorId": "1685821", "name": "Anne-Marie Vercoustre" } ]

TDM

2,005

13

9

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2005-08-02T00:00:00

{ "name": null, "volume": null, "pages": "27-34" }

[ "retrieval effectiveness", "information retrieval systems", "xml data", "xml retrieval", "retrieval performance", "information retrieval" ]

[ "information retrieval", "xml data", "database systems", "xml", "retrieval effectiveness" ]

[ "retrieval effectiveness", "xml data", "information retrieval systems", "xml retrieval", "xml", "retrieval performance", "information retrieval", "database systems" ]

[ "search engines", "query processing", "information management", "world wide web", "computer science", "computer systems", "query languages", "information technology", "internet" ]

745

This paper explores optimization of paging and registration policies in cellular networks. Motion is modeled as a discrete-time Markov process, and minimization of the discounted, infinite-horizon average cost is addressed. The structure of jointly optimal paging and registration policies is investigated through the use of dynamic programming for partially observed Markov processes. It is shown that there exist policies with a certain simple form that are jointly optimal. An iterative algorithm for policies with the simple form is proposed and investigated. The algorithm alternates between paging policy optimization, and registration policy optimization. It finds a pair of individually optimal policies. Majorization theory and Riesz's rearrangement inequality are used to show that jointly optimal paging and registration policies are given for symmetric or Gaussian random walk models by the nearest-location-first paging policy and distance threshold registration policies.

2022-09-05T03:34:16.236Z

{ "ACL": null, "DBLP": "journals/tit/HajekMY08", "ArXiv": "cs/0702102", "MAG": "2012726532", "CorpusId": "745", "PubMed": null, "DOI": "10.1109/TIT.2007.913566", "PubMedCentral": null }

https://www.semanticscholar.org/paper/6d5463ed0dc0d2fccd30d10da271945d5f157cbf

Paging and Registration in Cellular Networks: Jointly Optimal Policies and an Iterative Algorithm

[ { "authorId": "1741615", "name": "B. Hajek" }, { "authorId": "2817454", "name": "Kevin Mitzel" }, { "authorId": "3220428", "name": "Sichao Yang" } ]

IEEE Transactions on Information Theory

2,007

52

43

2

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" }, { "category": "Mathematics", "source": "external" } ]

[ "JournalArticle" ]

2007-02-18T00:00:00

{ "name": "IEEE Transactions on Information Theory", "volume": "54", "pages": "608-622" }

[ "discrete-time", "optimal policies", "random walk models", "optimization", "cellular network", "gaussians", "markov processes", "paging" ]

[ "cellular", "cellular network", "optimal policies", "optimization", "discrete-time", "markov chains", "infinite horizons", "paging", "gaussians", "random walk", "random walk models" ]

[ "infinite horizons", "random walk", "discrete-time", "optimal policies", "random walk models", "optimization", "markov chains", "cellular network", "cellular", "gaussians", "markov processes", "paging" ]

[ "markov decision processes", "graph theory", "random processes", "discrete time control systems", "mathematics", "wireless telecommunication systems", "wireless", "cellular telephone systems", "cellular radio systems", "gaussian distribution", "correlation analysis", "location management", "on-line algorithms", "theoretical computer science", "probability", "nonlinear control systems", "linear matrix inequalities", "computer networks", "communication systems", "telecommunication systems", "radio", "mobile computing", "mobile telecommunication systems", "communication channels", "telecommunication traffic", "signal to noise ratio", "gaussian noise (electronic)", "mobility management", "online systems", "computer science", "adaptive control systems", "feedback systems", "control theory", "matrix algebra", "computer systems", "telecommunication networks", "data communication systems", "signal processing", "wireless networks", "process control", "engineering", "wireless communications", "packet networks", "automation" ]

746

In the spoken language machine translation project Verbmobil, the semantic formalism Language for Underspecified Discourse representation structures (LUD) is used. LUD describes a number of DRSs and allows for underspecification of scopal ambiguities. Dealing with Japanese-to-English translation besides German-to-English poses challenging problems. In this paper, a treatment of multiple discourse relation constructions on the sentential level is discussed. These are common in Japanese but cause a problem for the formalism. It is shown that the underspecification is to be represented for them, too. Additionally, it is possible to state a semantic constraint on the resolution of multiple discourse relations which seems to prevail over the syntactic c-command constraint.

2022-08-30T14:25:56.947Z

{ "ACL": "C96-2133", "DBLP": "conf/coling/Mori96", "ArXiv": "cmp-lg/9607033", "MAG": "2025428517", "CorpusId": "746", "PubMed": null, "DOI": "10.3115/993268.993305", "PubMedCentral": null }

https://www.semanticscholar.org/paper/6912453db2eb994cf8d3a058173ebb8e9edda1ad

Multiple Discourse Relations on the Sentential Level in Japanese

[ { "authorId": "50343615", "name": "Yoshiki Mori" } ]

COLING

1,996

16

4

0

true

[ { "category": "Linguistics", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle", "Conference" ]

1996-07-30T00:00:00

{ "name": null, "volume": null, "pages": "788-793" }

[ "japanese", "machine translations", "syntactics", "semantics" ]

[ "syntactics", "machine translations", "semantics", "syntactic structure", "speech-to-speech translation" ]

[ "machine translations", "syntactic structure", "japanese", "syntactics", "speech-to-speech translation", "semantics" ]

[ "natural language processing", "translation (languages)", "information theory", "asian continental ancestry group", "computational linguistics", "speech transmission", "artificial intelligence", "natural languages", "automata theory", "linguistics", "communication", "genotype", "genetic association", "database systems", "speech communication", "computer science", "formal languages and automata theory", "single nucleotide polymorphism", "genetic analysis", "computer systems", "theoretical computer science", "bioinformatics" ]

748

DRAM-based memory is a critical factor that creates a bottleneck on the system performance since the processor speed largely outperforms the DRAM latency. In this thesis, we develop a low-cost mechanism, called ChargeCache, which enables faster access to recently-accessed rows in DRAM, with no modifications to DRAM chips. Our mechanism is based on the key observation that a recently-accessed row has more charge and thus the following access to the same row can be performed faster. To exploit this observation, we propose to track the addresses of recently-accessed rows in a table in the memory controller. If a later DRAM request hits in that table, the memory controller uses lower timing parameters, leading to reduced DRAM latency. Row addresses are removed from the table after a specified duration to ensure rows that have leaked too much charge are not accessed with lower latency. We evaluate ChargeCache on a wide variety of workloads and show that it provides significant performance and energy benefits for both single-core and multi-core systems.

2022-09-04T06:49:26.395Z

{ "ACL": null, "DBLP": "journals/corr/Hassan16", "ArXiv": "1609.07234", "MAG": "2524946875", "CorpusId": "748", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/2df595c48e616ce05edfb6093babbd7762667d5d

Reducing DRAM Access Latency by Exploiting DRAM Leakage Characteristics and Common Access Patterns

[ { "authorId": "40016363", "name": "Hasan Hassan" } ]

ArXiv

2,016

108

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2016-09-23T00:00:00

{ "name": "ArXiv", "volume": "abs/1609.07234", "pages": null }

[ "multi-core systems", "dram", "memory controller" ]

[ "dram", "memory controller", "multi core", "multi-core systems", "core systems" ]

[ "multi-core systems", "memory controller", "dram", "core systems", "multi core" ]

[ "multi-core processor", "parallel programming", "embedded systems", "memory architecture", "memory access", "dynamic random access storage", "program processors", "parallel algorithms", "parallel architectures", "computer programming languages", "computer systems", "field programmable gate array", "cache memory", "microprocessor chips", "parallel processing systems", "computer programming", "computer science", "computer hardware", "distributed systems", "distributed computer systems" ]

749

This paper studies the capacity of discrete-time multipath fading channels. It is assumed that the number of paths is finite, i.e., that the channel output is influenced by the present and by the L previous channel inputs. A noncoherent channel model is considered where neither transmitter nor receiver are cognizant of the fading's realization, but both are aware of its statistic. The focus is on capacity at high signal-to-noise ratios (SNR). In particular, the capacity pre-loglog-defined as the limiting ratio of the capacity to loglog(SNR) as SNR tends to infinity-is studied. It is shown that, irrespective of the number of paths L, the capacity pre-loglog is 1.

2022-09-02T18:13:37.897Z

{ "ACL": null, "DBLP": "journals/corr/abs-0901-0521", "ArXiv": "0901.0521", "MAG": "2570322603", "CorpusId": "749", "PubMed": null, "DOI": "10.1109/TIT.2010.2080995", "PubMedCentral": null }

https://www.semanticscholar.org/paper/288a903c6b10057f473ac7b926094713a2a99e10

On multipath fading channels at high SNR

[ { "authorId": "145149501", "name": "T. Koch" }, { "authorId": "2240286", "name": "A. Lapidoth" } ]

2008 IEEE International Symposium on Information Theory

2,008

15

21

1

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Mathematics", "source": "external" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2008-01-04T00:00:00

{ "name": "2008 IEEE International Symposium on Information Theory", "volume": null, "pages": "1572-1576" }

[ "transmitters", "signal to noise ratio", "multipath fading channels", "discrete-time", "correlation analysis", "channel model", "high snr", "high signal-to-noise ratio", "snr" ]

[ "signal to noise ratio", "snr", "discrete-time", "channel model", "transmitters", "correlation analysis", "noise ratios", "multipath propagation", "radio channels" ]

[ "transmitters", "signal to noise ratio", "multipath fading channels", "discrete-time", "correlation analysis", "noise ratios", "channel model", "multipath propagation", "radio channels", "high snr", "high signal-to-noise ratio", "snr" ]

[ "signal receivers", "antennas", "signal processing", "multipath fading", "rayleigh fading", "discrete time control systems", "mathematics", "acoustic intensity", "fading channels", "channel capacity", "mimo systems", "fading (radio)", "code division multiple access", "radio transmission", "communication channels", "signal detection", "wireless telecommunication systems", "engineering", "nonlinear control systems", "linear matrix inequalities", "information theory", "bit error rate", "computer networks", "communication systems", "telecommunication systems", "adaptive control systems", "feedback systems", "control theory", "matrix algebra", "communication", "probability", "computer science", "computer systems", "process control", "automation" ]

750

The recognition, involvement, and description of main actors influences the story line of the whole text. This is of higher importance as the text per se represents a flow of words and expressions that once it is read it is lost. In this respect, the understanding of a text and moreover on how the actor exactly behaves is not only a major concern: as human beings try to store a given input on short-term memory while associating diverse aspects and actors with incidents, the following approach represents a virtual architecture, where collocations are concerned and taken as the associative completion of the actors' acting. Once that collocations are discovered, they become managed in separated memory blocks broken down by the actors. As for human beings, the memory blocks refer to associative mind-maps. We then present several priority functions to represent the actual temporal situation inside a mind-map to enable the user to reconstruct the recent events from the discovered temporal results.

2022-06-20T10:47:57.808Z

{ "ACL": null, "DBLP": "journals/corr/abs-0803-2856", "ArXiv": "0803.2856", "MAG": "1764777819", "CorpusId": "750", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/3c286bc076d68216f5f9ba3d5463fbaf8f4098ac

Figuring out Actors in Text Streams: Using Collocations to establish Incremental Mind-maps

[ { "authorId": "2193483", "name": "T. Rothenberger" }, { "authorId": "2068994409", "name": "S. Oez" }, { "authorId": "47816060", "name": "E. Tahirovic" }, { "authorId": "2977286", "name": "Christoph Schommer" } ]

ArXiv

2,008

6

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2008-03-19T00:00:00

{ "name": "ArXiv", "volume": "abs/0803.2856", "pages": null }

[]

[ "random access memory", "data stream", "virtual spaces", "architecture designs", "text document" ]

[ "random access memory", "virtual spaces", "architecture designs", "data stream", "text document" ]

[ "random access storage", "virtual reality", "software architecture", "data mining", "data communication systems", "database systems", "text mining", "information retrieval systems", "parallel processing systems", "microprocessor chips", "human computer interaction", "software design", "computer science", "computer systems", "text processing", "information retrieval", "distributed systems", "computer hardware", "software engineering", "natural language processing", "computational linguistics", "distributed computer systems", "artificial intelligence", "natural languages", "linguistics", "semantics" ]

751

The paper concerns the understanding of plurals in the framework of Artificial Intelligence and emphasizes the role of time. The construction of collection(s) and their evolution across time is often crucial and has to be accounted for. The paper contrasts a "de dicto" collection where the collection can be considered as persisting over these situations even if its members change with a "de re" collection whose composition does not vary through time. It expresses different criteria of choice between the two interpretations (de re and de dicto) depending on the context of enunciation.

2022-06-20T12:25:50.805Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0609044", "ArXiv": "cs/0609044", "MAG": "1629949092", "CorpusId": "751", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/ee912d5bebb6f846e99eeecdb98ae6d491fc89fc

The role of time in considering collections

[ { "authorId": "2071743103", "name": "Françoise Gayral" }, { "authorId": "34936664", "name": "D. Kayser" }, { "authorId": "2056455078", "name": "F. Lévy" } ]

ArXiv

2,006

8

0

false

[ { "category": "Education", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2006-09-08T00:00:00

{ "name": "ArXiv", "volume": "abs/cs/0609044", "pages": null }

[ "artificial intelligence" ]

[ "artificial intelligence", "digital collections", "software frameworks", "formal framework", "intelligent systems" ]

[ "formal framework", "artificial intelligence", "intelligent systems", "digital collections", "software frameworks" ]

[ "formal methods", "computer science", "computer systems", "digital libraries", "computer programming", "formal logic", "world wide web", "database systems", "user interfaces", "internet", "human computer interaction" ]

754

We prove the unconditional security of the standard six-state scheme for quantum key distribution (QKD). We demonstrate its unconditional security up to a bit error rate of 12.7 percents, by allowing only one-way classical communications in the error correction/privacy amplification procedure between Alice and Bob. This shows a clear advantage of the six-state scheme over another standard scheme--BB84, which has been proven to be secure up to only about 11 percents, if only one-way classical communications are allowed. Our proof technique is a generalization of that of Shor-Preskill's proof of security of BB84. We show that a advantage of the six-state scheme lies in the Alice and Bob's ability to establish rigorously from their test sample the non-trivial mutual information between the bit-flip and phase error patterns. A modified version of the degenerate quantum codes studied by DiVincenzo, Shor and Smolin is employed in our proof.

2022-09-04T20:57:38.899Z

{ "ACL": null, "DBLP": "journals/qic/Lo01a", "ArXiv": "quant-ph/0102138", "MAG": "2949195674", "CorpusId": "754", "PubMed": null, "DOI": "10.26421/QIC1.2-4", "PubMedCentral": null }

https://www.semanticscholar.org/paper/6f5b6ff315515d440988e69ddc0c2cfbfe723821

Proof of unconditional security of six-state quantum key distribution scheme

[ { "authorId": "145239721", "name": "H. Lo" } ]

Quantum Inf. Comput.

2,001

27

99

4

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" }, { "category": "Physics", "source": "external" }, { "category": "Mathematics", "source": "external" } ]

[ "JournalArticle" ]

2001-02-27T00:00:00

{ "name": "Quantum Inf. Comput.", "volume": "1", "pages": "81-94" }

[ "bit error rate", "privacy", "key distribution schemes", "key distribution", "test samples", "mutual informations", "communication" ]

[ "information-theoretic security", "key distribution", "bit error rate", "communication", "privacy", "mutual informations" ]

[ "bit error rate", "privacy", "information-theoretic security", "key distribution schemes", "key distribution", "test samples", "mutual informations", "communication" ]

[ "communication channels", "signal to noise ratio", "probability", "computer security", "security of data", "cryptography", "information theory", "key management", "multicasts", "machine learning", "wireless telecommunication systems", "signal processing", "mathematics", "computer science", "cryptology", "sensor networks", "wireless sensor networks", "access control", "public key cryptography", "telecommunication networks", "bandwidth", "data communication systems", "artificial intelligence", "computer networks", "communication systems", "telecommunication systems", "engineering", "routers", "routing algorithms", "embedded systems", "sensors", "wireless communications", "energy utilization", "sensor nodes", "authentication", "network security", "computer systems", "telecommunication traffic", "computer hardware", "electricity" ]

755

The distribution of unicyclic components in a random graph is obtained analytically. The number of unicyclic components of a given size approaches a self-similar form in the vicinity of the gelation transition. At the gelation point, this distribution decays algebraically, Uk (4k)?1 for k 1. As a result, the total number of unicyclic components grows logarithmically with the system size.

2022-09-05T02:32:37.709Z

{ "ACL": null, "DBLP": "journals/corr/cond-mat-0403453", "ArXiv": "cond-mat/0403453", "MAG": "3010282759", "CorpusId": "755", "PubMed": null, "DOI": "10.1088/0305-4470/37/18/L01", "PubMedCentral": null }

https://www.semanticscholar.org/paper/f4d6be3c181d7bea2559d87b22f26c1704c3ce4b

Unicyclic Components in Random Graphs

[ { "authorId": "1389768159", "name": "E. Ben-Naim" }, { "authorId": "1699146", "name": "P. Krapivsky" } ]

ArXiv

2,004

49

10

0

true

[ { "category": "Mathematics", "source": "s2-fos-model" }, { "category": "Physics", "source": "external" }, { "category": "Computer Science", "source": "external" }, { "category": "Mathematics", "source": "external" } ]

[ "JournalArticle" ]

2004-03-17T00:00:00

{ "name": "ArXiv", "volume": "cond-mat/0403453", "pages": null }

[ "random graphs" ]

[ "random graphs", "software component", "directed graphs", "weighted graph", "real-world networks" ]

[ "weighted graph", "software component", "random graphs", "real-world networks", "directed graphs" ]

[ "graphic methods", "software", "graph theory", "random processes", "complex networks", "social networks", "computer science", "theoretical computer science", "probability", "topology", "world wide web", "mathematics", "internet" ]

756

Type classes are an elegant extension to traditional, Hindley-Milner based typing systems. They are used in modern, typed languages such as Haskell to support controlled overloading of symbols. Haskell 98 supports only single-parameter and constructor type classes. Other extensions such as multi-parameter type classes are highly desired but are still not officially supported by Haskell. Subtle issues arise with extensions, which may lead to a loss of feasible type inference or ambiguous programs. A proper logical basis for type class systems seems to be missing. Such a basis would allow extensions to be characterised and studied rigorously. We propose to employ Constraint Handling Rules as a tool to study and develop type class systems in a uniform way.

2022-08-31T18:55:48.014Z

{ "ACL": null, "DBLP": "journals/corr/cs-PL-0006034", "ArXiv": "cs/0006034", "MAG": "1850217788", "CorpusId": "756", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/4a1c780f742761e4cfa54436e05a3ca1efa722ae

Type Classes and Constraint Handling Rules

[ { "authorId": "2102121027", "name": "Kevin Glynn" }, { "authorId": "1736755", "name": "M. Sulzmann" }, { "authorId": "1682747", "name": "Peter James Stuckey" } ]

ArXiv

2,000

15

19

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2000-06-25T00:00:00

{ "name": "ArXiv", "volume": "cs.PL/0006034", "pages": null }

[ "haskell", "constraint handling", "type inferences", "type class" ]

[ "type class", "constraint handling", "haskell", "type inferences", "inference" ]

[ "type class", "haskell", "constraint handling", "type inferences", "inference" ]

[ "functional programming", "multi-objective optimisation", "constrained optimization", "type systems", "inference engines", "computer programming languages", "evolutionary algorithms", "optimization problems", "object oriented programming", "program compilers", "linguistics", "artificial intelligence", "computer programming", "genetic algorithms", "correlation analysis", "parallel processing systems", "computer science", "mathematics", "distributed systems", "distributed computer systems", "computer systems" ]

757

Engineering a Web search engine offering effective and efficient information retrieval is a challenging task. This document presents our experiences from designing and developing a Web search engine offering a wide spectrum of functionalities and we report some interesting experimental results. A rather peculiar design choice of the engine is that its index is based on a DBMS, while some of the distinctive functionalities that are offered include advanced Greek language stemming, real time result clustering, and advanced link analysis techniques (also for spam page detection).

2022-06-20T12:35:18.297Z

{ "ACL": null, "DBLP": "journals/corr/abs-0803-2220", "ArXiv": "0803.2220", "MAG": "1849632780", "CorpusId": "757", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/527abdb05fe656a1f8b84f64e24362d3893cfcd6

The Anatomy of Mitos Web Search Engine

[ { "authorId": "2998829", "name": "P. Papadakos" }, { "authorId": "2193550", "name": "G. Vasiliadis" }, { "authorId": "2228792", "name": "Yannis Theoharis" }, { "authorId": "2020421", "name": "Nikos Armenatzoglou" }, { "authorId": "2979458", "name": "S. Kopidaki" }, { "authorId": "3046488", "name": "Yannis Marketakis" }, { "authorId": "35245518", "name": "Manos Daskalakis" }, { "authorId": "2912314", "name": "Kostas Karamaroudis" }, { "authorId": "3019426", "name": "Giorgos Linardakis" }, { "authorId": "1969637", "name": "Giannis Makrydakis" }, { "authorId": "39577770", "name": "V. Papathanasiou" }, { "authorId": "2640625", "name": "Lefteris Sardis" }, { "authorId": "3113009", "name": "Petros Tsialiamanis" }, { "authorId": "2279222", "name": "Georgia Troullinou" }, { "authorId": "3143995", "name": "K. Vandikas" }, { "authorId": "2862125", "name": "D. Velegrakis" }, { "authorId": "1801959", "name": "Yannis Tzitzikas" } ]

ArXiv

2,008

16

9

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2008-03-14T00:00:00

{ "name": "ArXiv", "volume": "abs/0803.2220", "pages": null }

[ "spam", "web search engines", "engineering", "link analysis", "clustering algorithms", "information retrieval", "engine" ]

[ "web searches", "web search engines", "search engines", "engine", "information retrieval", "link analysis", "spam" ]

[ "spam", "web search engines", "engineering", "search engines", "link analysis", "web searches", "clustering algorithms", "information retrieval", "engine" ]

[ "electronic mail", "world wide web", "data mining", "hypertext systems", "graph theory", "online searching", "computer science", "internet", "theoretical computer science", "query languages", "information retrieval systems", "user interfaces", "online systems", "database systems", "human computer interaction", "computer systems" ]

760

By replacing linear averaging in Shannon entropy with Kolmogorov-Nagumo average (KN-averages) or quasilinear mean and further imposing the additivity constraint, R\'{e}nyi proposed the first formal generalization of Shannon entropy. Using this recipe of R\'{e}nyi, one can prepare only two information measures: Shannon and R\'{e}nyi entropy. Indeed, using this formalism R\'{e}nyi characterized these additive entropies in terms of axioms of quasilinear mean. As additivity is a characteristic property of Shannon entropy, pseudo-additivity of the form $x \oplus_{q} y = x + y + (1-q)x y$ is a characteristic property of nonextensive (or Tsallis) entropy. One can apply R\'{e}nyi's recipe in the nonextensive case by replacing the linear averaging in Tsallis entropy with KN-averages and thereby imposing the constraint of pseudo-additivity. In this paper we show that nonextensive entropy is unique under the R\'{e}nyi's recipe, and there by give a characterization.

2022-07-13T18:51:34.961Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0511078", "ArXiv": "cs/0511078", "MAG": "1647238455", "CorpusId": "760", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/d97395d4f9e74db4c94f844dd53162bec00d1231

Uniqueness of Nonextensive entropy under Renyi's Recipe

[ { "authorId": "2440174", "name": "Ambedkar Dukkipati" }, { "authorId": "145277401", "name": "M. N. Murty" }, { "authorId": "143683893", "name": "S. Bhatnagar" } ]

ArXiv

2,005

41

3

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Mathematics", "source": "external" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2005-11-21T00:00:00

{ "name": "ArXiv", "volume": "abs/cs/0511078", "pages": null }

[]

[ "information theory", "formal specification", "formal model", "formal semantics", "formal logic" ]

[ "formal logic", "formal specification", "formal semantics", "information theory", "formal model" ]

[ "artificial intelligence", "formal methods", "real time systems", "software engineering", "formal languages", "computer hardware description languages", "computer programming languages", "communication", "model checking", "petri nets", "computer science", "knowledge based systems", "object oriented programming", "mobile robots", "field programmable gate array", "embedded systems", "online systems", "digital signal processing", "linguistics", "formal languages and automata theory", "computer programming", "architecture verification and validation", "graph theory", "robotics", "computer hardware", "computer systems", "signal processing", "theoretical computer science", "architecting", "engineering", "software architecture", "software design" ]

761

In order to obtain resource efficient implementations of control loops on embedded platforms, recently there has been a renewed interest in studying stability and various other quality-of-control (QoC) metrics in the presence of control message drops. Towards this, different methods have been proposed to quantify the impact of message drops on stability and control performance. In this paper we will survey these techniques and clarify the relationship between them. Given a drop pattern that satisfies stability and specified QoC constraints, it is important to check whether an implementation platform satisfies this pattern. In other words, whether the control loop in question may be implemented on this platform. Given an architecture, we will also show how certain notions of expressing drop patterns are easier to verify compared to others.

2022-08-27T23:10:54.519Z

{ "ACL": null, "DBLP": "conf/cacsd/GoswamiCBM13", "ArXiv": null, "MAG": "2082032862", "CorpusId": "761", "PubMed": null, "DOI": "10.1109/CACSD.2013.6663475", "PubMedCentral": null }

https://www.semanticscholar.org/paper/cf64699d2a30d5f550232047a5237deac0862120

Characterizing feedback signal drop patterns in formal verification of networked control systems

[ { "authorId": "2732486", "name": "Dip Goswami" }, { "authorId": "144637469", "name": "S. Chakraborty" }, { "authorId": "1755846", "name": "Purandar Bhaduri" }, { "authorId": "1689724", "name": "S. Mitter" } ]

2013 IEEE Conference on Computer Aided Control System Design (CACSD)

2,013

28

4

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle", "Conference", "Review" ]

2013-11-14T00:00:00

{ "name": "2013 IEEE Conference on Computer Aided Control System Design (CACSD)", "volume": null, "pages": "13-18" }

[ "control loop", "embedded platforms", "networked control systems", "formal verifications" ]

[ "formal verifications", "verification", "networked controls", "networked control systems", "control systems", "control loop" ]

[ "verification", "control systems", "networked controls", "control loop", "embedded platforms", "networked control systems", "formal verifications" ]

[ "verification and validation", "computer systems", "remote control", "embedded software", "control system analysis", "linear matrix inequalities", "software quality", "computer science", "robots", "embedded systems", "adaptive control systems", "matrix algebra", "software design", "robotics", "process control", "mathematics", "software engineering", "automation", "engineering" ]

764

We model the performance of an ideal closed chain of L processing elements that work in parallel in an asynchronous manner. Their state updates follow a generic conservative algorithm. The conservative update rule determines the growth of a virtual time surface. The physics of this growth is reflected in the utilization (the fraction of working processors) and in the interface width. We show that it is possible to make an explicit connection between the utilization and the microscopic structure of the virtual time interface. We exploit this connection to derive the theoretical probability distribution of updates in the system within an approximate model. It follows that the theoretical lower bound for the computational speedup is s=(L+1)/4 for L> or =4. Our approach uses simple statistics to count distinct surface-configuration classes consistent with the model growth rule. It enables one to compute analytically microscopic properties of an interface, which are unavailable by continuum methods.

2022-08-31T07:54:47.674Z

{ "ACL": null, "DBLP": "journals/corr/cond-mat-0306222", "ArXiv": "cond-mat/0306222", "MAG": "1553685464", "CorpusId": "764", "PubMed": "14683077", "DOI": "10.1103/PhysRevE.68.046705", "PubMedCentral": null }

https://www.semanticscholar.org/paper/13268ec7d39e2bc6bf75b03ea8ff67b94bab87bb

Update statistics in conservative parallel discrete event simulations of asynchronous systems

[ { "authorId": "40008004", "name": "A. Kolakowska" }, { "authorId": "144124775", "name": "M. Novotny" }, { "authorId": "1808967", "name": "P. Rikvold" } ]

Physical review. E, Statistical, nonlinear, and soft matter physics

2,003

54

7

0

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" }, { "category": "Medicine", "source": "external" }, { "category": "Mathematics", "source": "external" }, { "category": "Physics", "source": "external" } ]

[ "JournalArticle" ]

2003-06-09T00:00:00

{ "name": "Physical review. E, Statistical, nonlinear, and soft matter physics", "volume": "68 4 Pt 2", "pages": "\n 046705\n " }

[ "asynchronous system", "processing elements", "probability distributions", "correlation analysis" ]

[ "correlation analysis", "asynchronous system", "processing elements", "probability", "probability distributions" ]

[ "correlation analysis", "probability distributions", "processing elements", "probability", "asynchronous system" ]

[ "mathematics", "field programmable gate array", "multiprocessing systems", "program processors", "embedded systems", "fault tolerant computer systems", "computer hardware", "parallel processing systems", "microprocessor chips", "computer systems", "computer networks", "distributed computer systems", "computer science", "distributed systems" ]

765

Transmitter precoding strategies in broadcast systems generally assume perfect knowledge of channel state information (CSI) at the transmitter. In this paper, we study linear precoding with arbitrary error in the CSI from an estimation theoretic point of view. We derive a Bayesian Cramér-Rao type bound on the sum mean squared error (SMSE) achievable at the receiver for any linear precoding scheme for arbitrary feedback noise and channel fading. We next specialize this result to power constrained precoders. It is shown that the regularity conditions of the bound may be significantly weakened for power constrained precoders. Interestingly, we obtain a bound whose validity depends on rather weak conditions of continuity and differentiability on the joint distribution of the channel and feedback. We demonstrate the bound by applying it to Gaussian, Nakagami-m and Weibull fading models, with the assumption of feedback corrupted by additive Gaussian noise.

2022-09-04T05:58:39.907Z

{ "ACL": null, "DBLP": "conf/isit/HousfaterL09a", "ArXiv": null, "MAG": "2166552116", "CorpusId": "765", "PubMed": null, "DOI": "10.1109/ISIT.2009.5205768", "PubMedCentral": null }

https://www.semanticscholar.org/paper/0c217ba0d00252237ac265a7180ded55d4c063ce

Noisy feedback linear precoding: A Bayesian Cramér-Rao bound

[ { "authorId": "2199923", "name": "A. S. Housfater" }, { "authorId": "1845966", "name": "Teng Joon Lim" } ]

2009 IEEE International Symposium on Information Theory

2,009

17

3

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Mathematics", "source": "external" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2009-06-28T00:00:00

{ "name": "2009 IEEE International Symposium on Information Theory", "volume": null, "pages": "1689-1693" }

[ "transmitters", "precoding", "broadcast", "csi", "bayesian methods", "weibull", "precoding scheme", "additive gaussian noise", "linear pre-coding", "precoders", "gaussians", "nakagami-m", "channel state information", "mean square error" ]

[ "additive noise", "linear pre-coding", "precoding", "precoders", "precoding scheme", "bayesian methods", "transmitters", "broadcast", "channel state", "channel state information", "csi", "gaussian noise (electronic)", "gaussians", "weibull", "additive gaussian noise" ]

[ "transmitters", "precoding", "broadcast", "gaussian noise (electronic)", "csi", "additive noise", "bayesian methods", "weibull", "channel state", "precoding scheme", "additive gaussian noise", "linear pre-coding", "precoders", "gaussians", "nakagami-m", "channel state information", "mean square error" ]

[ "signal receivers", "antennas", "multiplexing", "mimo systems", "ad hoc networks", "broadcasting", "signal to noise ratio", "spurious signal noise", "white noise", "artificial intelligence", "weibull distribution", "wireless networks", "state feedback", "channel estimation", "zero-forcing", "mimo channel", "multiple-input-multiple-output", "gaussian distribution", "probability density function", "nakagami-m fading", "closed-form expression", "fading (radio)", "rayleigh fading", "channel capacity", "communication channels", "signal detection", "wireless telecommunication systems", "routers", "mobile telecommunication systems", "internet protocols", "quality of service", "wireless local area networks (wlan)", "multicasts", "routing algorithms", "sensors", "signal processing", "computer science", "wireless communications", "packet networks", "feedback control", "linear matrix inequalities", "mimo", "beamforming", "mim devices", "fading channels", "matrix algebra", "probability", "bit error rate", "information theory", "computer networks", "communication systems", "telecommunication systems", "telecommunication traffic", "bandwidth", "telecommunication networks", "local area networks", "data communication systems", "computer hardware", "engineering", "feedback systems", "orthogonal frequency division multiplexing", "mathematics", "communication", "computer systems" ]

766

In this paper we consider the problem of proving properties of infinite behaviour of formalisms suitable to describe (infinite state) systems with recursion and parallelism. As a formal setting, we consider the framework of Process Rewriting Systems (PRSs). For a meaningfull fragment of PRSs, allowing to accommodate both Pushdown Automata and Petri Nets, we state decidability results for a class of properties about infinite derivations (infinite term rewritings). The given results can be exploited for the automatic verification of some classes of linear time properties of infinite state systems described by PRSs. In order to exemplify the assessed results, we introduce a meaningful automaton based formalism which allows to express both recursion and multi–treading.

2022-08-31T20:49:28.873Z

{ "ACL": null, "DBLP": "journals/corr/cs-OH-0312019", "ArXiv": "cs/0312019", "MAG": "1671522350", "CorpusId": "766", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/b6540c3fb4db6e3892cc8ce257e201ba0b1da699

Verification of recursive parallel systems

[ { "authorId": "1768021", "name": "L. Bozzelli" }, { "authorId": "1707530", "name": "M. Benerecetti" }, { "authorId": "145917338", "name": "A. Peron" } ]

ArXiv

2,003

24

2

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" }, { "category": "Mathematics", "source": "external" } ]

[ "JournalArticle" ]

2003-12-11T00:00:00

{ "name": "ArXiv", "volume": "cs.OH/0312019", "pages": null }

[ "verification", "automation", "petri nets", "infinite state systems", "automatic verification", "push-down automata", "parallelism" ]

[ "verification", "automatic verification", "parallelism", "push-down automata", "automata", "automation", "petri nets", "infinite state systems" ]

[ "verification", "automation", "petri nets", "infinite state systems", "automatic verification", "push-down automata", "parallelism", "automata" ]

[ "verification and validation", "engineering", "graph theory", "model checking", "formal methods", "translation (languages)", "finite automata", "parallel programming", "formal languages", "software quality", "theoretical computer science", "embedded systems", "architecture verification and validation", "formal logic", "computational linguistics", "automata theory", "linguistics", "program processors", "parallel algorithms", "parallel architectures", "computer programming languages", "formal languages and automata theory", "software design", "computer science", "computer systems", "architecting", "artificial intelligence", "database systems", "parallel processing systems", "microprocessor chips", "computer programming", "software engineering", "software architecture", "distributed systems", "computer hardware", "distributed computer systems" ]

767

We consider linear systems arising from the use of the finite element method for solving a certain class of linear elliptic problems. Our main result is that these linear systems, which are symmetric and positive semidefinite, are well approximated by symmetric diagonally dominant matrices. Our framework for defining matrix approximation is support theory. Significant graph theoretic work has already been developed in the support framework for preconditioners in the diagonally dominant case, and in particular it is known that such systems can be solved with iterative methods in nearly linear time. Thus, our approximation result implies that these graph theoretic techniques can also solve a class of finite element problems in nearly linear time. We show that the quality of our approximation, which controls the number of iterations in the preconditioned iterative solver, depends primarily on a mesh quality measure but not on the problem size or shape of the domain.

2022-09-04T22:42:14.434Z

{ "ACL": null, "DBLP": "journals/corr/cs-NA-0407022", "ArXiv": "cs/0407022", "MAG": "2952346244", "CorpusId": "767", "PubMed": null, "DOI": "10.1137/040611781", "PubMedCentral": null }

https://www.semanticscholar.org/paper/76e78833f44e169d6abb1ce1e32eead19c46a5c6

Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners

[ { "authorId": "1688257", "name": "E. Boman" }, { "authorId": "143660088", "name": "B. Hendrickson" }, { "authorId": "1692336", "name": "S. Vavasis" } ]

SIAM J. Numer. Anal.

2,004

33

86

2

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Mathematics", "source": "s2-fos-model" }, { "category": "Mathematics", "source": "external" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2004-07-09T00:00:00

{ "name": "SIAM J. Numer. Anal.", "volume": "46", "pages": "3264-3284" }

[ "iterative solvers", "preconditioners", "finite element method", "linear systems" ]

[ "finite element method", "preconditioners", "linear systems", "iterative solvers", "finite element analysis" ]

[ "preconditioners", "finite element analysis", "linear systems", "finite element method", "iterative solvers" ]

[ "numerical methods", "matrix algebra", "mathematics" ]

768

An elastic ideal 2D propagation medium, i.e., a membrane, can be simulated by models discretizing the wave equation on the time-space grid (finite difference methods), or locally discretizing the solution of the wave equation (waveguide meshes). The two approaches provide equivalent computational structures, and introduce numerical dispersion that induces a misalignment of the modes from their theoretical positions. Prior literature shows that dispersion can be arbitrarily reduced by oversizing and oversampling the mesh, or by adpting offline warping techniques. In this paper we propose to reduce numerical dispersion by embedding warping elements, i.e., properly tuned allpass filters, in the structure. The resulting model exhibits a significant reduction in dispersion, and requires less computational resources than a regular mesh structure having comparable accuracy.

2022-09-04T22:07:07.443Z

{ "ACL": null, "DBLP": "conf/icmc/FontanaR00", "ArXiv": "cs/0006026", "MAG": "1877740722", "CorpusId": "768", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/b5bc4f9af16cb1ad6c9736dbda0a5e852d6d0a5d

Online Correction of Dispersion Error in 2D Waveguide Meshes

[ { "authorId": "50512587", "name": "F. Fontana" }, { "authorId": "1948301", "name": "D. Rocchesso" } ]

ICMC

2,000

15

9

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Mathematics", "source": "external" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2000-06-11T00:00:00

{ "name": "ArXiv", "volume": "cs.SD/0006026", "pages": null }

[ "computational resources", "wave equations", "finite difference method" ]

[ "ring resonator", "wave equations", "finite difference method", "computational resources", "boundary value problems", "grid node" ]

[ "wave equations", "boundary value problems", "grid node", "computational resources", "finite difference method", "ring resonator" ]

[ "nonlinear equations", "approximation theory", "numerical methods", "grid environments", "grid computing", "time domain analysis", "optical resonators", "differential equations", "mathematics", "parallel processing systems", "signal processing", "optical materials", "distributed systems", "engineering", "optical fibers", "distributed computer systems", "sensors", "computer systems", "computer hardware", "computer science" ]

769

This paper describes a parallel database load prototype for Digital's Rdb database product. The prototype takes a dataflow approach to database parallelism. It includes an explorer that discovers and records the cluster configuration in a database, a client CUI interface that gathers the load job description from the user and from the Rdb catalogs, and an optimizer that picks the best parallel execution plan and records it in a web data structure. The web describes the data operators, the dataflow rivers among them, the binding of operators to processes, processes to processors, and files to discs and tapes. This paper describes the optimizer's cost-based hierarchical optimization strategy in some detail. The prototype executes the web's plan by spawning a web manager process at each node of the cluster. The managers create the local executor processes, and orchestrate startup, phasing, checkpoint, and shutdown. The execution processes perform one or more operators. Data flows among the operators are via memory-to-memory streams within a node, and via web-manager multiplexed tcp/ip streams among nodes. The design of the transaction and checkpoint/restart mechanisms are also described. Preliminary measurements indicate that this design will give excellent scaleups.

2022-09-04T23:27:32.756Z

{ "ACL": null, "DBLP": "journals/sigmod/BarclayBGS94", "ArXiv": null, "MAG": "2073582740", "CorpusId": "769", "PubMed": null, "DOI": "10.1145/190627.190647", "PubMedCentral": null }

https://www.semanticscholar.org/paper/5a9402aba335ec736f034e4efa3a6ce0d4828809

Loading databases using dataflow parallelism

[ { "authorId": "2061457055", "name": "Tom Barclay" }, { "authorId": "2056119443", "name": "R. Barnes" }, { "authorId": "39941882", "name": "J. Gray" }, { "authorId": "2094707792", "name": "Prakash Sundaresan" } ]

SGMD

1,994

23

45

1

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

1994-12-01T00:00:00

{ "name": "SIGMOD Rec.", "volume": "23", "pages": "72-83" }

[ "parallelism", "tcp", "optimization", "database systems", "parallel executions" ]

[ "parallelism", "database systems", "parallel executions", "optimization", "relational database" ]

[ "parallelism", "tcp", "optimization", "relational database", "database systems", "parallel executions" ]

[ "parallel programming", "congestion control (communication)", "wireless telecommunication systems", "network protocols", "mathematics", "query languages", "knowledge based systems", "computer systems", "parallelizations", "program processors", "parallel algorithms", "parallel architectures", "computer programming languages", "computer networks", "communication systems", "telecommunication systems", "internet", "artificial intelligence", "computer science", "parallel processing systems", "microprocessor chips", "computer programming", "distributed systems", "computer hardware", "distributed computer systems" ]

772

This paper shows how the steady-state availability and failure frequency can be calculated in a single pass for very large systems, when the availability is expressed as a product of matrices. We apply the general procedure to $k$-out-of-$n$:G and linear consecutive $k$-out-of-$n$:F systems, and to a simple ladder network in which each edge and node may fail. We also give the associated generating functions when the components have identical availabilities and failure rates. For large systems, the failure rate of the whole system is asymptotically proportional to its size. This paves the way to ready-to-use formulae for various architectures, as well as proof that the differential operator approach to failure frequency calculations is very useful and straightforward.

2022-09-03T07:03:42.575Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0612141", "ArXiv": "cs/0612141", "MAG": "1514575450", "CorpusId": "772", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/f9ae117a1118715d683c98de551972454d24a3ce

Exact Failure Frequency Calculations for Extended Systems

[ { "authorId": "2078573703", "name": "Annie Druault-Vicard" }, { "authorId": "2155377", "name": "C. Tanguy" } ]

ArXiv

2,006

31

5

0

false

[ { "category": "Mathematics", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2006-12-28T00:00:00

{ "name": "ArXiv", "volume": "abs/cs/0612141", "pages": null }

[ "ladder networks", "differential operators" ]

[ "node failure", "network architecture", "frequencies", "output frequency", "numerical integrations" ]

[ "network architecture", "node failure", "output frequency", "differential operators", "frequencies", "numerical integrations", "ladder networks" ]

[ "computer networks", "sensor networks", "wireless sensor networks", "fault tolerance", "variable frequency oscillators", "differential equations", "bandwidth", "numerical methods", "insulating materials", "education", "computer science", "routers", "wireless telecommunication systems", "routing algorithms", "embedded systems", "sensors", "wireless communications", "energy utilization", "sensor nodes", "software quality", "fault tolerant computer systems", "spurious signal noise", "mathematics", "multimedia services", "telecommunication equipment", "telecommunication traffic", "communication systems", "telecommunication systems", "computer systems", "computer hardware", "electricity", "software design", "distributed computer systems", "communication channels", "signal to noise ratio", "internet protocols", "multimedia systems", "telecommunication networks", "engineering", "software engineering", "signal processing", "internet" ]

773

Over the past thirty years, there has been considerable progress in the design of natural language interfaces to databases. Most of this work has concerned snapshot databases, in which there are only limited facilities for manipulating time-varying information. The database community is becoming increasingly interested in temporal databases, databases with special support for time-dependent entries. We have developed a framework for constructing natural language interfaces to temporal databases, drawing on research on temporal phenomena within logic and linguistics. The central part of our framework is a logic-like formal language, called TOP, which can capture the semantics of a wide range of English sentences. We have implemented an HPSG-based sentence analyser that converts a large set of English queries involving time into TOP formulae, and have formulated a provably correct procedure for translating TOP expressions into queries in the TSQL2 temporal database language. In this way we have established a sound route from English to a general-purpose temporal database language.

2022-06-20T16:20:45.651Z

{ "ACL": null, "DBLP": "journals/corr/cmp-lg-9611006", "ArXiv": "cmp-lg/9611006", "MAG": "1604291600", "CorpusId": "773", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/3f8967dfa6d57aa808398e6a478ea72c16f51d60

A Framework for Natural Language Interfaces to Temporal Databases

[ { "authorId": "1752430", "name": "Ion Androutsopoulos" }, { "authorId": "34739267", "name": "G. Ritchie" }, { "authorId": "1798843", "name": "P. Thanisch" } ]

ArXiv

1,996

36

2

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

1996-11-24T00:00:00

{ "name": "ArXiv", "volume": "cmp-lg/9611006", "pages": null }

[ "formal languages", "natural language interfaces", "linguistics", "english sentences", "temporal database", "semantics", "database systems" ]

[ "natural languages", "natural language interfaces", "temporal database", "database systems", "linguistics", "semantics", "general purpose" ]

[ "formal languages", "natural language interfaces", "natural languages", "linguistics", "english sentences", "temporal database", "semantics", "general purpose", "database systems" ]

[ "formal languages and automata theory", "machine translations", "relational database", "program processors", "computer systems", "theoretical computer science", "natural language processing", "translation (languages)", "information theory", "knowledge based systems", "query languages", "parallel processing systems", "microprocessor chips", "computer science", "artificial intelligence", "computational linguistics", "automata theory", "communication", "distributed systems", "computer hardware", "distributed computer systems" ]

774

Research into the automatic acquisition of lexical information from corpora is starting to produce large-scale computational lexicons containing data on the relative frequencies of subcategorisation alternatives for individual verbal predicates. However, the empirical question of whether this type of frequency information can in practice improve the accuracy of a statistical parser has not yet been answered. In this paper we describe an experiment with a wide-coverage statistical grammar and parser for English and subcategorisation frequencies acquired from ten million words of text which shows that this information can significantly improve parse accuracy.

2022-09-05T01:40:25.488Z

{ "ACL": "W98-1114", "DBLP": "journals/corr/cmp-lg-9806013", "ArXiv": "cmp-lg/9806013", "MAG": "2953046001", "CorpusId": "774", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/497c12316650452a676d602aa51619f9892323bf

Can Subcategorisation Probabilities Help a Statistical Parser

[ { "authorId": "144708726", "name": "John A. Carroll" }, { "authorId": "145702640", "name": "Guido Minnen" }, { "authorId": "145693410", "name": "Ted Briscoe" } ]

VLC@COLING/ACL

1,998

55

84

9

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

1998-06-01T00:00:00

{ "name": "ArXiv", "volume": "cmp-lg/9806013", "pages": null }

[ "frequencies" ]

[ "correlation analysis", "frequencies", "parsing algorithm", "syntactic structure", "parse trees" ]

[ "correlation analysis", "syntactic structure", "parsing algorithm", "frequencies", "parse trees" ]

[ "mathematics", "natural language processing", "syntactics", "computational linguistics", "formal languages", "bandwidth", "translation (languages)", "artificial intelligence", "natural languages", "database systems", "linguistics", "formal languages and automata theory", "computer networks", "automata theory", "computer science", "semantics", "computer systems", "theoretical computer science" ]

776

The optimal planning trajectory is analyzed on the basis of the growth model with effectiveness. The saving per capital value has to be rather high initially with smooth decrement in the future years.

2022-06-20T11:59:03.855Z

{ "ACL": null, "DBLP": "journals/corr/cs-CE-0110067", "ArXiv": "cs/0110067", "MAG": "1632913518", "CorpusId": "776", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/7a7aceb41be69cda104da6df0b333931b033cf62

Analysis of Investment Policy in Belarus

[ { "authorId": "2814900", "name": "F. S. Kilin" } ]

ArXiv

2,001

7

0

false

[ { "category": "Economics", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" }, { "category": "Mathematics", "source": "external" } ]

[ "JournalArticle" ]

2001-10-31T00:00:00

{ "name": "ArXiv", "volume": "cs.CE/0110067", "pages": null }

[ "investments", "capital" ]

[ "investments", "capital investment", "capital", "correlation analysis", "investment decisions" ]

[ "investments", "investment decisions", "correlation analysis", "capital", "capital investment" ]

[ "economics", "mathematics" ]

777

This paper extends Bennett's (1948) integral from scalar to vector quantizers, giving a simple formula that expresses the rth-power distortion of a many-point vector quantizer in terms of the number of points, point density function, inertial profile, and the distribution of the source. The inertial profile specifies the normalized moment of inertia of quantization cells as a function of location. The extension is formulated in terms of a sequence of quantizers whose point density and inertial profile approach known functions as the number of points increase. Precise conditions are given for the convergence of distortion (suitably normalized) to Bennett's integral. Previous extensions did not include the inertial profile and, consequently, provided only bounds or applied only to quantizers with congruent cells, such as lattice and optimal quantizers. The new version of Bennett's integral provides a framework for the analysis of suboptimal structured vector quantizers. It is shown how the loss in performance of such quantizers, relative to optimal unstructured ones, can be decomposed into point density and cell shape losses. As examples, these losses are computed for product quantizers and used to gain further understanding of the performance of scalar quantizers applied to stationary, memoryless sources and of transform codes applied to Gaussian sources with memory. It is shown that the short-coming of such quantizers is that they must compromise between point density and cell shapes. >

2022-09-04T22:55:53.371Z

{ "ACL": null, "DBLP": "journals/tit/NaN95", "ArXiv": null, "MAG": "2124670970", "CorpusId": "777", "PubMed": null, "DOI": "10.1109/18.391237", "PubMedCentral": null }

https://www.semanticscholar.org/paper/94fd005c36fb1d6c8cf771e1aec4dfd49a2c15bc

Bennett's integral for vector quantizers

[ { "authorId": "1815071", "name": "Sangsin Na" }, { "authorId": "1716704", "name": "D. Neuhoff" } ]

IEEE Trans. Inf. Theory

1,995

37

118

8

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Mathematics", "source": "external" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

1995-07-01T00:00:00

{ "name": "IEEE Trans. Inf. Theory", "volume": "41", "pages": "886-900" }

[ "point density", "quantization", "gaussian sources", "scalar quantizers", "quantizers", "memoryless", "vector quantizers" ]

[ "vector quantizers", "quantizers", "scalar quantizers", "quantization", "point density", "memoryless", "gaussians" ]

[ "point density", "quantization", "gaussian sources", "scalar quantizers", "quantizers", "memoryless", "gaussians", "vector quantizers" ]

[ "point cloud", "lidar data", "image compression", "signal processing", "programming theory", "electric distortion", "trellis codes", "channel coding", "data compression", "capacity regions", "gaussian distribution", "vector quantization", "3d data", "3d modelling", "3d scenes", "3d object", "3d objects", "optical radar", "image quality", "image coding", "engineering", "computer programming languages", "signal distortion", "phase shift keying", "block codes", "bit error rate", "fading channels", "channel capacity", "broadcast channels", "gaussian noise (electronic)", "three dimensional computer graphics", "radar", "image analysis", "image processing", "computer programming", "communication channels", "signal to noise ratio", "signal encoding", "fading (radio)", "information theory", "probability", "broadcasting", "mimo systems", "computer imaging and vision", "computer hardware", "computer science", "wireless telecommunication systems", "signal detection", "communication", "mathematics", "computer networks", "communication systems", "telecommunication systems", "computer systems" ]

778

In the widely used 802.11 standard, the so-called performance anomaly is a well-known issue. Several works have tried to solve this problem by introducing mechanisms such as packet fragmentation, backoff adaptation, or packet aggregation during a fixed time interval. In this paper, we propose a novel approach solving the performance anomaly problem by packet aggregation using a dynamic time interval, which depends on the busy time of the wireless medium. Our solution differs from other proposition in the literature because of this dynamic time interval, which allows increasing fairness, reactivity, and in some cases efficiency. In this article, we emphasize the performance evaluation of our proposal.

2022-09-04T23:26:43.960Z

{ "ACL": null, "DBLP": "conf/mswim/RazafindralamboLIF06", "ArXiv": "cs/0607097", "MAG": "2168725489", "CorpusId": "778", "PubMed": null, "DOI": "10.1145/1164717.1164761", "PubMedCentral": null }

https://www.semanticscholar.org/paper/780b20a6dc670220c798e925ded10f32724a4a1b

Dynamic packet aggregation to solve performance anomaly in 802.11 wireless networks

[ { "authorId": "2071467", "name": "T. Razafindralambo" }, { "authorId": "2076694", "name": "I. G. Lassous" }, { "authorId": "1749184", "name": "L. Iannone" }, { "authorId": "1742355", "name": "S. Fdida" } ]

MSWiM '06

2,006

14

35

1

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2006-07-20T00:00:00

{ "name": "ArXiv", "volume": "abs/cs/0607097", "pages": null }

[ "wireless networks", "back-off", "wireless" ]

[ "data packet", "wireless", "wireless networks", "back-off", "wireless communications" ]

[ "wireless communications", "wireless", "wireless networks", "data packet", "back-off" ]

[ "computer networks", "radio", "packet networks", "mobile ad hoc networks", "wireless sensor networks", "ieee 802.11s", "computer science", "wireless telecommunication systems", "telecommunication traffic", "ad hoc networks", "routing protocols", "energy utilization", "sensor nodes", "routing algorithms", "mesh network", "mac protocol", "qos", "communication systems", "telecommunication systems", "telecommunication networks", "routers", "mobile telecommunication systems", "internet protocols", "quality of service", "wireless local area networks (wlan)", "multicasts", "sensors", "electricity", "wireless mesh networks (wmn)", "medium access control", "computer systems", "bandwidth", "communication channels", "local area networks", "data communication systems", "computer hardware", "engineering", "network protocols", "internet" ]

779

We describe an automated partial evaluator for evolving algebras implemented at the University of Michigan.

2022-09-02T05:38:37.511Z

{ "ACL": null, "DBLP": "journals/corr/cs-SE-9810024", "ArXiv": "cs/9810024", "MAG": "2161042426", "CorpusId": "779", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/03647dc650b1f0460c9ced8ef3dab3ef0ac5c716

Evolving Algebras and Partial Evaluation

[ { "authorId": "1721396", "name": "Y. Gurevich" }, { "authorId": "7216701", "name": "J. Huggins" } ]

IFIP Congress

1,998

5

15

2

false

[ { "category": "Mathematics", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

1998-10-26T00:00:00

{ "name": null, "volume": null, "pages": "587-592" }

[ "university", "partial evaluation" ]

[ "partial evaluation", "university", "boolean algebra", "complete lattices", "functional programs" ]

[ "functional programs", "boolean algebra", "partial evaluation", "complete lattices", "university" ]

[ "functional programming", "formal logic", "boolean functions", "matrix algebra", "program interpreters", "concept lattices", "mathematical morphology", "education", "computer programming languages", "artificial intelligence", "mathematics", "logic programming", "object oriented programming", "program compilers", "linguistics", "fca", "data mining", "formal concept analysis (fca)", "image segmentation", "computer programming", "computer science", "parallel processing systems", "information analysis", "image analysis", "image processing", "distributed systems", "database systems", "information systems", "computer imaging and vision", "distributed computer systems", "computer systems" ]

781

Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., linear chains) in which search and parameter estimation can be performed exactly. Unfortunately, in many complex problems, it is rare that exact search or parameter estimation is tractable. Instead of learning exact models and searching via heuristic means, we embrace this difficulty and treat the structured output problem in terms of approximate search. We present a framework for learning as search optimization, and two parameter updates with convergence the-orems and bounds. Empirical evidence shows that our integrated approach to learning and decoding can outperform exact models at smaller computational cost.

2022-09-05T03:34:18.097Z

{ "ACL": null, "DBLP": "journals/corr/abs-0907-0809", "ArXiv": "0907.0809", "MAG": "2010624529", "CorpusId": "781", "PubMed": null, "DOI": "10.1145/1102351.1102373", "PubMedCentral": null }

https://www.semanticscholar.org/paper/a5c48c673b0d3152010e3374cac189314a13df10

Learning as search optimization: approximate large margin methods for structured prediction

[ { "authorId": "1722360", "name": "Hal Daumé" }, { "authorId": "1695463", "name": "D. Marcu" } ]

ICML

2,005

34

282

20

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" }, { "category": "Mathematics", "source": "external" } ]

[ "JournalArticle", "Book", "Conference" ]

2005-08-07T00:00:00

{ "name": "Proceedings of the 22nd international conference on Machine learning", "volume": null, "pages": null }

[ "optimization", "computational efficiency" ]

[ "optimization problems", "optimization", "graphical representations", "computational efficiency", "classification models" ]

[ "optimization", "classification models", "graphical representations", "computational efficiency", "optimization problems" ]

[ "mathematics", "classification methods", "graphic methods", "theoretical computer science", "correlation analysis", "computer systems", "graph theory", "computer science" ]

782

A simple multiuser detector (MUD) is proposed for channels affected by severe multipath and is then suitable for time-division duplexing code-division multiple-access (TDD-CDMA) receivers. For each user, after coherent combining and despreading, a suitable "Bayesian" memoryless nonlinearity gives symbol-by-symbol the expected values of the transmitted data. These are employed for soft removal of intersymbol and multiple-access interference (MAI) from the received sequences. The procedure is iterated in a multistage structure until final decisions are taken. From the comparison with other solutions, the proposed receiver exhibits better performance (close to the ideal canceller) and equal or minor complexity.

2022-08-24T12:32:16.415Z

{ "ACL": null, "DBLP": "journals/tvt/CusaniFM01", "ArXiv": null, "MAG": "2143616154", "CorpusId": "782", "PubMed": null, "DOI": "10.1109/25.938569", "PubMedCentral": null }

https://www.semanticscholar.org/paper/379a014644abefa941949efad1b6890143160f56

A simple Bayesian multistage interference canceller for multiuser detection in TDD-CDMA receivers

[ { "authorId": "144692786", "name": "R. Cusani" }, { "authorId": "2038428", "name": "M. D. Felice" }, { "authorId": "29850814", "name": "J. Mattila" } ]

IEEE Trans. Veh. Technol.

2,001

16

2

0

true

[ { "category": "Business", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2001-07-01T00:00:00

{ "name": "IEEE Trans. Veh. Technol.", "volume": "50", "pages": "920-924" }

[ "multiple access interference", "multiuser detection", "bayesian methods", "mai", "memoryless", "multi-user detectors" ]

[ "bayesian methods", "multiuser detection", "multi-user detectors", "tdd", "code division multiple access", "transmitters", "multiple access", "memoryless", "multiple access interference", "mai", "decision feedback equalizers", "multiuser system" ]

[ "transmitters", "multiple access interference", "multiuser detection", "decision feedback equalizers", "bayesian methods", "multiple access", "tdd", "mai", "memoryless", "code division multiple access", "multi-user detectors", "multiuser system" ]

[ "signal receivers", "antennas", "spread spectrum communication", "radio interference", "signal interference", "bit error rate", "data communication systems", "artificial intelligence", "wireless networks", "frequency division multiple access", "multiplexing", "fading channels", "time division multiplexing", "capacity regions", "gaussians", "communication channels", "beamforming", "mimo systems", "signal to noise ratio", "signal detection", "wireless telecommunication systems", "fading (radio)", "spurious signal noise", "probability", "computer systems", "computer science", "wireless communications", "packet networks", "frequency allocation", "wavelength division multiplexing", "frequency division multiplexing", "fiber optic networks", "broadcast channels", "channel capacity", "gaussian distribution", "signal processing", "computer networks", "communication systems", "telecommunication systems", "mathematics", "telecommunication traffic", "broadcasting", "information theory", "gaussian noise (electronic)", "engineering", "telecommunication networks", "communication" ]

783

This paper presents a hybrid approach to spatial indexing of two dimensional (2D) data. It sheds new light on the age old problem by thinking of the traditional algorithms as working with images. Inspiration is drawn from an analogous situation that is found in machine and human vision. Image processing techniques are used to assist in the spatial indexing of the data. A fixed grid approach is used and bins with too many records are sub-divided hierarchically. Search queries are pre-computed for bins that do not contain any data records. This has the effect of dividing the search space up into non rectangular regions which are based on the spatial properties of the data. The bucketing quad tree can be considered as an image with a resolution of 2x2 for each layer. The results show that this method performs better than the quad tree if there are more divisions per layer. This confirms our suspicions that the algorithm works better if it gets to "look" at the data with higher resolution images. An elegant class structure is developed where the implementation of concrete spatial indexes for a particular data type merely relies on rendering the data onto an image.

2022-08-20T10:28:26.430Z

{ "ACL": null, "DBLP": "journals/corr/abs-0705-0204", "ArXiv": "0705.0204", "MAG": "2075994746", "CorpusId": "783", "PubMed": null, "DOI": "10.1109/ICSMC.2006.385020", "PubMedCentral": null }

https://www.semanticscholar.org/paper/86d45e2f6a79d219b765adc7d3e782dca574aa02

Using Images to create a Hierarchical Grid Spatial Index

[ { "authorId": "2105059", "name": "L. Machowski" }, { "authorId": "1740675", "name": "T. Marwala" } ]

2006 IEEE International Conference on Systems, Man and Cybernetics

2,006

15

0

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle", "Conference" ]

2006-10-01T00:00:00

{ "name": "2006 IEEE International Conference on Systems, Man and Cybernetics", "volume": "3", "pages": "1974-1979" }

[ "two dimensional", "search queries", "image processing", "spatial indices" ]

[ "grid node", "spatial indices", "image processing", "search queries", "color images", "reference image", "digital image" ]

[ "search queries", "two dimensional", "grid node", "digital image", "reference image", "color images", "image processing", "spatial indices" ]

[ "web searches", "grid environments", "image analysis", "image matching", "image quality", "pattern recognition", "color image processing", "computer imaging and vision", "decision trees", "spatial database", "online searching", "grid computing", "machine learning", "image segmentation", "computer science", "data mining", "classifiers", "query processing", "spatial data", "search engines", "query languages", "information retrieval systems", "user interfaces", "online systems", "parallel processing systems", "artificial intelligence", "geographic information system", "world wide web", "database systems", "information retrieval", "human computer interaction", "computer systems", "distributed systems", "software", "internet", "distributed computer systems" ]

784

We study the properties of the MDL (or maximum penalized complexity) estimator for Regression and Classification, where the underlying model class is countable. We show in particular a finite bound on the Hellinger losses under the only assumption that there is a “true” model contained in the class. This implies almost sure convergence of the predictive distribution to the true one at a fast rate. It corresponds to Solomono’s central theorem of universal induction, however with a bound that is exponentially larger.

2022-07-11T06:33:18.169Z

{ "ACL": null, "DBLP": "journals/corr/abs-math-0502315", "ArXiv": "math/0502315", "MAG": "2951182766", "CorpusId": "784", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/ed8bd760ddb67b110c0716b5e18047eced3c86b0

Strong Asymptotic Assertions for Discrete MDL in Regression and Classification

[ { "authorId": "3088443", "name": "J. Poland" }, { "authorId": "144154444", "name": "Marcus Hutter" } ]

ArXiv

2,005

21

8

0

false

[ { "category": "Mathematics", "source": "s2-fos-model" }, { "category": "Mathematics", "source": "external" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2005-01-31T00:00:00

{ "name": "ArXiv", "volume": "abs/math/0502315", "pages": null }

[ "predictive distributions" ]

[ "classification models", "regression model", "supervised classification", "classification methods", "automatic classification" ]

[ "classification methods", "predictive distributions", "automatic classification", "classification models", "supervised classification", "regression model" ]

[ "computer systems", "gaussian processes", "image classification", "correlation analysis", "computer science", "gaussian distribution", "imaging systems", "mathematics", "gaussian noise (electronic)", "image reconstruction", "signal to noise ratio", "image analysis", "image processing", "signal processing", "computer imaging and vision", "engineering" ]

787

Treating interference as noise (TIN) as the most appropriate approach in dealing with interference and the conditions on its optimality has attracted the interest of researchers recently. However, our knowledge on necessary and sufficient conditions of TIN is restricted to a few setups with limited number of users. In this paper, we study the optimality of TIN in terms of the generalized degrees of freedom (GDoF) for a fundamental network, namely, the <inline-formula> <tex-math notation="LaTeX">$M\times 2$ </tex-math></inline-formula> X-channel. To this end, the achievable GDoF of TIN with power allocations at the transmitters is studied. It turns out that the transmit power allocation maximizing the achievable GDOF is given by on–off signaling as long as the receivers use TIN. This leads to two variants of TIN, namely, P2P-TIN and 2-IC-TIN. While in the first variant the <inline-formula> <tex-math notation="LaTeX">$M\times 2$ </tex-math></inline-formula> X-channel is reduced to a point-to-point (P2P) channel, in the second variant, the setup is reduced to a two-user interference channel in which the receivers use TIN. The optimality of these two variants is studied separately. To this end, novel genie-aided upper bounds on the capacity of the X-channel are established. The conditions on the optimality of P2P-TIN can be summarized as follows. P2P-TIN is GDoF-optimal if there exists a dominant multiple access channel or a dominant broadcast channel embedded in the X channel. Furthermore, the necessary and sufficient conditions on the GDoF-optimality of 2-IC-TIN are presented. Interestingly, it turns out that operating the <inline-formula> <tex-math notation="LaTeX">$M\times 2$ </tex-math></inline-formula> X-channel in the 2-IC-TIN mode might be still GDOF optimal, although the conditions given by Geng <italic>et al.</italic> are violated. However, 2-IC-TIN is sub-optimal if there exists a single interferer which causes sufficiently strong interference at both receivers. The comparison of the results with the state of the art shows that the GDOF optimality of TIN is expanded significantldy.

2022-08-28T18:54:21.193Z

{ "ACL": null, "DBLP": "journals/tit/GherekhlooCS17", "ArXiv": null, "MAG": "2550078853", "CorpusId": "787", "PubMed": null, "DOI": "10.1109/TIT.2016.2628376", "PubMedCentral": null }

https://www.semanticscholar.org/paper/25c01de2c13324e5e0fa51a2a1bec2e32a2b4d67

Expanded GDoF-optimality Regime of Treating Interference as Noise in the $M\times 2$ X-Channel

[ { "authorId": "103583355", "name": "Soheil Gherekhloo" }, { "authorId": "3067700", "name": "A. Chaaban" }, { "authorId": "144401550", "name": "A. Sezgin" } ]

IEEE Transactions on Information Theory

2,017

27

18

1

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

null

{ "name": "IEEE Transactions on Information Theory", "volume": "63", "pages": "355-376" }

[ "transmitters", "power allocations", "peer-to-peer", "multiple access", "sufficient conditions", "broadcast channels", "transmit power", "strong interference", "interference channels" ]

[ "sufficient conditions", "power allocations", "transmit power", "transmitters", "peer-to-peer", "interference channels", "multiple access", "broadcast", "broadcast channels", "strong interference", "gaussian interference channels", "optimal power allocation", "self-interferences", "radio channels", "wireless channel", "control channels" ]

[ "transmitters", "broadcast", "self-interferences", "gaussian interference channels", "power allocations", "peer-to-peer", "multiple access", "wireless channel", "sufficient conditions", "broadcast channels", "radio channels", "control channels", "optimal power allocation", "transmit power", "strong interference", "interference channels" ]

[ "signal receivers", "antennas", "ad hoc networks", "broadcasting", "full-duplex", "receiving antennas", "interference suppression", "numerical results", "capacity regions", "gaussian distribution", "wireless telecommunication systems", "distributed computer systems", "internet", "computer networks", "wireless networks", "frequency division multiple access", "multiple access interference", "multiplexing", "fading channels", "linear matrix inequalities", "mimo systems", "information theory", "fading (radio)", "radio transmission", "cognitive radio", "radio systems", "medium access control", "mobile telecommunication systems", "power control", "radio", "gaussians", "signal interference", "communication channels", "signal to noise ratio", "signal detection", "routers", "internet protocols", "quality of service", "wireless local area networks (wlan)", "multicasts", "routing algorithms", "sensors", "half-duplex", "numerical methods", "channel capacity", "gaussian noise (electronic)", "communication systems", "telecommunication systems", "computer systems", "computer science", "wireless communications", "packet networks", "frequency allocation", "spread spectrum communication", "radio interference", "matrix algebra", "communication", "bit error rate", "network protocols", "telecommunication networks", "code division multiple access", "spurious signal noise", "signal processing", "telecommunication traffic", "bandwidth", "local area networks", "data communication systems", "computer hardware", "relay channels", "mathematics", "probability", "engineering", "amplify-and-forward (af)" ]

788

A numerical method for solving the fractional diffusion equation, which could also be easily extended to other fractional partial differential equations, is considered. In this paper we combine the forward time centered space (FTCS) method, well known for the numerical integration of ordinary diffusion equations, with the Grunwald--Letnikov discretization of the Riemann--Liouville derivative to obtain an explicit FTCS scheme for solving the fractional diffusion equation. The stability analysis of this scheme is carried out by means of a powerful and simple new procedure close to the well-known von Neumann method for nonfractional partial differential equations. The analytical stability bounds are in excellent agreement with numerical test. A comparison between exact analytical solutions and numerical predictions is made.

2022-09-05T01:47:54.894Z

{ "ACL": null, "DBLP": "journals/siamnum/YusteA05", "ArXiv": null, "MAG": "1977696410", "CorpusId": "788", "PubMed": null, "DOI": "10.1137/030602666", "PubMedCentral": null }

https://www.semanticscholar.org/paper/8fe9df93992a82cc128de41109e0450bc5a1f886

An Explicit Finite Difference Method and a New von Neumann-Type Stability Analysis for Fractional Diffusion Equations

[ { "authorId": "2298808", "name": "S. B. Yuste" }, { "authorId": "145389858", "name": "L. Acedo" } ]

SIAM J. Numer. Anal.

2,004

69

451

14

true

[ { "category": "Mathematics", "source": "s2-fos-model" }, { "category": "Mathematics", "source": "external" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2004-05-01T00:00:00

{ "name": "SIAM J. Numer. Anal.", "volume": "42", "pages": "1862-1874" }

[ "diffusion equations", "numerical methods", "finite difference method", "numerical integrations", "partial differential equations" ]

[ "finite difference method", "diffusion equations", "partial differential equations", "differential equations", "numerical methods", "numerical integrations" ]

[ "diffusion equations", "numerical methods", "finite difference method", "numerical integrations", "partial differential equations", "differential equations" ]

[ "mathematics", "time domain analysis", "signal processing", "engineering" ]

789

This pattern for re-engineering non-ontological resources (PR-NOR) ﬁts in the Schema Re-engineering Category proposed by [3]. The pattern deﬁnes a procedure that transforms the classiﬁcation scheme components into ontology representational primitives. This pattern comes from the experience of ontology engineers in developing ontologies using classiﬁcation schemes in several projects (SEEMP 1 , NeOn 2 , and Knowledge Web 3 ). The pattern is included in a pool of patterns, which is a key element of our method for re-engineering non-ontological resources into ontologies [2]. The patterns generate the ontologies at a conceptualization level, independent of the ontology implementation language.

2022-03-03T05:36:27.708Z

{ "ACL": null, "DBLP": "conf/semweb/Villazon-TerrazasSG09a", "ArXiv": null, "MAG": "177069023", "CorpusId": "789", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/6bfe309b3d471c0003b4e696edbd41d172c9da32

Pattern for Re-engineering a Classification Scheme, which Follows the Path Enumeration Data Model, to a Taxonomy

[ { "authorId": "1398348791", "name": "B. Villazón-Terrazas" }, { "authorId": "1401950253", "name": "M. Suárez-Figueroa" }, { "authorId": "1398348796", "name": "A. Gómez-Pérez" } ]

WOP

2,009

5

1

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2009-10-25T00:00:00

{ "name": "", "volume": "", "pages": "112-115" }

[ "ontology", "engineers", "reengineering" ]

[ "engineering", "ontology", "engineers", "formal ontology", "domain ontologies" ]

[ "formal ontology", "engineering", "reengineering", "domain ontologies", "engineers", "ontology" ]

[ "knowledge representation", "computer software maintenance", "reverse engineering", "optical fibers", "semantics", "knowledge based systems", "software engineering", "object oriented programming", "architecting", "sensors", "artificial intelligence", "computer science", "computer programming", "software architecture", "computer hardware", "software design" ]

790

Off-chip buses account for a significant portion of the total system power consumed in embedded systems. Bus encoding schemes have been proposed to minimize power dissipation, but none has been demonstrated to be optimal with respect to any measure. In this paper, we give the first provably optimal and explicit (polynomial-time constructible) families of memoryless codes for minimizing bit transitions in off-chip buses. Our results imply that having access to a clock does not make a memoryless encoding scheme that minimizes bit transitions more powerful

2022-09-02T04:50:43.373Z

{ "ACL": null, "DBLP": "journals/corr/abs-0712-2640", "ArXiv": "0712.2640", "MAG": "1976526246", "CorpusId": "790", "PubMed": null, "DOI": "10.1145/1233501.1233575", "PubMedCentral": null }

https://www.semanticscholar.org/paper/2d98a0b0e5db7809a10349f412e32a9fe06e4b53

Optimal Memoryless Encoding for Low Power Off-Chip Data Buses

[ { "authorId": "1718686", "name": "Y. Chee" }, { "authorId": "1809509", "name": "C. Colbourn" }, { "authorId": "144634514", "name": "A. Ling" } ]

2006 IEEE/ACM International Conference on Computer Aided Design

2,006

24

9

0

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" }, { "category": "Mathematics", "source": "external" } ]

[ "JournalArticle", "Conference" ]

2006-11-05T00:00:00

{ "name": "2006 IEEE/ACM International Conference on Computer Aided Design", "volume": null, "pages": "369-374" }

[ "embedded systems", "low power", "memoryless", "power consumed" ]

[ "memoryless", "low power", "coding scheme", "peak power", "total power" ]

[ "power consumed", "embedded systems", "total power", "low power", "memoryless", "coding scheme", "peak power" ]

[ "energy utilization", "computer systems", "power allocations", "computer hardware", "capacity regions", "gaussians", "image coding", "network coding", "pumping (laser)", "pulsed laser applications", "electricity", "computer science", "wireless telecommunication systems", "broadcast channels", "channel capacity", "gaussian distribution", "image processing", "multicasts", "information theory", "fiber lasers", "optical materials", "engineering", "computer networks", "communication systems", "telecommunication systems", "broadcasting", "mimo systems", "communication channels", "signal to noise ratio", "gaussian noise (electronic)", "computer imaging and vision", "telecommunication networks", "bandwidth", "data communication systems", "communication", "fiber optic networks", "optical fibers", "signal processing", "sensors" ]

794

We have written a prototype computer program called TrenDx for automated trend detection during process monitoring. The program uses a representation called trend templates that define disorders as typical patterns of relevant variables. These patterns consist of a partially ordered set of temporal intervals with uncertain endpoints. Bound to each temporal interval arc value constraints on real-valued functions of measurable parameters. TrenDx has been used to diagnose trends in growth patterns from examining heights, weights and other parameters of pediatric patients. As TrenDx analyzes successive data points, the program updates its hypotheses about which stage of the growth process each data point belongs to. We present an example of TrenDx reaching temporally plausible diagnoses for an actual patient with delayed growth currently being seen at Boston Children's Hospital.

2022-09-05T01:39:26.770Z

{ "ACL": null, "DBLP": "conf/ijcai/HaimowitzK93", "ArXiv": null, "MAG": "48217427", "CorpusId": "794", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/65aa52c9149e2005c385d5d173de77d2895c62a8

Automated Trend Detection with Alternate Temporal Hypotheses

[ { "authorId": "2041775", "name": "I. J. Haimowitz" }, { "authorId": "1740538", "name": "I. Kohane" } ]

IJCAI

1,993

12

91

3

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle", "Conference" ]

1993-08-28T00:00:00

{ "name": null, "volume": null, "pages": "146-151" }

[ "data points", "process monitoring" ]

[ "detection algorithm", "process monitoring", "data points", "temporal correlations", "control parameters" ]

[ "temporal correlations", "data points", "control parameters", "process monitoring", "detection algorithm" ]

[ "spatial correlations", "image coding", "clustering algorithms", "control system analysis", "process control", "signal detection", "correlation methods", "image processing", "data mining", "adaptive control systems", "control systems", "automation", "signal processing", "mathematics", "computer imaging and vision", "computer science", "computer systems", "engineering" ]

795

The paper proposes a more formalized definition of UML 2.0 activity diagram semantics. A subset of activity diagram constructs relevant for business process modeling is considered. The semantics definition is based on the original token flow methodology, but a more constructive approach is used. The activity diagram virtual machine is defined by means of a metamodel, with operations defined by a mix of pseudocode and OCL pre- and postconditions. A formal procedure is described which builds the virtual machine for any activity diagram. The relatively complicated original token movement rules in control nodes and edges are combined into paths from an action to action. A new approach is the use of different (push and pull) engines, which move tokens along the paths. Pull engines are used for paths containing join nodes, where the movement of several tokens must be coordinated. The proposed virtual machine approach makes the activity semantics definition more transparent where the token movement can be easily traced. However, the main benefit of the approach is the possibility to use the defined virtual machine as a basis for UML activity diagram based workflow or simulation engine.

2022-09-02T06:55:05.303Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0509089", "ArXiv": "cs/0509089", "MAG": "2104599345", "CorpusId": "795", "PubMed": null, "DOI": "10.1109/EDOC.2005.29", "PubMedCentral": null }

https://www.semanticscholar.org/paper/ed2371e609adf6e486dbc453080a8e439d8cbf4c

Semantics of UML 2.0 activity diagram for business modeling by means of virtual machine

[ { "authorId": "2128842", "name": "V. Vitolins" }, { "authorId": "1953835", "name": "A. Kalnins" } ]

Ninth IEEE International EDOC Enterprise Computing Conference (EDOC'05)

2,005

15

39

1

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle", "Conference" ]

2005-09-19T00:00:00

{ "name": "Ninth IEEE International EDOC Enterprise Computing Conference (EDOC'05)", "volume": null, "pages": "181-192" }

[ "virtual machines", "unified modeling language", "bpm", "post-conditions", "uml activity diagrams", "business modeling", "semantics", "activity diagram", "ocl", "engine" ]

[ "semantics", "unified modeling language", "activity diagram", "uml activity diagrams", "sequence diagrams", "business process", "business modeling", "bpm", "virtual machines", "process modeling", "ocl", "post-conditions", "engine" ]

[ "virtual machines", "unified modeling language", "sequence diagrams", "bpm", "post-conditions", "business process", "process modeling", "uml activity diagrams", "business modeling", "semantics", "activity diagram", "ocl", "engine" ]

[ "cloud computing", "software engineering", "object oriented programming", "computer programming languages", "class diagrams", "verification", "information systems", "process engineering", "petri nets", "graphic methods", "business models", "engineering", "computer systems", "computer science", "computer programming", "verification and validation", "process control", "graph theory", "e-commerce", "software quality", "automation", "theoretical computer science", "internet", "information technology", "software design" ]

796

We present a straightforward and verified method of deciding whether the n-dimensional point x (n>=1), such that \nabla f(x)=0, is the local minimizer, maximizer or just a saddle point of a real-valued function f. The method scales linearly with dimensionality of the problem and never produces false results.

2022-06-20T12:28:03.098Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0609082", "ArXiv": "cs/0609082", "MAG": "1578326437", "CorpusId": "796", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/64b3710d18a470bdb3c51171deba5b41312d1a8d

Classifying extrema using intervals

[ { "authorId": "31466878", "name": "M. Gutowski" } ]

ArXiv

2,006

3

1

0

false

[ { "category": "Mathematics", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" }, { "category": "Mathematics", "source": "external" } ]

[ "JournalArticle" ]

2006-09-14T00:00:00

{ "name": "ArXiv", "volume": "abs/cs/0609082", "pages": null }

[]

[ "payoff function", "curse of dimensionality", "feature space", "combinatorial problems", "combinatorial optimization" ]

[ "payoff function", "curse of dimensionality", "combinatorial problems", "combinatorial optimization", "feature space" ]

[ "nash equilibrium", "dimensionality reduction", "combinatorial mathematics", "optimization", "pattern recognition", "classification methods", "game theory", "discriminant analysis", "graph theory", "mathematics", "machine learning", "computer systems", "artificial intelligence", "probability", "theoretical computer science", "computer science" ]

797

In this paper a polynomial time heuristic algorithm developed for the assignment optimization problem is introduced, which leads to an improved usage of field programmable gate array (FPGA) resources for hardware-based fault injection using an FPGA-based logic emulator. Logic emulation represents a new method of design validation utilizing a reprogrammable prototype of a digital circuit. In the past years various approaches to hardware-based fault injection using a hardware logic emulator have been presented. Some approaches insert additional functions at the fault location, while others utilize the reconfigurability of FPGAs. A common feature of each of these methods is the execution of hardware-based fault simulation using the stuck-at fault model at gate level.

2022-09-04T01:10:31.825Z

{ "ACL": null, "DBLP": "conf/iscas/Sedaghat03", "ArXiv": null, "MAG": "2104614263", "CorpusId": "797", "PubMed": null, "DOI": "10.1109/ISCAS.2003.1206234", "PubMedCentral": null }

https://www.semanticscholar.org/paper/aa8ef7899e90c3d2fa41d8d844944a4fe5624dc4

A fast algorithm to reduce 2-dimensional assignment problems to 1-dimensional assignment problems for FPGA-based fault simulation

[ { "authorId": "3251921", "name": "R. Sedaghat" } ]

Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03.

2,003

5

1

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2003-05-25T00:00:00

{ "name": "Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03.", "volume": "5", "pages": "V-V" }

[ "stuck-at faults", "assignment problems", "fault simulation", "validation", "computer hardware", "fpgas", "fault location", "fault injection", "programmable gate array", "reconfigurability", "field programmable gate array", "optimization problems" ]

[ "assignment problems", "field programmable gate array", "fpgas", "fault location", "fault simulation", "optimization", "programmable gate array", "computer hardware", "fault injection", "validation", "reconfigurability" ]

[ "stuck-at faults", "assignment problems", "computer hardware", "validation", "fault simulation", "fpgas", "fault location", "optimization", "fault injection", "programmable gate array", "reconfigurability", "field programmable gate array", "optimization problems" ]

[ "combinatorial circuits", "fault detection", "combinatorial optimization", "computer science", "verification and validation", "integrated circuit testing", "reconfigurable architectures", "electric fault location", "mathematics", "fault tolerance", "logic gates", "re-configurable", "correlation analysis", "electric network synthesis", "engineering", "software quality", "integrated circuit layout", "discrete cosine transforms", "fault tolerant computer systems", "embedded systems", "electric network analysis", "telecommunication equipment", "sensor nodes", "software design", "vlsi circuits", "computer aided design", "microprocessor chips", "cosine transforms", "mathematical transformations", "computer networks", "distributed computer systems", "computer systems", "electric network topology", "wireless telecommunication systems", "sensors", "software engineering", "image compression", "image enhancement", "telecommunication networks", "network topology", "communication systems", "telecommunication systems", "image quality", "image coding", "image analysis", "image processing", "computer imaging and vision" ]

798

Rabi and Sherman [RS97] presented novel digital signature and unauthenticated secret-key agreement protocols, developed by themselves and by Rivest and Sherman. These protocols use ``strong,'' total, commutative (in the case of multi-party secret-key agreement), associative one-way functions as their key building blocks. Though Rabi and Sherman did prove that associative one-way functions exist if $\p \neq \np$, they left as an open question whether any natural complexity-theoretic assumption is sufficient to ensure the existence of ``strong,'' total, commutative, associative one-way functions. In this paper, we prove that if $\p \neq \np$ then ``strong,'' total, commutative, associative one-way functions exist.

2022-06-20T11:28:54.597Z

{ "ACL": null, "DBLP": "journals/corr/cs-CC-9808003", "ArXiv": "cs/9808003", "MAG": "1579054707", "CorpusId": "798", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/428a2f495ee9b55a7132f0c88a47de63205731e1

Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function

[ { "authorId": "1704511", "name": "L. A. Hemaspaandra" }, { "authorId": "145200357", "name": "J. Rothe" } ]

ArXiv

1,998

10

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" ]

1998-08-23T00:00:00

{ "name": "ArXiv", "volume": "cs.CC/9808003", "pages": null }

[ "digital signature" ]

[ "digital signature", "private key", "secret key", "key agreement", "key agreement protocol" ]

[ "key agreement protocol", "private key", "digital signature", "secret key", "key agreement" ]

[ "public key cryptography", "cryptography", "encryption", "authentication", "network security", "cryptology", "security of data", "computer networks", "computer security", "computer science" ]

801

We describe an architecture for spoken dialogue interfaces to semi-autonomous systems that transforms speech signals through successive representations of linguistic, dialogue, and domain knowledge. Each step produces an output, and a meta-output describing the transformation, with an executable program in a simple scripting language as the final result. The output/meta-output distinction permits perspicuous treatment of diverse tasks such as resolving pronouns, correcting user misconceptions, and optimizing scripts.

2022-08-26T08:38:28.241Z

{ "ACL": "W00-0311", "DBLP": "conf/anlp/RaynerHJ00", "ArXiv": "cs/0006019", "MAG": "2259229052", "CorpusId": "801", "PubMed": null, "DOI": "10.3115/974147.974163", "PubMedCentral": null }

https://www.semanticscholar.org/paper/229eebe84ed75649e83ebebdd283f248a913aaef

A Compact Architecture for Dialogue Management Based on Scripts and Meta-Outputs

[ { "authorId": "1761581", "name": "Manny Rayner" }, { "authorId": "2018687", "name": "Beth Ann Hockey" }, { "authorId": "144774144", "name": "Frankie James" } ]

ANLP

2,000

19

25

0

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2000-04-29T00:00:00

{ "name": null, "volume": null, "pages": "112-118" }

[ "spoken dialogue", "speech signals", "linguistics", "domain knowledge", "scripting languages", "dialogue management", "dialogue" ]

[ "dialogue", "spoken dialogue", "dialogue management", "scripting languages", "speech signals" ]

[ "spoken dialogue", "speech signals", "linguistics", "domain knowledge", "scripting languages", "dialogue management", "dialogue" ]

[ "dialogue systems", "speech communication", "knowledge based systems", "high level languages", "human computer interaction", "argumentation", "natural language processing", "artificial intelligence", "computer programming", "computer science", "logic programming", "autonomous agents", "natural languages", "computer programming languages", "formal logic", "multiagent system", "semantics" ]

803

A new subpharmacophore-based virtual screening method is introduced. Subpharmacophores are derived from large active molecules to detect small bioactive molecules as seeds for starting points in medicinal chemistry programs. A large data set was assembled from the ChEMBL database to check the validity of this approach. Molecules for 133 targets with molecular weights between 450 and 850 were selected as queries. For the query molecules, the pharmacophore descriptors were calculated. Up to 56 000 subpharmacophore descriptors with five to seven pharmacophore points were derived from the query pharmacophores. The subpharmacophore descriptors were used as queries to screen 1079 test data sets, containing decoys and spike molecules. A maximum upper molecular weight limit of 400 Da was set for the test molecules. Three different chemical fingerprint descriptors were used for comparison purposes. The subpharmacophore approach detected active molecules for 85 out of 133 targets and outperformed the chemical fingerprints. This ligand-based virtual screening experiment was triggered by the needs of medicinal chemistry. Applying the subpharmacophore method in a medicinal chemistry program, where a lead molecule with a molecular weight of 800 Da was available, resulted in a new series of molecules with molecular weights below 400.

2022-09-01T04:44:21.938Z

{ "ACL": null, "DBLP": "journals/jcisd/KorffFSBC12", "ArXiv": null, "MAG": "2080207377", "CorpusId": "803", "PubMed": "22251316", "DOI": "10.1021/ci200402r", "PubMedCentral": null }

https://www.semanticscholar.org/paper/d24fb8b4f4d0755de933f5c33b1b5df6f53dd870

Fighting High Molecular Weight in Bioactive Molecules with Sub-Pharmacophore-Based Virtual Screening

[ { "authorId": "40604500", "name": "M. V. Korff" }, { "authorId": "1863590", "name": "Joël Freyss" }, { "authorId": "2058428508", "name": "T. Sander" }, { "authorId": "2994231", "name": "C. Boss" }, { "authorId": "2257519", "name": "Claire-Lise Ciana" } ]

J. Chem. Inf. Model.

2,012

32

1

0

false

[ { "category": "Chemistry", "source": "s2-fos-model" }, { "category": "Biology", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" }, { "category": "Medicine", "source": "external" }, { "category": "Chemistry", "source": "external" } ]

[ "JournalArticle" ]

2012-02-06T00:00:00

{ "name": "Journal of chemical information and modeling", "volume": "52 2", "pages": "\n 380-90\n " }

[ "fingerprint", "database systems", "descriptors" ]

[ "database systems", "descriptors", "fingerprint", "keyword queries", "query results" ]

[ "query results", "descriptors", "fingerprint", "database systems", "keyword queries" ]

[ "query processing", "object recognition", "image retrieval", "biometrics", "computer systems", "keyword search", "search engines", "query languages", "pattern recognition", "image segmentation", "image enhancement", "information retrieval", "access control", "computer science", "world wide web", "machine learning", "image analysis", "image processing", "computer security", "internet", "artificial intelligence", "computer imaging and vision" ]

804

A high-level architecture of a Hybrid Reconfigurable CPU, based on a Philips-supported core processor, is introduced. It features the Philips XPLA2 CPLD as a reconfigurable functional unit. A compilation chain is presented, in which automatic implementation of time-critical program segments in custom hardware is performed. The entire process is transparent from the programmer's point of view. The hardware synthesis module of the chain, which translates segments of assembly code into a hardware netlist, is discussed in details. Application examples are also presented.

2022-08-31T12:14:13.560Z

{ "ACL": null, "DBLP": "journals/corr/cs-PL-9811021", "ArXiv": "cs/9811021", "MAG": "1585620241", "CorpusId": "804", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/0c580c1831ed41846f702a963ce7ec8ee385b314

Automatic Hardware Synthesis for a Hybrid Reconfigurable CPU Featuring Philips CPLDs

[ { "authorId": "46598607", "name": "B. Kastrup" } ]

ArXiv

1,998

13

5

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

1998-11-12T00:00:00

{ "name": "ArXiv", "volume": "cs.PL/9811021", "pages": null }

[ "cpu", "cpld", "core processors", "computer hardware" ]

[ "computer hardware", "cpu", "cpld", "central processing unit", "architecture designs" ]

[ "computer hardware", "cpu", "architecture designs", "cpld", "central processing unit", "core processors" ]

[ "computer science", "gpu", "software architecture", "logic devices", "reduced instruction set computing", "operating systems", "computer workstations", "buffer storage", "random access storage", "multi-core processor", "embedded systems", "program processors", "software design", "field programmable gate array", "pipeline processing systems", "program compilers", "computer networks", "parallel processing systems", "telecommunication traffic", "bandwidth", "data communication systems", "microprocessor chips", "multi core", "computer systems", "software engineering", "computer programming languages", "distributed systems", "telecommunication networks", "computer programming", "distributed computer systems", "telecommunication systems" ]

807

We study the complexity of the model checking problem, for fixed model A, over certain fragments L of first-order logic. These are sometimes known as the expression complexities of L. We obtain various complexity classification theorems for these logics L as each ranges over models A, in the spirit of the dichotomy conjecture for the Constraint Satisfaction Problem -- which itself may be seen as the model checking problem for existential conjunctive positive first-order logic.

2022-09-03T12:44:12.230Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0609022", "ArXiv": "cs/0609022", "MAG": "1648163531", "CorpusId": "807", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/6ed4aa05e021b8427c43b7bcb7a5be825cfaa1f5

Dichotomies and Duality in First-order Model Checking Problems

[ { "authorId": "35202653", "name": "B. Martin" } ]

ArXiv

2,006

12

7

0

false

[ { "category": "Mathematics", "source": "s2-fos-model" }, { "category": "Mathematics", "source": "external" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2006-09-06T00:00:00

{ "name": "ArXiv", "volume": "abs/cs/0609022", "pages": null }

[ "first order logic", "model checking problem" ]

[ "model checking", "model checking problem", "first order logic", "constraint satisfaction problems (csp)", "model checker" ]

[ "model checker", "model checking", "model checking problem", "first order logic", "constraint satisfaction problems (csp)" ]

[ "embedded systems", "architecture verification and validation", "computability and decidability", "formal logic", "artificial intelligence", "computer systems", "architecting", "automata theory", "formal languages", "graph theory", "computer science", "software architecture", "formal languages and automata theory", "linguistics", "theoretical computer science", "software design", "software engineering" ]

813

We present different classes of solutions to the Firing Squad Synchronization Problem on networks of different shapes. The nodes are finite state processors that work at unison discrete steps. The networks considered are the line, the ring and the square. For all of these models we have considered one and two-way communication modes and also constrained the quantity of information that adjacent processors can exchange each step. We are given a particular time expressed as a function of the number of nodes of the network, $f(n)$ and present synchronization algorithms in time $n^2$, $n \log n$, $n\sqrt n$, $2^n$. The solutions are presented as {\em signals} that are used as building blocks to compose new solutions for all times expressed by polynomials with nonnegative coefficients.

2022-08-31T15:05:31.191Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0511044", "ArXiv": "cs/0511044", "MAG": "2740577245", "CorpusId": "813", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/b6200f4e0c73cb5aabeb35cdfe9d9c98645bba16

Various Solutions to the Firing Squad Synchronization Problems

[ { "authorId": "145665844", "name": "J. Gruska" }, { "authorId": "39312781", "name": "S. L. Torre" }, { "authorId": "144613535", "name": "M. Napoli" }, { "authorId": "145885429", "name": "Mimmo Parente" } ]

ArXiv

2,005

26

2

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Mathematics", "source": "external" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2005-11-11T00:00:00

{ "name": "ArXiv", "volume": "abs/cs/0511044", "pages": null }

[ "communication models" ]

[ "multiprocessors", "communication", "synchronization scheme", "network architecture", "communication networks" ]

[ "multiprocessors", "synchronization scheme", "network architecture", "communication models", "communication networks", "communication" ]

[ "multiprocessing systems", "multi core", "embedded systems", "time synchronization", "computer networks", "information theory", "telecommunication networks", "parallel processing systems", "microprocessor chips", "program processors", "computer systems", "wireless sensor networks", "computer science", "telecommunication systems", "distributed systems", "computer hardware", "wireless communications", "energy utilization", "sensor nodes", "routing algorithms", "distributed computer systems", "electricity", "sensors", "engineering" ]

814

This paper presents an evolutionary algorithm for modeling the arrival dates of document streams, which is any time-stamped collection of documents, such as newscasts, e-mails, IRC conversations, scientific journals archives and weblog postings. This algorithm assigns frequencies (number of document arrivals per time unit) to time intervals so that it produces an optimal fit to the data. The optimization is a trade off between accurately fitting the data and avoiding too many frequency changes; this way the analysis is able to find fits which ignore the noise. Classical dynamic programming algorithms are limited by memory and efficiency requirements, which can be a problem when dealing with long streams. This suggests to explore alternative search methods which allow for some degree of uncertainty to achieve tractability. Experiments have shown that the designed evolutionary algorithm is able to reach the same solution quality as those classical dynamic programming algorithms in a shorter time. We have also explored different probabilistic models to optimize the fitting of the date streams, and applied these algorithms to infer whether a new arrival increases or decreases {\em interest} in the topic the document stream is about.

2022-09-01T18:10:11.202Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0601047", "ArXiv": "cs/0601047", "MAG": "1570712508", "CorpusId": "814", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/e143e9f80f87535d49740d1ae1d568e3fe0eeda3

Automatic Detection of Trends in Dynamical Text: An Evolutionary Approach

[ { "authorId": "1744031", "name": "Lourdes Araujo" }, { "authorId": "2550546", "name": "J. J. M. Guervós" } ]

ArXiv

2,006

21

2

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2006-01-12T00:00:00

{ "name": "ArXiv", "volume": "abs/cs/0601047", "pages": null }

[ "trade", "evolutionary algorithms", "evolutionary approach", "frequencies", "optimization", "probabilistic models", "weblogs" ]

[ "evolutionary approach", "evolutionary algorithms", "data stream", "frequencies", "optimization", "trade", "probabilistic models", "electronic document", "text document", "adaptive algorithms", "programming languages" ]

[ "trade", "evolutionary algorithms", "electronic document", "evolutionary approach", "programming languages", "frequencies", "optimization", "probabilistic models", "weblogs", "data stream", "adaptive algorithms", "text document" ]

[ "commerce", "genetic algorithms", "word processing", "multi-objective optimisation", "computer programming languages", "linguistics", "bandwidth", "mathematics", "bayesian methods", "probability distributions", "bloggers", "data mining", "data communication systems", "database systems", "software", "text mining", "information retrieval systems", "economics", "artificial intelligence", "text processing", "computer programming", "computer networks", "probability", "blogs", "computer science", "computer systems", "information retrieval", "natural language processing", "computational linguistics", "world wide web", "natural languages", "internet", "semantics" ]

815

After the first treatments of quantum finite state automata by Moore and Crutchfield and by Kondacs and Watrous, a number of papers study the power of quantum finite state automata and their variants. This paper introduces a model of two-way quantum one-counter automata (2Q1CAs), combining the model of two-way quantum finite state automata (2QFAs) by Kondacs and Watrous and the model of one-way quantum one-counter automata (1Q1CAs) by Kravtsev. We give the definition of 2Q1CAs with well-formedness conditions. It is proved that 2Q1CAs are at least as powerful as classical two-way deterministic one-counter automata (2D1CAs), that is, every language L recognizable by 2D1CAs is recognized by 2Q1CAs with no error. It is also shown that several non-context-free languages including {a^n b^{n^2}} and {a^n b^{2^n}} are recognizable by 2Q1CAs with bounded error.

2022-06-20T11:24:43.232Z

{ "ACL": null, "DBLP": "journals/corr/cs-CC-0110005", "ArXiv": "cs/0110005", "MAG": "1677715418", "CorpusId": "815", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/e6819956cfe8de8f9cb33947dbc07a6f732980b9

Two-way Quantum One-counter Automata

[ { "authorId": "2057083729", "name": "Tomohiro Yamasaki" }, { "authorId": "1746389", "name": "H. Kobayashi" }, { "authorId": "50045120", "name": "H. Imai" } ]

ArXiv

2,001

27

4

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Mathematics", "source": "external" }, { "category": "Computer Science", "source": "external" }, { "category": "Physics", "source": "external" } ]

[ "JournalArticle" ]

2001-01-19T00:00:00

{ "name": "ArXiv", "volume": "cs.CC/0110005", "pages": null }

[ "finite state automata", "deterministic", "automata" ]

[ "finite state automata", "automata", "push-down automata", "finite automata", "automation" ]

[ "automation", "push-down automata", "finite state automata", "deterministic", "finite automata", "automata" ]

[ "engineering", "translation (languages)", "stochastic", "automata theory", "formal languages", "computational linguistics", "linguistics", "stochastic processes", "stochasticity", "formal languages and automata theory", "database systems", "probability", "numerical model", "theoretical computer science", "computer systems", "mathematics", "computer science" ]

818

Is it possible to specify a grammatical representation (descriptors and their application guidelines) to such a degree that it can be consistently applied by different grammarians e.g. for producing a benchmark corpus for parser evaluation? Arguments for and against have been given, but very little empirical evidence. In this article we report on a double-blind experiment with a surface-oriented morphosyntactic grammatical representation used in a large-scale English parser. We argue that a consistently applicable representation for morphology and also shallow syntax can be specified. A grammatical representation with a near-100% coverage of running text can be specified with a reasonable effort, especially if the representation is based on structural distinctions (i.e. it is structurally resolvable).

2022-09-03T19:16:56.382Z

{ "ACL": "E95-1029", "DBLP": "conf/eacl/VoutilainenJ95", "ArXiv": "cmp-lg/9502011", "MAG": "1964372771", "CorpusId": "818", "PubMed": null, "DOI": "10.3115/976973.977003", "PubMedCentral": null }

https://www.semanticscholar.org/paper/3deb64bc018eb04a05ba4e30e28f47e7f1886c66

Specifying a shallow grammatical representation for parsing purposes

[ { "authorId": "1751188", "name": "A. Voutilainen" }, { "authorId": "7990402", "name": "T. Järvinen" } ]

EACL

1,995

10

40

1

true

[ { "category": "Linguistics", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle", "Conference" ]

1995-02-13T00:00:00

{ "name": null, "volume": null, "pages": "210-214" }

[ "parsing algorithm", "descriptors" ]

[ "syntactics", "descriptors", "syntactic structure", "empirical analysis", "parsing algorithm" ]

[ "syntactic structure", "parsing algorithm", "descriptors", "syntactics", "empirical analysis" ]

[ "natural language processing", "computational linguistics", "formal languages", "object recognition", "image retrieval", "numerical model", "artificial intelligence", "natural languages", "database systems", "linguistics", "formal languages and automata theory", "pattern recognition", "image segmentation", "image enhancement", "information retrieval", "mathematics", "computer science", "semantics", "computer systems", "theoretical computer science", "machine learning", "image analysis", "image processing", "computer imaging and vision" ]

819

This paper presents an approach for the implementation and execution of an effective requirements generation process. We achieve this goal by providing a well-defined requirements engineering model that includes verification and validation (V&V), and analysis. In addition, we identify focused activity objectives and map popular methods to lower-level activities, and define a criterion based process for optimizing method selection for attendant activities. Our model, unlike other models, addresses the complete requirements generation process and consists of activities defined at more adequate levels of abstraction. Furthermore, our model also incorporates a unique approach to V&V that enhances quality and reduces the cost of generating requirements. Additionally, activity objectives are identified and explicitly stated - not implied as in the current models. To assist in the selection of an appropriate set of methods, we have mapped commonly used methods to activities based on their objectives. Finally, we have identified method selection criteria and prescribed a reduced set of methods that optimize these criteria for each activity in our model. Thus, our approach assists in the task of selecting methods by using selection criteria to reduce a large collection of potential methods to a smaller, manageable set. The model, clear mapping of methods to activity objectives, and the criteria based process, taken together, provide the much needed guidance for the effective implementation and execution of the requirements generation process.

2022-07-31T11:24:44.025Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0503004", "ArXiv": "cs/0503004", "MAG": "1645308460", "CorpusId": "819", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/408c3aaa0e5136d07a5df404c212ada37aa78cb9

Effective Requirements Generation: Synchronizing Early Verification & Validation, Methods and Method Selection Criteria

[ { "authorId": "2168319", "name": "Lester O. Lobo" }, { "authorId": "145111648", "name": "J. Arthur" } ]

ArXiv

2,005

74

8

1

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2005-03-01T00:00:00

{ "name": "ArXiv", "volume": "abs/cs/0503004", "pages": null }

[ "verification", "requirements engineering", "genetic selection", "validation" ]

[ "verification", "validation", "requirements engineering", "engineering", "verification method" ]

[ "verification", "validation", "engineering", "requirements engineering", "verification method", "genetic selection" ]

[ "verification and validation", "software engineering", "model checking", "formal verifications", "genetic analysis", "software quality", "computer science", "embedded systems", "architecture verification and validation", "bioinformatics", "software design", "computer systems", "architecting", "software architecture" ]

822

The Asynchronous ¿-calculus, as recently proposed by Boudol and, independently, by Honda and Tokoro, is a subset of the ¿-calculus which contains no explicit operators for choice and output-prefixing. The communication mechanism of this calculus, however, is powerful enough to simulate output-prefixing, as shown by Boudol, and input-guarded choice, as shown recently by Nestmann and Pierce. A natural question arises, then, whether or not it is possible to embed in it the full ¿-calculus. We show that this is not possible, i.e. there does not exist any uniform, parallel-preserving, translation from the ¿-calculus into the asynchronous ¿-calculus, up to any "reasonable" notion of equivalence. This result is based on the incapablity of the asynchronous ¿-calculus of breaking certain symmetries possibly present in the initial communication graph. By similar arguments, we prove a separation result between the ¿-calculus and CCS.

2022-09-05T01:16:41.109Z

{ "ACL": null, "DBLP": "journals/corr/cs-PL-9809008", "ArXiv": "cs/9809008", "MAG": "2109585055", "CorpusId": "822", "PubMed": null, "DOI": "10.1145/263699.263731", "PubMedCentral": null }

https://www.semanticscholar.org/paper/505c7c487d5b8a955ef0f0373aa557595a82f896

Comparing the expressive power of the synchronous and the asynchronous π-calculus

[ { "authorId": "1722055", "name": "C. Palamidessi" } ]

POPL '97

1,998

24

203

22

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Mathematics", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

1998-09-02T00:00:00

{ "name": "ArXiv", "volume": "cs.PL/9809008", "pages": null }

[ "communication" ]

[ "communication", "asynchronous system", "lambda calculus", "wireless communications", "communication protocols" ]

[ "lambda calculus", "wireless communications", "communication protocols", "communication", "asynchronous system" ]

[ "computer metatheory", "computer networks", "network protocols", "fault tolerant computer systems", "automata theory", "computer programming languages", "computer science", "internet", "distributed computer systems", "formal languages and automata theory", "computer programming", "computer systems", "theoretical computer science" ]

824

Developing and maintaining complex, large-scale, product line of highly customized software systems is difficult and costly. Part of the difficulty is due to the need to communicate business knowledge between domain experts and application programmers. Domain specific model driven development (MDD) addresses this difficulty by providing domain experts and developers with domain specific abstractions for communicating designs. Most MDD implementations take a generative approach. In contrast, we adopt an interpretive approach to domain specific model driven development. We present a framework, named ModelTalk, that integrates MDD, dependency injection and meta-modeling to form an interpretive, domain specific modeling framework. The framework is complemented by tool support that provides developers with the same advanced level of usability for modeling as they are accustomed to in programming environments. ModelTalk is used in a commercial setting for developing a product line of Telco grade business support systems (BSS).

2022-09-04T04:26:31.266Z

{ "ACL": null, "DBLP": "journals/corr/abs-0906-3423", "ArXiv": "0906.3423", "MAG": "1659745139", "CorpusId": "824", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/4de82424dac3e48a852fe34d216a6e15bd990303

ModelTalk: A Framework for Developing Domain Specific Executable Models

[ { "authorId": "1405499552", "name": "Atzmon Hen-Tov" }, { "authorId": "2153132", "name": "D. Lorenz" }, { "authorId": "1849220", "name": "Lior Schachter" } ]

ArXiv

2,009

27

16

3

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2009-06-18T00:00:00

{ "name": "ArXiv", "volume": "abs/0906.3423", "pages": null }

[ "tool support", "domain knowledge", "bss", "product lines", "domain specific modeling", "model driven development", "software systems" ]

[ "product lines", "software", "software systems", "business process", "domain knowledge", "tool support", "bss", "software developer", "knowledge engineers", "programming languages", "software frameworks", "formal framework", "software product line", "software project" ]

[ "software developer", "formal framework", "tool support", "business process", "programming languages", "knowledge engineers", "domain knowledge", "bss", "software product line", "product lines", "software project", "software", "domain specific modeling", "model driven development", "software frameworks", "software systems" ]

[ "software architecture", "formal methods", "software design", "object oriented programming", "information systems", "computer programming languages", "linguistics", "knowledge base", "knowledge acquisition", "knowledge engineering", "knowledge based systems", "blind source separation", "computer software reusability", "network architecture", "model checking", "functional requirement", "computer science", "model-driven engineering", "embedded systems", "user interfaces", "computer programming", "formal logic", "software engineering", "computer systems", "knowledge management", "artificial intelligence", "matrix algebra", "statistical methods", "computer networks", "architecture verification and validation", "requirements engineering", "model transformation", "code generation", "architecting", "human computer interaction", "mathematics", "correlation analysis", "graph theory", "program compilers", "theoretical computer science", "parallel processing systems", "distributed systems", "distributed computer systems" ]

825

The first complete measurement of the Chinese Internet topology at the autonomous systems (AS) level based on traceroute data probed from servers of major ISPs in mainland China is presented. Both the Chinese Internet AS graph and the global Internet AS graph can be accurately reproduced by the positive-feedback preference model with the same parameters. This result suggests that the Chinese Internet preserves well the topological characteristics of the global Internet. This is the first demonstration of the Internet's topological fractality, or self-similarity, performed at the level of topology evolution modelling.

2022-09-04T21:27:34.221Z

{ "ACL": null, "DBLP": "journals/iet-com/ZhouZ07", "ArXiv": "cs/0511101", "MAG": "2885258293", "CorpusId": "825", "PubMed": null, "DOI": "10.1049/iet-com:20060518", "PubMedCentral": null }

https://www.semanticscholar.org/paper/e7533f278c9c79a75102e547c6d6ae4bd1e8ee3f

Chinese Internet AS-level topology

[ { "authorId": "145012879", "name": "Shi Zhou" }, { "authorId": "49288101", "name": "Guoqiang Zhang" } ]

IET Commun.

2,005

57

58

3

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2005-11-29T00:00:00

{ "name": "IET Commun.", "volume": "1", "pages": "209-214" }

[ "servers", "internet", "topology", "demonstrations" ]

[ "internet", "network topology", "topology", "topological structure", "servers", "demonstrations", "user preferences", "world wide web", "intranets" ]

[ "world wide web", "intranets", "topological structure", "network topology", "servers", "demonstrations", "user preferences", "topology", "internet" ]

[ "security of data", "information technology", "computer networks", "intelligent robots", "robot programming", "user interfaces", "computer science", "computer security", "artificial intelligence", "mobile robots", "sensors", "robotic manipulators", "motion planning", "human computer interaction", "robotics", "computer hardware", "robots" ]

826

main aspects of XML retrieval are identified by analysing and comparing the following two behaviours: the behaviour of the assessor when judging the relevance of returned doc- ument components; and the behaviour of users when inter- acting with components of XML documents. We argue that the two INEX relevance dimensions, Exhaustivity and Speci- ficity, are not orthogonal dimensions; indeed, an empirical analysis of each dimension reveals that the grades of the two dimensions are correlated to each other. By analysing the level of agreement between the assessor and the users, we aim at identifying the best units of retrieval. The results of our analysis show that the highest level of agreement is on highly relevant and on non-relevant document components, suggesting that only the end points of the INEX 10-point relevance scale are perceived in the same way by both the assessor and the users. We propose a new definition of rel- evance for XML retrieval and argue that its corresponding relevance scale would be a better choice for INEX.

2022-09-02T18:28:14.613Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0507069", "ArXiv": "cs/0507069", "MAG": "2129031474", "CorpusId": "826", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/ca098bdfe0b07ce9938bc96c9321dfca30cd5461

Users and Assessors in the Context of INEX: Are Relevance Dimensions Relevant?

[ { "authorId": "3324944", "name": "J. Pehcevski" }, { "authorId": "145608528", "name": "J. Thom" }, { "authorId": "1685821", "name": "Anne-Marie Vercoustre" } ]

ArXiv

2,005

26

19

1

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2005-07-28T00:00:00

{ "name": "ArXiv", "volume": "abs/cs/0507069", "pages": null }

[ "empirical analysis", "xml retrieval", "xml data" ]

[ "xml", "xml data", "empirical analysis", "electronic document", "xml schemas" ]

[ "electronic document", "xml data", "xml retrieval", "xml", "xml schemas", "empirical analysis" ]

[ "word processing", "query processing", "information management", "information retrieval systems", "world wide web", "database systems", "numerical model", "text processing", "search engines", "query languages", "information technology", "information retrieval", "internet", "computer systems", "mathematics", "natural language processing", "computational linguistics", "data mining", "computer science", "artificial intelligence", "natural languages", "linguistics", "semantics" ]

829

We consider point to point link scheduling in Spatial Time Division Multiple Access (STDMA) wireless networks under the physical interference model. We propose a novel link scheduling algorithm based on a line graph representation of the network, by embedding the interferences between pairs of nodes into the edge weights of the line graph. Our algorithm achieves lower schedule length and lower run time complexity than existing algorithms.

2022-09-03T20:35:26.289Z

{ "ACL": null, "DBLP": "journals/corr/abs-0712-1662", "ArXiv": "0712.1662", "MAG": "1601700714", "CorpusId": "829", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/3ab3c765f3a51f759b1a5209fd01efd109cf4158

Link Scheduling in STDMA Wireless Networks: A Line Graph Approach

[ { "authorId": "2116163291", "name": "N. Kumar" }, { "authorId": "35119024", "name": "Ashutosh Deepak Gore" }, { "authorId": "2522607", "name": "A. Karandikar" } ]

ArXiv

2,007

12

5

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2007-12-11T00:00:00

{ "name": "ArXiv", "volume": "abs/0712.1662", "pages": null }

[ "wireless networks", "multiple access", "edge weights", "link scheduling" ]

[ "link scheduling", "multihop wireless network", "wireless", "wireless networks", "multiple access", "edge weights", "wireless communications", "network architecture", "weighted graph" ]

[ "weighted graph", "network architecture", "wireless communications", "multiple access", "link scheduling", "wireless", "multihop wireless network", "edge weights", "wireless networks" ]

[ "graphic methods", "computer networks", "frequency division multiple access", "multiple access interference", "multiplexing", "fading channels", "mesh networking", "radio", "ad hoc networks", "polynomial approximation", "approximation algorithms", "directed graphs", "packet networks", "graph theory", "computer science", "frequency allocation", "spread spectrum communication", "radio interference", "communication channels", "signal to noise ratio", "wireless mesh networks (wmn)", "wireless telecommunication systems", "routers", "mobile telecommunication systems", "internet protocols", "quality of service", "wireless local area networks (wlan)", "multicasts", "routing algorithms", "sensors", "approximation theory", "telecommunication traffic", "theoretical computer science", "data communication systems", "fading (radio)", "code division multiple access", "signal receivers", "signal interference", "signal processing", "communication systems", "telecommunication systems", "bandwidth", "telecommunication networks", "local area networks", "computer hardware", "mathematics", "computer systems", "bit error rate", "signal detection", "spurious signal noise", "engineering", "probability" ]

830

The ability to identify interesting and repetitive substructures is an essential component to discovering knowledge in structural data. We describe a new version of our SUBDUE substructure discovery system based on the minimum description length principle. The SUBDUE system discovers substructures that compress the original data and represent structural concepts in the data. By replacing previously-discovered substructures in the data, multiple passes of SUBDUE produce a hierarchical description of the structural regularities in the data. SUBDUE uses a computationally-bounded inexact graph match that identifies similar, but not identical, instances of a substructure and finds an approximate measure of closeness of two substructures when under computational constraints. In addition to the minimumdescription length principle, other background knowledge can be used by SUBDUE to guide the search towards more appropriate substructures. Experiments in a variety of domains demonstrate SUBDUE's ability to find substructures capable of compressing the original data and to discover structural concepts important to the domain.

2022-09-05T02:22:55.269Z

{ "ACL": null, "DBLP": "journals/corr/cs-AI-9402102", "ArXiv": "cs/9402102", "MAG": "2124996875", "CorpusId": "830", "PubMed": null, "DOI": "10.1613/jair.43", "PubMedCentral": null }

https://www.semanticscholar.org/paper/4543111e78a5dacc84773757257a32a872ce8d3a

Substructure Discovery Using Minimum Description Length and Background Knowledge

[ { "authorId": "144758070", "name": "D. Cook" }, { "authorId": "1726417", "name": "L. Holder" } ]

J. Artif. Intell. Res.

1,993

31

561

52

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" }, { "category": "Mathematics", "source": "external" } ]

[ "JournalArticle" ]

1993-08-01T00:00:00

{ "name": "ArXiv", "volume": "cs.AI/9402102", "pages": null }

[ "background knowledge" ]

[ "background knowledge", "domain knowledge", "integrated data", "explicit knowledge", "tacit knowledge" ]

[ "tacit knowledge", "integrated data", "background knowledge", "explicit knowledge", "domain knowledge" ]

[ "knowledge management", "data integration", "knowledge representation", "knowledge based systems", "data handling", "semantics", "artificial intelligence", "database systems", "computer science", "computer systems" ]

831

This paper presents basic concepts, architectural principles and algorithms for efficient resource and security management in cluster computing environments and the Grid. The work presented in this paper is funded by BTExacT and the EPSRC project SO-GRM (GR/S21939).

2022-07-29T12:00:43.494Z

{ "ACL": null, "DBLP": "journals/corr/abs-0711-0325", "ArXiv": "0711.0325", "MAG": "2963530447", "CorpusId": "831", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/7435a23a5bac914091345256d7f1107480447fa8

Self-Organising management of Grid environments

[ { "authorId": "1715811", "name": "Ioannis Liabotis" }, { "authorId": "3088647", "name": "O. Prnjat" }, { "authorId": "2699990", "name": "Temitope Olukemi" }, { "authorId": "3250137", "name": "A. Ching" }, { "authorId": "1803727", "name": "A. Lazarevic" }, { "authorId": "145336964", "name": "L. Sacks" }, { "authorId": "74983963", "name": "M. Fisher" }, { "authorId": "2150380", "name": "P. McKee" } ]

ArXiv

2,007

22

9

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2007-11-02T00:00:00

{ "name": "ArXiv", "volume": "abs/0711.0325", "pages": null }

[ "computing environments", "cluster computing", "grid environments", "security management" ]

[ "grid environments", "computing environments", "security management", "cluster computing", "computational grids" ]

[ "computing environments", "cluster computing", "grid environments", "computational grids", "security management" ]

[ "cloud computing", "grid computing", "program processors", "parallel architectures", "industrial management", "security systems", "network security", "computer systems", "parallel processing systems", "microprocessor chips", "information technology", "security of data", "cryptography", "computer networks", "computer science", "distributed systems", "computer hardware", "computer security", "cryptology", "distributed computer systems" ]

832

We consider the problem of transmission of several discrete sources over a multiple access channel (MAC) with side information at the sources and the decoder. Source-channel separation does not hold for this channel. Sufficient conditions are provided for transmission of sources with a given distortion. The channel could have continuous alphabets (Gaussian MAC is a special case). Various previous results are obtained as special cases.

2022-09-03T10:12:34.082Z

{ "ACL": null, "DBLP": "conf/isit/RajeshVS08", "ArXiv": "0904.4006", "MAG": "2951086558", "CorpusId": "832", "PubMed": null, "DOI": "10.1109/ISIT.2008.4595484", "PubMedCentral": null }

https://www.semanticscholar.org/paper/f3e944759a5532f6ff06a45dda86224afc61e5fe

Distributed joint source channel coding on a multiple access channel with side information

[ { "authorId": "2522841", "name": "R. Rajesh" }, { "authorId": "1911845", "name": "Virendra K. Varshneya" }, { "authorId": "145829061", "name": "V. Sharma" } ]

2008 IEEE International Symposium on Information Theory

2,008

127

23

0

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" }, { "category": "Mathematics", "source": "external" } ]

[ "JournalArticle" ]

2008-03-10T00:00:00

{ "name": "2008 IEEE International Symposium on Information Theory", "volume": null, "pages": "2707-2711" }

[ "multiple access", "source channel coding", "mac protocol", "sufficient conditions", "gaussians" ]

[ "radio channels", "wireless channel", "control channels", "multiple access", "mac protocol", "sufficient conditions", "gaussians" ]

[ "multiple access", "wireless channel", "source channel coding", "mac protocol", "sufficient conditions", "radio channels", "control channels", "gaussians" ]

[ "wireless networks", "frequency division multiple access", "multiple access interference", "multiplexing", "fading channels", "channel coding", "medium access control", "wireless telecommunication systems", "linear matrix inequalities", "fading (radio)", "radio transmission", "antennas", "cognitive radio", "radio systems", "mobile telecommunication systems", "gaussian distribution", "wireless communications", "packet networks", "frequency allocation", "spread spectrum communication", "radio interference", "communication channels", "signal to noise ratio", "image coding", "bit error rate", "channel capacity", "network protocols", "computer networks", "communication systems", "telecommunication systems", "matrix algebra", "signal detection", "telecommunication networks", "gaussian noise (electronic)", "telecommunication traffic", "data communication systems", "code division multiple access", "signal receivers", "signal interference", "signal processing", "image processing", "probability", "information theory", "internet", "computer science", "computer systems", "mathematics", "spurious signal noise", "engineering", "computer imaging and vision", "communication" ]

836

In this paper we expose the theoretical background underlying our current research. This consists in the development of behaviour-based knowledge systems, for closing the gaps between behaviour-based and knowledge-based systems, and also between the understandings of the phenomena they model. We expose the requirements and stages for developing behaviour-based knowledge systems and discuss their limits. We believe that these are necessary conditions for the development of higher order cognitive capacities, in artificial and natural cognitive systems.

2022-08-27T18:45:22.076Z

{ "ACL": null, "DBLP": "journals/corr/cs-AI-0206027", "ArXiv": "cs/0206027", "MAG": "1899584137", "CorpusId": "836", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/fdceea62710af269e0d3293374a4ca503fa4650f

Behaviour-based Knowledge Systems: An Epigenetic Path from Behaviour to Knowledge

[ { "authorId": "1745123", "name": "C. Gershenson" } ]

ArXiv

2,002

60

8

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2002-06-18T00:00:00

{ "name": "ArXiv", "volume": "cs.AI/0206027", "pages": null }

[ "cognitive systems", "knowledge based systems" ]

[ "domain knowledge", "explicit knowledge", "tacit knowledge", "single path", "routing scheme" ]

[ "tacit knowledge", "knowledge based systems", "single path", "explicit knowledge", "domain knowledge", "routing scheme", "cognitive systems" ]

[ "knowledge management", "artificial intelligence", "multi path routing", "routing protocols", "routing algorithms", "computer science", "routers", "wireless telecommunication systems", "computer networks", "telecommunication traffic", "bandwidth", "communication systems", "telecommunication systems", "telecommunication networks", "computer systems" ]

838

We present a PSPACE algorithm that decides satisfiability of the graded modal lo gic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which plays an important role in the area of knowledge representation. The algorithm employs a tableaux approach and is the first known algorithm which meets the lower bound for the complexity of the problem. Thus, we exactly fix the complexity of the problem and refute a EXPTIME-hardness conjecture. We extend the results to the logic Gr(K R 1 \ ), which augments Gr(KR) with inverse relations and intersection of accessibility relations. This establishes a kind of “theoretical benchma rk” that all algorithmic approaches can be measured against.

2022-09-02T11:42:52.368Z

{ "ACL": null, "DBLP": "journals/logcom/Tobies01", "ArXiv": "cs/0005009", "MAG": "1636976386", "CorpusId": "838", "PubMed": null, "DOI": "10.1093/logcom/11.1.85", "PubMedCentral": null }

https://www.semanticscholar.org/paper/ecdc8227102ed5a320723845a32268c8969f66a0

PSPACE Reasoning for Graded Modal Logics

[ { "authorId": "1765981", "name": "S. Tobies" } ]

J. Log. Comput.

2,000

20

83

7

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" }, { "category": "Mathematics", "source": "external" } ]

[ "JournalArticle" ]

2000-05-08T00:00:00

{ "name": "J. Log. Comput.", "volume": "11", "pages": "85-106" }

[ "satisfiability", "modal logic", "reasoning", "knowledge representation" ]

[ "reasoning", "modal logic", "satisfiability", "knowledge representation", "propositional logic" ]

[ "modal logic", "reasoning", "satisfiability", "knowledge representation", "propositional logic" ]

[ "formal logic", "ontology", "formal languages", "knowledge based systems", "semantics", "logic programming", "artificial intelligence", "linguistics", "formal languages and automata theory", "computer programming languages", "computer science", "theoretical computer science", "computer programming" ]

839

We consider the point-to-point link scheduling problem in Spatial Time Division Multiple Access (STDMA) wireless ad hoc networks, motivate the use of spatial reuse as performance metric and provide an explicit characterization of spatial reuse. We assume uniform transmission power at all nodes and propose an algorithm based on a graph model of the network as well as Signal to Interference and Noise Ratio (SINR) computations. Our algorithm achieves higher spatial reuse than existing algorithms, without compromising on computational complexity.

2022-09-03T20:35:25.913Z

{ "ACL": null, "DBLP": "conf/globecom/GoreKJ07", "ArXiv": "cs/0701001", "MAG": "2950643428", "CorpusId": "839", "PubMed": null, "DOI": "10.1109/GLOCOM.2007.143", "PubMedCentral": null }

https://www.semanticscholar.org/paper/fb6acbf2239bedd83ea312c328be022e0d4d6da0

On High Spatial Reuse Link Scheduling in STDMA Wireless Ad Hoc Networks

[ { "authorId": "35119024", "name": "Ashutosh Deepak Gore" }, { "authorId": "2522607", "name": "A. Karandikar" }, { "authorId": "1890199", "name": "Srikanth Jagabathula" } ]

IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference

2,007

54

33

1

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle", "Conference" ]

2007-01-02T00:00:00

{ "name": "IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference", "volume": null, "pages": "736-741" }

[ "multiple access", "noise ratios", "wireless", "link scheduling", "ad hoc networks", "transmission power" ]

[ "link scheduling", "wireless communications", "wireless", "ad hoc networks", "multiple access", "transmission power" ]

[ "wireless communications", "multiple access", "noise ratios", "link scheduling", "wireless", "ad hoc networks", "transmission power" ]

[ "computer networks", "wireless networks", "frequency division multiple access", "multiple access interference", "multiplexing", "fading channels", "acoustic intensity", "mesh networking", "radio", "routers", "mobile telecommunication systems", "internet protocols", "quality of service", "wireless local area networks (wlan)", "multicasts", "routing algorithms", "sensors", "wireless sensor networks", "power control", "computer science", "packet networks", "frequency allocation", "spread spectrum communication", "radio interference", "communication channels", "signal to noise ratio", "fading (radio)", "wireless mesh networks (wmn)", "wireless telecommunication systems", "telecommunication traffic", "bandwidth", "telecommunication networks", "local area networks", "data communication systems", "computer hardware", "energy utilization", "sensor nodes", "code division multiple access", "signal receivers", "signal interference", "signal processing", "bit error rate", "signal detection", "communication systems", "telecommunication systems", "computer systems", "electricity", "spurious signal noise", "engineering", "probability", "mathematics" ]

842

E-learning can be loosely defined as a wide set of applications and processes, which uses available electronic media (and tools) to deliver vocational education and training. With its increasing recognition as an ubiquitous mode of instruction and interaction in the academic as well as corporate world, the need for a scaleable and realistic model is becoming important. In this paper, we introduce SELF; a semantic grid-based e-learning framework. SELF aims to identify the key-enablers in a practical grid-based e-learning environment and to minimize technological reworking by proposing a well-defined interaction plan among currently available tools and technologies. We define a dichotomy with e-learning specific application layers on top and semantic grid-based support layers underneath. We also map the latest open and freeware technologies with various components in SELF.

2022-09-04T21:47:53.346Z

{ "ACL": null, "DBLP": "conf/ccgrid/AbbasUOMAF05", "ArXiv": "cs/0502051", "MAG": "2949309910", "CorpusId": "842", "PubMed": null, "DOI": "10.1109/CCGRID.2005.1558528", "PubMedCentral": null }

https://www.semanticscholar.org/paper/158bd10d77c20cb5c4af8913289372aa9c028b3a

A semantic grid-based e-learning framework (SELF)

[ { "authorId": "2055620924", "name": "Zaheer Abbas" }, { "authorId": "153360421", "name": "M. Umer" }, { "authorId": "9266700", "name": "M. Odeh" }, { "authorId": "144117518", "name": "R. McClatchey" }, { "authorId": "144622779", "name": "Arshad Ali" }, { "authorId": "3184068", "name": "H. F. Ahmad" } ]

CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005.

2,005

38

49

2

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2005-02-09T00:00:00

{ "name": "CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005.", "volume": "1", "pages": "11-18 Vol. 1" }

[ "application layers", "e-learning", "education", "semantics", "grid-based", "learning environments" ]

[ "semantics", "grid node", "education", "application layers", "computational grids" ]

[ "application layers", "e-learning", "grid node", "education", "computational grids", "semantics", "grid-based", "learning environments" ]

[ "network layers", "internet protocols", "information systems", "grid environments", "grid computing", "wireless telecommunication systems", "telecommunication traffic", "computer systems", "parallel processing systems", "computer networks", "communication systems", "telecommunication systems", "telecommunication networks", "computer science", "distributed systems", "distributed computer systems" ]

844

We propose an alternative way to represent graphs via OBDDs based on the observation that a partition of the graph nodes allows sharing among the employed OBDDs. In the second part of the paper we present a method to compute at the same time the quotient w.r.t. the maximum bisimulation and the OBDD representation of a given graph. The proposed computation is based on an OBDD-rewriting of the notion of Ackermann encoding of hereditarily finite sets into natural numbers.

2022-09-02T04:44:10.108Z

{ "ACL": null, "DBLP": "journals/tplp/PiazzaP04", "ArXiv": "cs/0311018", "MAG": "2037095133", "CorpusId": "844", "PubMed": null, "DOI": "10.1017/S1471068404002091", "PubMedCentral": null }

https://www.semanticscholar.org/paper/81e4796e571087628614bbb310298ed4e98dfcf0

Ackermann encoding, bisimulations and OBDDs

[ { "authorId": "1797462", "name": "C. Piazza" }, { "authorId": "1722508", "name": "A. Policriti" } ]

Theory and Practice of Logic Programming

2,003

41

19

0

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" }, { "category": "Mathematics", "source": "external" } ]

[ "JournalArticle" ]

2003-11-16T00:00:00

{ "name": "Theory and Practice of Logic Programming", "volume": "4", "pages": "695 - 718" }

[]

[ "binary decision diagrams", "ordered binary decision diagrams", "bdd", "variable ordering", "directed graphs", "weighted graph" ]

[ "weighted graph", "ordered binary decision diagrams", "bdd", "variable ordering", "binary decision diagrams", "directed graphs" ]

[ "graphic methods", "decision theory", "finite automata", "logic design", "boolean functions", "graph theory", "artificial intelligence", "automata theory", "field programmable gate array", "mathematics", "theoretical computer science", "computer science", "formal languages and automata theory", "computer hardware" ]

846

In this paper, we present a concurrency control mechanism that deals with three important issues in object-oriented databases (OODBs): semantics of methods, nested method invocation and referentially shared object. In our scheme, locks are required for the execution of methods instead of atomic operations. By doing this, we reduce the locking overhead and deadlocks due to lock escalation. Especially, if a method invokes one or more methods on the same object during its execution, our scheme does not incur additional overhead for those invoked methods. Also, we provide a way of automating commutativity of methods. In addition, we further increase concurrency with the use of runtime information.

2022-09-02T09:07:13.952Z

{ "ACL": null, "DBLP": "journals/joop/JunG98", "ArXiv": null, "MAG": "67943265", "CorpusId": "846", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/c11ec618db91843b08ecf7853fad8c1074dc40bd

Semantic-Based Concurrency Control in Object-Oriented Databases

[ { "authorId": "35209772", "name": "Woochun Jun" }, { "authorId": "144099017", "name": "L. Gruenwald" } ]

J. Object Oriented Program.

1,998

17

5

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

null

{ "name": "J. Object Oriented Program.", "volume": "10", "pages": "33-39" }

[ "object oriented database", "concurrency control", "semantics" ]

[ "semantics", "concurrency control", "database systems", "concurrent programming", "non-determinism" ]

[ "concurrent programming", "concurrency control", "object oriented database", "non-determinism", "semantics", "database systems" ]

[ "computer systems programming", "computer programming languages", "object oriented programming", "query languages", "automata theory", "computer systems", "software engineering", "computer programming", "formal languages and automata theory", "computer science", "theoretical computer science" ]

849

The paper discusses the basic principles and the architecture of the software toolkit for constructing knowledge-based systems which can be used cooperatively over computer networks and also embedded into larger software systems in dierent ways. Presented architecture is based on frame knowledge representation and production rules, which also allows to interface high-level programming languages and relational databases by exposing corresponding classes or database tables as frames. Frames located on the remote computers can also be transparently accessed and used in inference, and the dynamic knowledge for specific frames can also be transferred over the network. The issues of implementation of such a system are addressed, which use Java programming language, CORBA and XML for external knowledge representation. Finally, some applications of the toolkit are considered, including e-business approach to knowledge sharing, intelligent web behaviours, etc.

2022-06-20T10:50:05.995Z

{ "ACL": null, "DBLP": "journals/corr/cs-AI-0106054", "ArXiv": "cs/0106054", "MAG": "1541379198", "CorpusId": "849", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/1373d3294643dc1e4452eb4ae973efaee2ca4361

Software Toolkit for Building Embedded and Distributed Knowledge-based Systems

[ { "authorId": "3084135", "name": "D. Soshnikov" } ]

ArXiv

2,001

19

5

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2001-06-26T00:00:00

{ "name": "ArXiv", "volume": "cs.AI/0106054", "pages": null }

[ "computer networks", "knowledge representation", "knowledge based systems", "inference", "frames", "ebusiness", "programming languages", "knowledge-sharing", "xml", "high-level programming language", "relational database", "software", "database systems", "java", "software systems" ]

[ "software", "computer networks", "software systems", "frames", "knowledge representation", "programming languages", "relational database", "database systems", "inference", "java", "xml", "knowledge-sharing" ]

[ "computer networks", "knowledge representation", "knowledge based systems", "frames", "ebusiness", "programming languages", "knowledge-sharing", "xml", "database systems", "high-level programming language", "relational database", "software", "inference", "java", "software systems" ]

[ "computer science", "semantics", "artificial intelligence", "structural frames", "information technology", "computer programming languages", "linguistics", "knowledge management", "world wide web", "computer systems", "computer programming", "query languages", "inference engines", "object oriented programming", "high level languages", "software design", "hidden markov models", "markov random fields", "hidden markov model (hmm)", "internet", "software engineering", "markov processes", "image segmentation", "correlation analysis", "image analysis", "image processing", "mathematics", "computer imaging and vision" ]

852

Active polarimetric imagery allows one to access the information present in a scene by revealing polarizing properties of the objects [1, 2]. Coherent light is considered in this paper as illumination of the scene, the images are thus degraded by speckle noise. The polarization properties of a scene are characterized by the degree of polarization. In standard polarimetric imagery system, four intensity images are needed to estimate this degree [3]. If we assume the uncorrelation of the measurements, this number can be decreased to two images using the Orthogonal State Contrast Image (OSCI) [4]. However, this approach appears too restrictive in some cases. We thus propose in this paper a new statistical parametric method to estimate the degree of polarization assuming correlated measurements with only two intensity images. The estimators obtained from four images, from the OSCI and from the proposed method, are compared using simulated polarimetric data degraded by speckle noise.

2022-08-28T19:27:19.219Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0606073", "ArXiv": "cs/0606073", "MAG": "1589985033", "CorpusId": "852", "PubMed": null, "DOI": "10.5281/ZENODO.39740", "PubMedCentral": null }

https://www.semanticscholar.org/paper/a21114750fa048d2c7e82125f49725b2a395467a

Comparison of the estimation of the degree of polarization from four or two intensity images degraded by speckle noise

[ { "authorId": "39626956", "name": "M. Roche" }, { "authorId": "1719030", "name": "P. Réfrégier" } ]

2006 14th European Signal Processing Conference

2,006

13

2

0

false

[ { "category": "Mathematics", "source": "s2-fos-model" }, { "category": "Physics", "source": "s2-fos-model" }, { "category": "Physics", "source": "external" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle", "Conference" ]

2006-06-15T00:00:00

{ "name": "2006 14th European Signal Processing Conference", "volume": null, "pages": "1-4" }

[ "speckle noise", "polarimetric sar" ]

[ "speckle", "speckle noise", "polarimetric sar", "color images", "reference image" ]

[ "speckle noise", "polarimetric sar", "reference image", "speckle", "color images" ]

[ "polarographic analysis", "image matching", "image quality", "synthetic aperture radar", "pattern recognition", "color image processing", "polarimeters", "image processing", "image analysis", "imaging systems", "radar", "machine learning", "image segmentation", "computer imaging and vision", "image reconstruction", "signal processing", "computer hardware", "artificial intelligence", "computer science", "engineering" ]

853

We use the incompressibility method based on Kolmogorov complexity to determine the total number of bits of routing information for almost all network topologies. In most models for routing, for almost all labeled graphs, $\Theta (n^2)$ bits are necessary and sufficient for shortest path routing. By "almost all graphs" we mean the Kolmogorov random graphs which constitute a fraction of 1 - 1/nc of all graphs on n nodes, where c > 0 is an arbitrary fixed constant. There is a model for which the average case lower bound rises to $\Omega(n^2 \log n )$ and another model where the average case upper bound drops to $O(n \log^2 n)$. This clearly exposes the sensitivity of such bounds to the model under consideration. If paths have to be short, but need not be shortest (if the stretch factor may be larger than 1), then much less space is needed on average, even in the more demanding models. Full-information routing requires $\Theta (n^3)$ bits on average. For worst-case static networks we prove an $\Omega(n^2 \log n )$ lower bound for shortest path routing and all stretch factors < 2 in some networks where free relabeling is not allowed.

2022-09-04T06:24:28.311Z

{ "ACL": null, "DBLP": "journals/siamcomp/BuhrmanHV99", "ArXiv": "cs/9903009", "MAG": "2951594419", "CorpusId": "853", "PubMed": null, "DOI": "10.1137/S0097539796308485", "PubMedCentral": null }

https://www.semanticscholar.org/paper/5b98a62751e452f568a7920b2a654c42af550660

Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method

[ { "authorId": "1747509", "name": "H. Buhrman" }, { "authorId": "1799227", "name": "J. Hoepman" }, { "authorId": "46641506", "name": "P. Vitányi" } ]

SIAM J. Comput.

1,999

30

17

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-03-01T00:00:00

{ "name": "SIAM J. Comput.", "volume": "28", "pages": "1414-1432" }

[ "shortest path routing", "random graphs", "routing table", "routing information", "routing algorithms" ]

[ "efficient routing", "routing scheme", "routing algorithms", "routing table", "shortest path", "random graphs", "shortest path routing" ]

[ "shortest path routing", "random graphs", "routing table", "routing information", "routing scheme", "routing algorithms", "efficient routing", "shortest path" ]

[ "network routing", "graph theory", "random processes", "routing protocols", "ad hoc networks", "computer networks", "theoretical computer science", "probability", "routers", "wireless telecommunication systems", "mobile telecommunication systems", "internet protocols", "quality of service", "wireless local area networks (wlan)", "multicasts", "sensors", "computer science", "mathematics", "telecommunication traffic", "bandwidth", "communication systems", "telecommunication systems", "communication channels", "telecommunication networks", "local area networks", "data communication systems", "computer hardware", "computer systems" ]

855

This note carries three purposes involving our latest advances on the radial basis function (RBF) approach. First, we will introduce a new scheme employing the boundary knot method (BKM) to nonlinear convection-diffusion problem. It is stressed that the new scheme directly results in a linear BKM formulation of nonlinear problems by using response point-dependent RBFs, which can be solved by any linear solver. Then we only need to solve a single nonlinear algebraic equation for desirable unknown at some inner node of interest. The numerical results demonstrate high accuracy and efficiency of this nonlinear BKM strategy. Second, we extend the concepts of distance function, which include time-space and variable transformation distance functions. Finally, we demonstrate that if the nodes are symmetrically placed, the RBF coefficient matrices have either centrosymmetric or skew centrosymmetric structures. The factorization features of such matrices lead to a considerable reduction in the RBF computing effort. A simple approach is also presented to reduce the ill-conditioning of RBF interpolation matrices in general cases.

2022-06-20T11:51:06.482Z

{ "ACL": null, "DBLP": "journals/corr/cs-CE-0106003", "ArXiv": "cs/0106003", "MAG": "1663735089", "CorpusId": "855", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/48b43ac6393690ca4e4917bf7215988e72ca9dae

A note on radial basis function computing

[ { "authorId": "50504621", "name": "W. Chen" }, { "authorId": "2107123379", "name": "W. He" } ]

ArXiv

2,001

14

6

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" }, { "category": "Mathematics", "source": "external" } ]

[ "JournalArticle" ]

2001-06-03T00:00:00

{ "name": "ArXiv", "volume": "cs.CE/0106003", "pages": null }

[ "radial basis functions", "convection-diffusion", "factorization", "numerical results" ]

[ "radial basis functions", "convection-diffusion", "numerical results", "factorization", "multilayer perceptrons" ]

[ "numerical results", "radial basis functions", "convection-diffusion", "factorization", "multilayer perceptrons" ]

[ "wireless telecommunication systems", "numerical methods", "neural networks", "diffusion in liquids", "matrix algebra", "computer networks", "communication systems", "telecommunication systems", "mathematics", "machine learning", "partial differential equations", "computer science", "computer systems", "artificial intelligence" ]

857

Besides temporal information explicitly available in verbs and adjuncts, the temporal interpretation of a text also depends on general world knowledge and default assumptions. We will present a theory for describing the relation between, on the one hand, verbs, their tenses and adjuncts and, on the other, the eventualities and periods of time they represent and their relative temporal locations. The theory is formulated in logic and is a practical implementation of the concepts described in Ness Schelkens et al. We will show how an abductive resolution procedure can be used on this representation to extract temporal information from texts.

2022-09-02T18:35:32.878Z

{ "ACL": null, "DBLP": "conf/clin/VerdoolaegeDSSE99", "ArXiv": "cs/0011034", "MAG": "2142929715", "CorpusId": "857", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/7977fef5d3bacf0f645574f457d485fa15ab8813

Semantic interpretation of temporal information by abductive inference

[ { "authorId": "1772079", "name": "Sven Verdoolaege" }, { "authorId": "1700695", "name": "M. Denecker" }, { "authorId": "2286672", "name": "Ness Schelkens" }, { "authorId": "1714620", "name": "D. D. Schreye" }, { "authorId": "1728333", "name": "F. V. Eynde" } ]

CLIN

2,000

16

2

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Philosophy", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2000-11-22T00:00:00

{ "name": "ArXiv", "volume": "cs.CL/0011034", "pages": null }

[ "inference", "semantics" ]

[ "semantics", "reasoning", "inference", "temporal correlations", "user information" ]

[ "temporal correlations", "reasoning", "user information", "semantics", "inference" ]

[ "spatial correlations", "image coding", "ontology", "formal languages", "recommender systems", "personal information", "inference engines", "correlation methods", "image processing", "linguistics", "formal languages and automata theory", "information retrieval", "privacy", "artificial intelligence", "mathematics", "computer imaging and vision", "theoretical computer science", "computer science", "computer security" ]

858

An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are of particular interest because they admit analytical designs and simple, practical hardware implementation. Contention-free interleavers have been recently shown to be suitable for parallel decoding of turbo codes. In this correspondence, it is shown that permutation polynomials generate maximum contention-free interleavers, i.e., every factor of the interleaver length becomes a possible degree of parallel processing of the decoder. Further, it is shown by computer simulations that turbo codes using these interleavers perform very well for the Third Generation Partnership Project (3GPP) standard

2022-09-04T11:28:54.194Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0506093", "ArXiv": "cs/0506093", "MAG": "2100098924", "CorpusId": "858", "PubMed": null, "DOI": "10.1109/TIT.2005.864450", "PubMedCentral": null }

https://www.semanticscholar.org/paper/6c321471ca4a963c9f6c612eadf3e52eea850f3c

On maximum contention-free interleavers and permutation polynomials over integer rings

[ { "authorId": "1693872", "name": "O. Takeshita" } ]

IEEE Transactions on Information Theory

2,005

43

173

13

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" }, { "category": "Mathematics", "source": "external" } ]

[ "JournalArticle" ]

2005-06-24T00:00:00

{ "name": "IEEE Transactions on Information Theory", "volume": "52", "pages": "1249-1253" }

[ "parallel processing", "coding performance", "contention-free", "turbo codes", "channel coding", "3gpp", "hardware implementations", "interleavers" ]

[ "interleavers", "turbo codes", "computer hardware", "hardware implementations", "parallel processing", "3gpp" ]

[ "parallel processing", "computer hardware", "coding performance", "contention-free", "turbo codes", "channel coding", "3gpp", "hardware implementations", "interleavers" ]

[ "parallel algorithms", "computer science", "video coding", "imaging systems", "contention-based", "quadrature amplitude modulation", "signal encoding", "low-density parity-check codes", "convolutional codes", "code division multiple access", "additive white gaussian noise", "data communication systems", "image coding", "bit error rate", "fading channels", "channel capacity", "lte", "field programmable gate array", "parallel processing systems", "video processing", "visual communication", "motion estimation", "image reconstruction", "mac protocol", "wireless sensor networks", "local area networks", "fading (radio)", "rayleigh fading", "orthogonal frequency division multiplexing", "communication channels", "signal to noise ratio", "iterative decoding", "graph theory", "matrix algebra", "information theory", "white noise", "gaussian noise (electronic)", "computer systems", "image processing", "probability", "mobile telecommunication systems", "distributed systems", "computer imaging and vision", "image analysis", "medium access control", "wireless telecommunication systems", "wireless communications", "energy utilization", "sensor nodes", "routing algorithms", "signal detection", "signal processing", "theoretical computer science", "mathematics", "communication", "telecommunication networks", "distributed computer systems", "network protocols", "computer networks", "communication systems", "telecommunication systems", "electricity", "sensors", "engineering", "internet" ]

862

The automated manufacturing system (AMS) scheduling complexity increases with products customization, due dates, alternative routes and no foresee demand in the system. One of the important aspects in shop floor is to ensure that the parts will be at the right position and at the defined time. In this sense it's necessary to have a good transportation system, which allows flexibility and integration, considering a designed performance to the manufacturing system. AGVs have been used to reach this performance, but there is a serious problem for the dispatching rule definition. There are some dispatching techniques using single rule and composed ones, where the main idea is to consider a good performance for the entire manufacturing system. This work presents an approach for a definition of an AGV dispatching rule based on fuzzy logic, that considers the actual status of the manufacturing system and takes the decision on real time.

2022-09-04T02:28:02.315Z

{ "ACL": null, "DBLP": "conf/smc/BenincasaMK03", "ArXiv": null, "MAG": "1483799088", "CorpusId": "862", "PubMed": null, "DOI": "10.1109/ICSMC.2003.1245673", "PubMedCentral": null }

https://www.semanticscholar.org/paper/43e53edb7b0670aa5dc7aa18c957c49fd5907608

Reactive fuzzy dispatching rule for automated guided vehicles

[ { "authorId": "143896725", "name": "Alcides Xavier Benincasa" }, { "authorId": "2196424", "name": "O. Morandin" }, { "authorId": "3299509", "name": "E. Kato" } ]

SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483)

2,003

35

18

0

false

[ { "category": "Business", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle", "Conference" ]

2003-11-17T00:00:00

{ "name": "SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483)", "volume": "5", "pages": "4375-4380 vol.5" }

[ "rule base", "agv", "automated guided vehicles", "automated manufacturing systems" ]

[ "vehicles", "flexible manufacturing systems", "agv", "automated guided vehicles", "routing scheme", "rule base", "flexible manufacturing" ]

[ "agv", "flexible manufacturing systems", "routing scheme", "automated guided vehicles", "automated manufacturing systems", "vehicles", "flexible manufacturing", "rule base" ]

[ "petri nets", "routing protocols", "routing algorithms", "mobile robots", "automation", "dense wavelength division multiplexing", "engineering", "knowledge based systems", "graph theory", "routers", "wireless telecommunication systems", "computer networks", "robotics", "optical switches", "light transmission", "multiplexing", "artificial intelligence", "theoretical computer science", "telecommunication traffic", "bandwidth", "communication systems", "telecommunication systems", "computer science", "packet switching", "wavelength division multiplexing", "fiber optic networks", "optical materials", "optical fibers", "communication channels", "signal to noise ratio", "telecommunication networks", "computer systems", "packet networks", "data communication systems", "sensors", "signal processing", "computer hardware" ]

863

Most modern formalisms used in Databases and Artificial Intelligence for describing an application domain are based on the notions of class (or concept) and relationship among classes. One interesting feature of such formalisms is the possibility of defining a class, i.e., providing a set of properties that precisely characterize the instances of the class. Many recent articles point out that there are several ways of assigning a meaning to a class definition containing some sort of recursion. In this paper, we argue that, instead of choosing a single style of semantics, we achieve better results by adopting a formalism that allows for different semantics to coexist. We demonstrate the feasibility of our argument, by presenting a knowledge representation formalism, the description logic µALCQ, with the above characteristics. In addition to the constructs for conjunction, disjunction, negation, quantifiers, and qualidied number restrictions, µALCQ includes special fixpoint constructs to express (suitably interpreted) recursive definitions. These constructs enable the usual frame-based descriptions to be combined with definitions of recursive data structures such as directed acyclic graphs, lists, streams, etc. We establish several properties of µALCQ, including the decidability and the computational complexity of reasoning, by formulating a correspondence with a particular modal logic of programs called the modal mu-calculus.

2022-09-03T11:10:40.800Z

{ "ACL": null, "DBLP": "journals/jair/GiacomoL97", "ArXiv": "cs/9703101", "MAG": "3087273953", "CorpusId": "863", "PubMed": null, "DOI": "10.1613/jair.334", "PubMedCentral": null }

https://www.semanticscholar.org/paper/183fc4c5c4b9163a71836bf79b92c507720e4eb0

A Uniform Framework for Concept Definitions in Description Logics

[ { "authorId": "1719219", "name": "Giuseppe De Giacomo" }, { "authorId": "1729232", "name": "M. Lenzerini" } ]

J. Artif. Intell. Res.

1,997

48

3

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

1997-02-01T00:00:00

{ "name": "ArXiv", "volume": "cs.AI/9703101", "pages": null }

[ "modal logic", "knowledge representation", "reasoning", "artificial intelligence", "directed acyclic graphs", "semantics", "database systems", "description logic" ]

[ "description logic", "modal logic", "modeling languages", "database systems", "artificial intelligence", "semantics", "knowledge representation", "reasoning" ]

[ "modal logic", "modeling languages", "reasoning", "knowledge representation", "artificial intelligence", "directed acyclic graphs", "semantics", "database systems", "description logic" ]

[ "formal logic", "computational linguistics", "software engineering", "linguistics", "ontology", "formal languages", "knowledge based systems", "computer science", "graph theory", "computer systems", "formal languages and automata theory", "theoretical computer science" ]

864

Searching techniques for Case Based Reasoning systems involve extensive methods of elimination. In this paper, we look at a new method of arriving at the right solution by performing a series of transformations upon the data. These involve N-gram based comparison and deduction of the input data with the case data, using Morphemes and Phonemes as the deciding parameters. A similar technique for eliminating possible errors using a noise removal function is performed. The error tracking and elimination is performed through a statistical analysis of obtained data, where the entire data set is analyzed as sub-categories of various etymological derivatives. A probability analysis for the closest match is then performed, which yields the final expression. This final expression is referred to the Case Base. The output is redirected through an Expert System based on best possible match. The threshold for the match is customizable, and could be set by the Knowledge-Architect.

2022-09-04T21:05:19.672Z

{ "ACL": null, "DBLP": "journals/corr/cs-AI-0407009", "ArXiv": "cs/0407009", "MAG": "1649985068", "CorpusId": "864", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/504a04165ce3868d2c8e762b820f99de3765b094

Search Using N-gram Technique Based Statistical Analysis for Knowledge Extraction in Case Based Reasoning Systems

[ { "authorId": "36686470", "name": "M. Karthik" }, { "authorId": "2110695562", "name": "Moshe Davis" } ]

ArXiv

2,004

5

9

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2004-07-02T00:00:00

{ "name": "ArXiv", "volume": "cs.AI/0407009", "pages": null }

[ "case based reasoning", "correlation analysis", "case base", "probability", "expert systems", "noise removal" ]

[ "correlation analysis", "reasoning", "noise removal", "probability", "case base", "expert systems" ]

[ "case based reasoning", "reasoning", "correlation analysis", "case base", "expert systems", "probability", "noise removal" ]

[ "knowledge based systems", "ontology", "formal languages", "mathematics", "artificial intelligence", "impulse noise", "image enhancement", "spurious signal noise", "semantics", "linguistics", "formal languages and automata theory", "computer science", "gaussian noise (electronic)", "radio", "image analysis", "image processing", "communication channels", "signal to noise ratio", "theoretical computer science", "wireless telecommunication systems", "computer imaging and vision", "signal processing", "computer networks", "communication systems", "telecommunication systems", "engineering", "computer systems" ]

866

In this paper we introduce the notion of approximate da2a siruclures, in which a small amount of error is tolerated in the output. Approximate data structures trade error of approximation for faster operation, leading to theoretical and practical speedups for a wide variety of algorithms. We give approximate variants of the van Emde Boas data structure, which support the same dynamic operations as the standard van Emde Boas data structure [28, 201, except that answers to queries are approximate. The variants support all operations in constant time provided the error of approximation is l/polylog(n), and in O(loglog n) time provided the error is l/polynomial(n), for n elements in the data structure. We consider the tolerance of prototypical algorithms to approximate data structures. We study in particular Prim’s minimumspanning tree algorithm, Dijkstra’s single-source shortest paths algorithm, and an on-line variant of Graham’s convex hull algorithm. To obtain output which approximates the desired output with the error of approximation tending to zero, Prim’s algorithm requires only linear time, Dijkstra’s algorithm requires O(mloglogn) time, and the on-line variant of Graham’s algorithm requires constant amortized time per operation.

2022-09-02T20:00:03.982Z

{ "ACL": null, "DBLP": "conf/soda/MatiasVY94", "ArXiv": "cs/0205010", "MAG": "2953069825", "CorpusId": "866", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/b5fa11ed4c1cff8b73602be49e21a5ef3dd84cb8

Approximate data structures with applications

[ { "authorId": "1745572", "name": "Y. Matias" }, { "authorId": "1725956", "name": "J. Vitter" }, { "authorId": "1693869", "name": "N. Young" } ]

SODA '94

1,994

50

26

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" }, { "category": "Mathematics", "source": "external" } ]

[ "JournalArticle" ]

1994-01-23T00:00:00

{ "name": null, "volume": null, "pages": "187-194" }

[ "dijkstra", "trade", "shortest path problem", "minimum spanning trees" ]

[ "trade", "adaptive algorithms", "dijkstra", "shortest path", "integrated data", "hybrid algorithms" ]

[ "trade", "integrated data", "dijkstra", "hybrid algorithms", "shortest path problem", "minimum spanning trees", "adaptive algorithms", "shortest path" ]

[ "commerce", "data integration", "computer networks", "evolutionary algorithms", "particle swarm optimization (pso)", "graph theory", "software", "economics", "data handling", "computer science", "genetic algorithms", "optimization problems", "optimization", "swarm intelligence", "theoretical computer science", "database systems", "artificial intelligence", "correlation analysis", "mathematics", "computer systems" ]

870

This paper describes a novel method of compiling ranked tagging rules into a deterministic finite-state device called a bimachine. The rules are formulated in the framework of regular rewrite operations and allow unrestricted regular expressions in both left and right rule contexts. The compiler is illustrated by an application within a speech synthesis system.

2022-08-24T21:25:38.972Z

{ "ACL": "C04-1029", "DBLP": "journals/corr/cs-CL-0407046", "ArXiv": "cs/0407046", "MAG": "2155942050", "CorpusId": "870", "PubMed": null, "DOI": "10.3115/1220355.1220384", "PubMedCentral": null }

https://www.semanticscholar.org/paper/395726282e91718aa94dcbd3d9f2c5870c477730

A Bimachine Compiler for Ranked Tagging Rules

[ { "authorId": "1718399", "name": "Wojciech Skut" }, { "authorId": "2066353418", "name": "Stefan Ulrich" }, { "authorId": "1996584", "name": "Kathrine Hammervold" } ]

COLING

2,004

25

9

0

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle", "Conference" ]

2004-07-19T00:00:00

{ "name": "ArXiv", "volume": "cs.CL/0407046", "pages": null }

[ "speech synthesis system", "deterministic", "compiler" ]

[ "compiler", "deterministic", "speech synthesis system", "rule base", "synthetic speech" ]

[ "speech synthesis system", "synthetic speech", "deterministic", "rule base", "compiler" ]

[ "synthesized speech", "speech communication", "stochastic", "knowledge based systems", "program compilers", "embedded systems", "hidden markov models", "hidden markov model (hmm)", "linguistics", "stochastic processes", "stochasticity", "artificial intelligence", "parallel processing systems", "computer programming languages", "computer systems", "markov processes", "probability", "numerical model", "computer science", "distributed systems", "computer programming", "correlation analysis", "mathematics", "distributed computer systems" ]

871

In this work, we present a new structure for multiplication in finite fields. This structure is based on a digit-level LFSR (Linear Feedback Shift Register) multiplier, in which the area of the digit-multipliers is reduced using the Karatsuba method. We compare our results with the other works of the literature for F397. Furthermore, we propose new formulas for multiplication in F36 97. These new formulas reduce the number of F397-multiplications from 18 to 15. The finite fields F397 and F36 97 are important fields for pairing based cryptography.

2022-06-21T09:15:44.038Z

{ "ACL": null, "DBLP": "conf/fpl/ShokrollahiGP07", "ArXiv": "0708.3022", "MAG": "2741149757", "CorpusId": "871", "PubMed": null, "DOI": "10.1109/FPL.2007.4380669", "PubMedCentral": null }

https://www.semanticscholar.org/paper/8c5bf6010fe44208fb4c2b981966ee004a5e9fb9

Efficient FPGA-Based Multipliers for F397 and F36.97

[ { "authorId": "2481773", "name": "J. Shokrollahi" }, { "authorId": "1776112", "name": "E. Gorla" }, { "authorId": "2832585", "name": "Christoph Puttmann" } ]

2007 International Conference on Field Programmable Logic and Applications

2,007

25

4

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", "Conference" ]

2007-08-22T00:00:00

{ "name": "2007 International Conference on Field Programmable Logic and Applications", "volume": null, "pages": "339-344" }

[ "multiplier", "pairing-based cryptography", "finite fields", "multiplication", "linear feedback shift registers", "shift registers" ]

[ "field programmable gate array", "multiplier", "multiplication", "finite fields", "linear feedback shift registers", "shift registers", "cryptography" ]

[ "multiplier", "pairing-based cryptography", "finite fields", "multiplication", "cryptography", "linear feedback shift registers", "shift registers", "field programmable gate array" ]

[ "frequency multiplying circuits", "tate pairing", "information theory", "multiplying circuits", "cryptology", "stream ciphers", "integrated circuit testing", "computer hardware", "elliptic curve", "communication", "adders", "integrated circuit layout", "digital signal processing", "computer security", "security of data", "computer science", "vlsi circuits", "digital arithmetic", "computer aided design", "microprocessor chips", "signal processing", "mathematics", "engineering" ]

872

Performance of object-oriented database systems (OODBs) is still an issue to both designers and users nowadays. The aim of this paper is to propose a generic discrete-event random simulation model, called VOODB, in order to evaluate the performances of OODBs in general, and the performances of optimization methods like clustering in particular. Such optimization methods undoubtedly improve the performances of OODBs. Yet, they also always induce some kind of overhead for the system. Therefore, it is important to evaluate their exact impact on the overall performances. VOODB has been designed as a generic discrete-event random simulation model by putting to use a modelling approach, and has been validated by simulating the behavior of the O2 OODB and the Texas persistent object store. Since our final objective is to compare object clustering algorithms, some experiments have also been conducted on the DSTC clustering technique, which is implemented in Texas. To validate VOODB, performance results obtained by simulation for a given experiment have been compared to the results obtained by benchmarking the real systems in the same conditions. Benchmarking and simulation performance evaluations have been observed to be consistent, so it appears that simulation can be a reliable approach to evaluate the performances of OODBs.

2022-08-01T17:38:33.920Z

{ "ACL": null, "DBLP": "conf/vldb/DarmontS99", "ArXiv": "0705.0450", "MAG": "1616397508", "CorpusId": "872", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/6aefb1c00d79a64e92ef8c63364b323f12ca53ae

VOODB: A Generic Discrete-Event Random Simulation Model To Evaluate the Performances of OODBs

[ { "authorId": "145025853", "name": "J. Darmont" }, { "authorId": "145513266", "name": "Michel Schneider" } ]

VLDB

1,999

39

15

4

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle", "Conference" ]

1999-09-07T00:00:00

{ "name": null, "volume": null, "pages": "254-265" }

[ "object oriented database", "clustering algorithms", "clustering methods", "database systems", "optimization problems" ]

[ "object oriented database", "database systems", "optimization", "optimization problems", "clustering algorithms" ]

[ "object oriented database", "optimization", "clustering algorithms", "clustering methods", "database systems", "optimization problems" ]

[ "object oriented programming", "query languages", "mathematics", "data mining", "computer systems", "correlation analysis", "computer programming", "computer science" ]

873

Open communications over the Internet pose serious threats to countries with repressive regimes, leading them to develop and deploy censorship mechanisms within their networks. Unfortunately, existing censorship circumvention systems do not provide high availability guarantees to their users, as censors can easily identify, hence disrupt, the traffic belonging to these systems using today’s advanced censorship technologies. In this paper, we propose Serving the Web by Exploiting Email Tunnels (SWEET), a highly available censorship-resistant infrastructure. SWEET works by encapsulating a censored user’s traffic inside email messages that are carried over public email services like Gmail and Yahoo Mail. As the operation of SWEET is not bound to any specific email provider, we argue that a censor will need to block email communications all together in order to disrupt SWEET, which is unlikely as email constitutes an important part of today’s Internet. Through experiments with a prototype of our system, we find that SWEET’s performance is sufficient for Web browsing. In particular, regular Websites are downloaded within couple of seconds.

2022-08-29T18:14:31.298Z

{ "ACL": null, "DBLP": "journals/ton/HoumansadrZCB17", "ArXiv": "1211.3191", "MAG": "1573930428", "CorpusId": "873", "PubMed": null, "DOI": "10.1109/TNET.2016.2640238", "PubMedCentral": null }

https://www.semanticscholar.org/paper/0af0b8fdde60e8237e55c301007565c53b4d0f1f

SWEET: Serving the Web by Exploiting Email Tunnels

[ { "authorId": "1972973", "name": "A. Houmansadr" }, { "authorId": "2118882066", "name": "Wenxuan Zhou" }, { "authorId": "1795621", "name": "Matthew C. Caesar" }, { "authorId": "145161823", "name": "N. Borisov" } ]

IEEE/ACM Transactions on Networking

2,012

56

39

5

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2012-11-13T00:00:00

{ "name": "IEEE/ACM Transactions on Networking", "volume": "25", "pages": "1517-1527" }

[ "email messages", "high availability", "web browsing", "email", "email communication", "communication", "internet" ]

[ "email", "email messages", "communication", "internet", "high availability", "email communication", "web browsing" ]

[ "email messages", "high availability", "web browsing", "email", "email communication", "communication", "internet" ]

[ "electronic mail", "fault tolerance", "telecommunication networks", "cloud computing", "world wide web", "user interfaces", "computer science", "software quality", "fault tolerant computer systems", "telecommunication systems", "computer systems", "human computer interaction", "software design", "computer networks", "distributed computer systems", "software engineering" ]

875

Angular Voronoi diagram was introduced by Asano et al. as fundamental research for a mesh generation. In an angular Voronoi diagram, the edges are curves of degree three. From view of computational robustness we need to treat the curves carefully, because they might have a singularity. We enumerate all the possible types of curves that appear as an edge of an angular Voronoi diagram, which tells us what kind of degeneracy is possible and tells us necessity of considering a singularity for computational robustness.

2022-06-20T11:42:24.309Z

{ "ACL": null, "DBLP": "journals/corr/abs-0710-0925", "ArXiv": "0710.0925", "MAG": "2953322892", "CorpusId": "875", "PubMed": null, "DOI": "10.1109/ISVD.2007.14", "PubMedCentral": null }

https://www.semanticscholar.org/paper/1ee008e00476b4f1f82e29c37cb1c732978b0830

Degeneracy of Angular Voronoi Diagram

[ { "authorId": "1994850", "name": "H. Muta" }, { "authorId": "2110051781", "name": "Kimikazu Kato" } ]

4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)

2,007

8

3

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" }, { "category": "Physics", "source": "external" }, { "category": "Mathematics", "source": "external" } ]

[ "JournalArticle" ]

2007-07-09T00:00:00

{ "name": "4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)", "volume": null, "pages": "288-293" }

[ "voronoi diagrams", "singularity" ]

[ "voronoi diagrams", "voronoi", "singularity", "voronoi cell", "voronoi regions" ]

[ "voronoi cell", "voronoi diagrams", "voronoi regions", "singularity", "voronoi" ]

[ "graphic methods", "parallel manipulators", "graph theory", "robotic manipulators", "theoretical computer science", "robots", "computer science", "robotics" ]

877

A fully abstract and universal domain model for modal transition systems and refinement, developed in (27), is shown to be a maximal-points space model for the bisim- ulation quotient of labelled transition systems over a finite set of events. In this domain model we prove that this quotient is a Stone space whose compact, zero-dimensional, and ultra-metrizable Hausdorff topology measures the degree of bisimilarity and that image- finite labelled transition systems are dense. Using this compactness we show that the set of labelled transition systems that refine a modal transition system, its "set of implemen- tations," is compact and derive a compactness theorem for Hennessy-Milner logic on such implementation sets. These results extend to systems that also have partially specified state propositions, unify existing denotational, operational, and metric semantics on par- tial processes, render robust consistency measures for modal transition systems, and yield an abstract interpretation of compact sets of labelled transition systems as Scott-closed sets of modal transition systems.

2022-09-03T10:27:42.112Z

{ "ACL": null, "DBLP": "journals/lmcs/Huth05", "ArXiv": "cs/0412063", "MAG": "2047702174", "CorpusId": "877", "PubMed": null, "DOI": "10.2168/LMCS-1(1:1)2005", "PubMedCentral": null }

https://www.semanticscholar.org/paper/61dfbd2678773203686ec349adc38379c4f4a92c

Labelled transition systems as a Stone space

[ { "authorId": "145544446", "name": "M. Huth" } ]

Log. Methods Comput. Sci.

2,004

53

15

1

true

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Mathematics", "source": "s2-fos-model" }, { "category": "Mathematics", "source": "external" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2004-12-15T00:00:00

{ "name": "ArXiv", "volume": "abs/cs/0412063", "pages": null }

[ "abstract interpretation", "transition system", "topology", "semantics" ]

[ "transition system", "topology", "semantics", "abstract interpretation", "network topology" ]

[ "transition system", "network topology", "topology", "semantics", "abstract interpretation" ]

[ "model checking", "computer networks", "static analysis", "embedded systems", "architecture verification and validation", "computer science", "software engineering", "program compilers", "computer systems", "architecting", "parallel processing systems", "computer programming languages", "software architecture", "distributed systems", "computer programming", "software design", "distributed computer systems" ]

881

We consider the structures given by repeatedly generalising the definition of finite state automata by symmetry considerations, and constructing analogues of transition monoids at each step. This approach first gives us non-deterministic automata, then (non-deterministic) two-way automata and bounded Turing machines --- that is, Turing machines where the read / write head is unable to move past the end of the input word. In the case of two-way automata, the transition monoids generalise to endomorphism monoids in compact closed categories. These use Girard's resolution formula (from the Geometry of Interaction representation of linear logic) to construct the images of singleton words. In the case of bounded Turing machines, the transition homomorphism generalises to a monoid homomorphism from the natural numbers to a monoid constructed from the union of endomorphism monoids of a compact closed category, together with an appropriate composition. These use Girard's execution formula (also from the Geometry of Interaction representation of linear logic) to construct images of singletons.

2022-07-28T03:53:27.259Z

{ "ACL": null, "DBLP": "journals/corr/cs-LO-9812019", "ArXiv": "cs/9812019", "MAG": "1673357231", "CorpusId": "881", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/6e2237b114eb77ff8c5f7d5290ed46fcd63154cf

Symmetries and transitions of bounded Turing machines

[ { "authorId": "31469144", "name": "P. Hines" } ]

ArXiv

1,998

34

0

false

[ { "category": "Mathematics", "source": "s2-fos-model" }, { "category": "Mathematics", "source": "external" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

1998-12-16T00:00:00

{ "name": "ArXiv", "volume": "cs.LO/9812019", "pages": null }

[ "linear logic", "geometry", "finite state automata", "turing machines", "automata" ]

[ "turing machines", "finite state automata", "automata", "deterministic", "deterministic automata", "geometry", "linear logic" ]

[ "linear logic", "geometry", "finite state automata", "deterministic", "turing machines", "automata", "deterministic automata" ]

[ "logic programming", "translation (languages)", "finite automata", "stochastic", "automata theory", "formal languages", "computer programming languages", "formal logic", "computational linguistics", "linguistics", "stochastic processes", "stochasticity", "formal languages and automata theory", "computer programming", "artificial intelligence", "database systems", "probability", "numerical model", "theoretical computer science", "computer science", "computer systems", "mathematics" ]

882

We develop graph theoretic methods for analysing maximally entangled pure states distributed between a number of different parties. We introduce a technique called {\it bicolored merging}, based on the monotonicity feature of entanglement measures, for determining combinatorial conditions that must be satisfied for any two distinct multiparticle states to be comparable under local operations and classical communication (LOCC). We present several results based on the possibility or impossibility of comparability of pure multipartite states. We show that there are exponentially many such entangled multipartite states among $n$ agents. Further, we discuss a new graph theoretic metric on a class of multi-partite states, and its implications.

2022-09-03T02:46:56.569Z

{ "ACL": null, "DBLP": "journals/corr/quant-ph-0406135", "ArXiv": "quant-ph/0406135", "MAG": "1516880671", "CorpusId": "882", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/d961fd7946466f8aa0fba090e83e86fd38c9a609

A combinatorial approach for studying LOCC transformations of multipartite states

[ { "authorId": "2109038109", "name": "S. Singh" }, { "authorId": "1803487", "name": "S. P. Pal" }, { "authorId": "2143910615", "name": "Somesh Kumar" }, { "authorId": "143622743", "name": "R. Srikanth" } ]

ArXiv

2,004

46

2

0

false

[ { "category": "Computer Science", "source": "s2-fos-model" }, { "category": "Computer Science", "source": "external" }, { "category": "Mathematics", "source": "external" }, { "category": "Physics", "source": "external" } ]

[ "JournalArticle" ]

2004-06-18T00:00:00

{ "name": "ArXiv", "volume": "quant-ph/0406135", "pages": null }

[ "communication" ]

[ "communication", "multiagent system", "combinatorial problems", "directed graphs", "weighted graph" ]

[ "weighted graph", "combinatorial problems", "communication", "directed graphs", "multiagent system" ]

[ "graphic methods", "combinatorial mathematics", "graph theory", "artificial intelligence", "theoretical computer science", "computer science" ]

884

Abstract Dung’s abstract framework for argumenta-tion enables a study of the interactions be-tween arguments based solely on an “attack”binary relation on the set of arguments. Var-ious ways to solve conﬂicts between contra-dictory pieces of information have been pro-posed in the context of argumentation, non-monotonic reasoning or logic programming,and can be captured by appropriate seman-tics within Dung’s framework. A commonfeature of these semantics is that one canalways maximize in some sense the set ofacceptable arguments. We propose in thispaper to extend Dung’s framework in orderto allow for the representation of what wecall “restricted” arguments: these argumentsshould only be used if absolutely necessary,that is, in order to support other argumentsthat would otherwise be defeated. We mod-ify Dung’s preferred semantics accordingly: aset ofargumentsbecomesacceptable onlyif itcontains a minimum of restricted arguments,for a maximum of unrestricted arguments. 1 INTRODUCTION Argumentation is a form of reasoning that has recentlycaptured the interest of many researchers in the Arti-ﬁcial Intelligence community, among others. An ab-stract framework for studying it has been proposedby Dung [Dung, 1995]. It is based on the assumptionthat the process of argumentation is built from twotypes of jobs: the formation of arguments, associatedwith the interactions that exist between them; and theevaluation of the validity of the arguments. A form ofinteraction between arguments that is often diﬃcultto ignore is contradiction, since a usual basic measureof the validity of a piece of reasoning is the level ofself-contradiction it contains. In Dung’s approach, anargumentation framework consists of two elements: aset of arguments, and a binary relation between ar-guments, so that one can represent an “attack”, orcontradiction, relation between arguments. Thus, theset of arguments and the attack relation form a graph.If one accepts that the graph contains all needed in-formation, it is possible to deﬁne which arguments arevalid, or acceptable, by considering solely this graph.Our intuition tells us that an argument which is not at-tacked at all should be acceptable. More generally, onecan deﬁne that an acceptable argument is one whichis defended, that is, whose attackers are all attackedby arguments which are themselves acceptable.When the graph contains cycles, this deﬁnition is cir-cular, and one needs a more global approach. A solu-tion is to deﬁne acceptable sets of arguments. Argu-ments in such a set do usually not attack each other,and defend each other: every attacker of an argumentin the set is itself attacked by an argument in the set.This deﬁnition leads to Dung’s “admissible” sets ofarguments. Maximal sets of arguments that are ac-ceptable are then called “preferred extensions” of theframework.These deﬁnitions of acceptability make no distinctionbetween arguments, in the sense that defenders areall equally desirable: if an argument can be indepen-dently defended by two diﬀerent arguments, then onemay choose any of the two, or even the two argumentstogether if they do not attack each other, to defendthe ﬁrst one. However, there are problems where adistinction between several levels of desirability of de-fenders is needed. Suppose for example that our argu-ments “belong” to two agents: one, the proponent, istrying to make a point, while the other one, the oppo-nent, is trying to refute it. The proponent may have

2022-09-03T15:09:14.147Z

{ "ACL": null, "DBLP": "conf/nmr/CayrolDLM02", "ArXiv": "cs/0207025", "MAG": "1565826771", "CorpusId": "884", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/e216b015142b641334d65941804cd1d0d92b35d6

"Minimal defence": a refinement of the preferred semantics for argumentation frameworks

[ { "authorId": "1961598", "name": "C. Cayrol" }, { "authorId": "1725479", "name": "S. Doutre" }, { "authorId": "1390014934", "name": "M. Lagasquie-Schiex" }, { "authorId": "2797015", "name": "J. Mengin" } ]

NMR

2,002

9

28

0

false

[ { "category": "Philosophy", "source": "s2-fos-model" }, { "category": "Mathematics", "source": "external" }, { "category": "Computer Science", "source": "external" } ]

[ "JournalArticle" ]

2002-07-01T00:00:00

{ "name": null, "volume": null, "pages": "408-415" }

[ "reasoning", "logic programming", "argumentation", "semantics", "non-monotonic reasoning", "argumentation frameworks" ]

[ "semantics", "argumentation", "argumentation frameworks", "reasoning", "logic programming" ]

[ "reasoning", "logic programming", "argumentation", "semantics", "non-monotonic reasoning", "argumentation frameworks" ]

[ "ontology", "formal languages", "computer programming languages", "formal logic", "autonomous agents", "knowledge representation", "linguistics", "formal languages and automata theory", "computer programming", "artificial intelligence", "multiagent system", "knowledge based systems", "theoretical computer science", "computer science" ]