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

518

We address the problem of bounding below the probability of error under maximum-likelihood decoding of a binary code with a known distance distribution used on a binary-symmetric channel (BSC). An improved upper bound is given for the maximum attainable exponent of this probability (the reliability function of the channel). In particular, we prove that the "random coding exponent" is the true value of the channel reliability for codes rate R in some interval immediately below the critical rate of the channel. An analogous result is obtained for the Gaussian channel.

2022-09-01T08:11:15.475Z

{ "ACL": null, "DBLP": "journals/tit/BargM05", "ArXiv": "cs/0407011", "MAG": "2096684552", "CorpusId": "518", "PubMed": null, "DOI": "10.1109/TIT.2005.858977", "PubMedCentral": null }

https://www.semanticscholar.org/paper/9cf2072ed4d9ff34c63cad9509ff9e93b822da84

Distance distribution of binary codes and the error probability of decoding

[ { "authorId": "143877312", "name": "A. Barg" }, { "authorId": "144078750", "name": "A. Mcgregor" } ]

IEEE Transactions on Information Theory

2,004

30

39

1

true

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

[ "JournalArticle" ]

2004-07-04T00:00:00

{ "name": "IEEE Transactions on Information Theory", "volume": "51", "pages": "4237-4246" }

[ "maximum likelihood decoding", "probability", "binary codes", "binary symmetric channel", "gaussian channels" ]

[ "binary codes", "probability", "maximum likelihood", "maximum likelihood decoding", "binary symmetric channel", "gaussians" ]

[ "maximum likelihood", "maximum likelihood decoding", "probability", "gaussians", "binary codes", "binary symmetric channel", "gaussian channels" ]

[ "maximum likelihood estimation", "likelihood functions", "block codes", "mathematics", "gaussian distribution", "information theory", "channel coding", "low-density parity-check codes", "channel capacity", "correlation analysis", "bit error rate", "gaussian noise (electronic)", "communication", "image coding", "fading channels", "iterative decoding", "graph theory", "matrix algebra", "communication channels", "signal to noise ratio", "image processing", "theoretical computer science", "wireless telecommunication systems", "signal processing", "computer imaging and vision", "computer science", "computer networks", "communication systems", "telecommunication systems", "engineering", "computer systems" ]

519

Fuzzy automata, whose input alphabet is a set of numbers or symbols, are a formal model of computing with values. Motivated by Zadeh's paradigm of computing with words rather than numbers, Ying proposed a kind of fuzzy automata, whose input alphabet consists of all fuzzy subsets of a set of symbols, as a formal model of computing with all words. In this paper, we introduce a somewhat general formal model of computing with (some special) words. The new features of the model are that the input alphabet only comprises some (not necessarily all) fuzzy subsets of a set of symbols and the fuzzy transition function can be specified arbitrarily. By employing the methodology of fuzzy control, we establish a retraction principle from computing with words to computing with values for handling crisp inputs and a generalized extension principle from computing with words to computing with all words for handling fuzzy inputs. These principles show that computing with values and computing with all words can be respectively implemented by computing with words. Some algebraic properties of retractions and generalized extensions are addressed as well.

2022-09-05T02:09:24.100Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0604070", "ArXiv": "cs/0604070", "MAG": "3101576996", "CorpusId": "519", "PubMed": null, "DOI": "10.1109/TFUZZ.2007.896301", "PubMedCentral": null }

https://www.semanticscholar.org/paper/45100b4018acb26f351cbbb13650b28d932c5617

Retraction and Generalized Extension of Computing With Words

[ { "authorId": "4598316", "name": "Yongzhi Cao" }, { "authorId": "144662679", "name": "M. Ying" }, { "authorId": "1805182", "name": "Guoqing Chen" } ]

IEEE Transactions on Fuzzy Systems

2,006

39

38

1

true

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

[ "JournalArticle" ]

2006-04-18T00:00:00

{ "name": "IEEE Transactions on Fuzzy Systems", "volume": "15", "pages": "1238-1250" }

[ "computing with words", "formal model", "automata" ]

[ "finite state automata", "push-down automata", "automata", "formal specification", "formal model" ]

[ "formal specification", "computing with words", "push-down automata", "finite state automata", "automata", "formal model" ]

[ "formal methods", "real time systems", "software engineering", "formal languages", "computer hardware description languages", "computer programming languages", "natural language processing", "soft computing", "translation (languages)", "finite automata", "model checking", "petri nets", "formal logic", "knowledge based systems", "object oriented programming", "mobile robots", "field programmable gate array", "embedded systems", "online systems", "digital signal processing", "computer science", "linguistics", "formal languages and automata theory", "computer programming", "artificial intelligence", "natural languages", "computational linguistics", "automata theory", "architecture verification and validation", "graph theory", "robotics", "computer hardware", "computer systems", "signal processing", "theoretical computer science", "semantics", "database systems", "architecting", "engineering", "software architecture", "software design" ]

520

The investment that an enterprise makes in data processing equipment was once concentrated in the data center. The architecture of that data center is now changing into what might better be called a collection of cooperating subsystems that encompasses the geographic extent of the enterprise. Via telephone lines, leased lines, concentrators, etc., remote terminals are connected to a front-end processor, which often permits access to one of several host processors at the data center. Inside the data center, the multiple hosts may be supplied by a single vendor, although processors representative of several vendors are becoming more common. If the data center itself does not contain multivendor hosts, the enterprise may well face a problem similar to having multiple data centers, located in different areas, that have grown separately around products from a particular vendor. Sometimes the several vendors are represented for reasons that are lost in history, but the fact remains that users throughout an enterprise desire access to files and other services that are distributed over several host processors. Associated with these data centers is the need for a central data repository of some description, whether it is based in paper, microfilm, or magnetic tape. The typical central data repository in the DP world is the magentic tape library. By "central repository" we mean the place from which data volumes are brought for entry into the system. The general paradigm is that the tape reel is fetched from the repository and mounted on a

2022-09-03T14:45:57.780Z

{ "ACL": null, "DBLP": "journals/computer/Miller82", "ArXiv": null, "MAG": "2170062563", "CorpusId": "520", "PubMed": null, "DOI": "10.1109/MC.1982.1654077", "PubMedCentral": null }

https://www.semanticscholar.org/paper/54ee7357e0fd341ee81e132cf2ccf6d09b0b69ea

Mass Storage Systems and Evolution of Data Center Architectures: Guest Editor's Introduction

[ { "authorId": "47760844", "name": "Stephen W. Miller" } ]

Computer

1,982

25

9

0

false

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

[ "JournalArticle" ]

1982-07-01T00:00:00

{ "name": "Computer", "volume": "15", "pages": "16-19" }

[ "investments", "storage systems", "libraries", "telephone lines" ]

[ "storage systems", "investments", "telephone", "telephone lines", "multiprocessors", "libraries" ]

[ "investments", "multiprocessors", "telephone lines", "telephone", "storage systems", "libraries" ]

[ "economics", "multiprocessing systems", "multi core", "embedded systems", "telephone systems", "modems", "telecommunication services", "engineering", "computer systems", "education", "parallel processing systems", "microprocessor chips", "program processors", "telecommunication equipment", "broadband networks", "data communication systems", "telecommunication traffic", "computer science", "distributed systems", "computer hardware", "wireless telecommunication systems", "sensors", "communication channels", "bandwidth", "telecommunication networks", "distributed computer systems", "computer networks", "communication systems", "telecommunication systems" ]

523

Spam costs US corporations upwards of $8.9 billion a year, and comprises as much as 40% of all email received [1]. Solutions exist to reduce the amount of spam seen by end users, but cannot withstand sophisticated attacks. Worse yet, many will occasionally misclassify and silently drop legitimate email. Spammers take advantage of the near-zero cost of sending email to flood the network, knowing that success even a tiny fraction of the time means a profit. End users, however, have proven unwilling to pay money to send email to friends and family. We show that it is feasible to extend the existing mail system to reduce the amount of unwanted email, without misclassifying email, and without charging well-behaved users. We require that bulk email senders accurately classify each email message they send as an advertisement with an area of interest or else be charged a small negative incentive per message delivered. Recipients are able to filter out email outside their scope of interest, while senders are able to focus their sendings to the appropriate audience.

2022-09-02T09:24:57.186Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0501027", "ArXiv": "cs/0501027", "MAG": "2159821148", "CorpusId": "523", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/97212df2f59fb0cb33f1c7e7e12afce7415fac4d

Enforcing Bulk Mail Classification

[ { "authorId": "2056402652", "name": "E. Greenberg" }, { "authorId": "1759787", "name": "D. Cheriton" } ]

ArXiv

2,005

6

0

false

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

[ "JournalArticle" ]

2005-01-13T00:00:00

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

[ "spam", "email messages", "email" ]

[ "email", "spam", "email messages", "electronic mail", "classification models" ]

[ "spam", "email messages", "electronic mail", "classification models", "email" ]

[ "internet", "classification methods", "computer science", "computer systems" ]

524

In this paper, we present a generalization of the relational data model based on paraconsistent intuitionistic fuzzy sets. Our data model is capable of manipulating incomplete as well as inconsistent information. Fuzzy relation or intuitionistic fuzzy relation can only handle incomplete information. Associated with each relation are two membership functions one is called truth-membership function $T$ which keeps track of the extent to which we believe the tuple is in the relation, another is called false-membership function which keeps track of the extent to which we believe that it is not in the relation. A paraconsistent intuitionistic fuzzy relation is inconsistent if there exists one tuple $a$ such that $T(a) + F(a) > 1$. In order to handle inconsistent situation, we propose an operator called split to transform inconsistent paraconsistent intuitionistic fuzzy relations into pseudo-consistent paraconsistent intuitionistic fuzzy relations and do the set-theoretic and relation-theoretic operations on them and finally use another operator called combine to transform the result back to paraconsistent intuitionistic fuzzy relation. For this model, we define algebraic operators that are generalisations of the usual operators such as union, selection, join on fuzzy relations. Our data model can underlie any database and knowledge-base management system that deals with incomplete and inconsistent information.

2022-06-30T22:15:24.131Z

{ "ACL": null, "DBLP": "journals/corr/cs-DB-0410054", "ArXiv": "cs/0410054", "MAG": "1533939769", "CorpusId": "524", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Paraconsistent Intuitionistic Fuzzy Relational Data Model

[ { "authorId": "1756672", "name": "R. Sunderraman" }, { "authorId": "2113220386", "name": "Haibin Wang" } ]

ArXiv

2,004

42

2

1

false

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

[ "JournalArticle" ]

2004-10-20T00:00:00

{ "name": "ArXiv", "volume": "cs.DB/0410054", "pages": null }

[ "database systems", "relational data models", "genetic selection" ]

[ "relational data models", "relational database", "database systems", "knowledge base", "kripke semantics" ]

[ "kripke semantics", "relational database", "genetic selection", "database systems", "relational data models", "knowledge base" ]

[ "formal logic", "query languages", "knowledge based systems", "genetic analysis", "computer systems", "artificial intelligence", "bioinformatics", "computer science" ]

525

Volunteer computing, sometimes called public resource computing, is an emerging computational model that is very suitable for work-pooled parallel processing. As more complex grid applications make use of work flows in their design and deployment it is reasonable to consider the impact of work flow deployment over a volunteer computing infrastructure. In this case, the inter work flow I/O can lead to a significant increase in I/O demands at the work pool server. A possible solution is the use of a peer-to-peer based parallel computing architecture to off-load this I/O demand to the workers; where the workers can fulfill some aspects of work flow coordination and I/O checking, etc. However, achieving robustness in such a large scale system is a challenging hurdle towards the decentralized execution of work flows and general parallel processes. To increase robustness, we propose and show the merits of using an adaptive checkpoint scheme that efficiently checkpoints the status of the parallel processes according to the estimation of relevant network and peer parameters. Based on our proposed mathematical checkpoint model, our scheme uses statistical data observed during runtime to dynamically make checkpoint decisions in a completely decentralized manner. The results of simulation show support for our proposed approach in terms of reduced required runtime.

2022-09-01T20:58:36.988Z

{ "ACL": null, "DBLP": "conf/pdcat/NiH08", "ArXiv": "0711.3949", "MAG": "2951702560", "CorpusId": "525", "PubMed": null, "DOI": "10.1109/PDCAT.2008.53", "PubMedCentral": null }

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

An Adaptive Checkpointing Scheme for Peer-to-Peer Based Volunteer Computing Work Flows

[ { "authorId": "2053607367", "name": "Lei Ni" }, { "authorId": "145098019", "name": "A. Harwood" } ]

2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies

2,007

28

4

0

true

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

[ "JournalArticle", "Conference" ]

2007-11-25T00:00:00

{ "name": "2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies", "volume": null, "pages": "227-234" }

[ "parallel processing", "peer-to-peer", "parallel computing", "checkpointing", "grid applications", "computing paradigm" ]

[ "checkpointing", "parallel processing", "parallel computing", "grid applications", "rollback recovery" ]

[ "parallel processing", "peer-to-peer", "rollback recovery", "parallel computing", "checkpointing", "grid applications", "computing paradigm" ]

[ "parallel algorithms", "distributed computer systems", "internet", "computer networks", "fault tolerance", "parallel architectures", "computer system recovery", "grid computing", "cloud computing", "parallel processing systems", "computer systems", "computer science", "software quality", "fault tolerant computer systems", "operating systems", "data communication systems", "distributed systems", "software design", "software engineering" ]

528

Shock physics experiments are often complicated and expensive. As a result, researchers are unable to conduct as many experiments as they would like - leading to sparse data sets. In this paper, Support Vector Machines for regression are applied to velocimetry data sets for shock damaged and melted tin metal. Some success at interpolating between data sets is achieved. Implications for future work are discussed.

2022-06-20T11:03:08.856Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0603081", "ArXiv": "cs/0603081", "MAG": "1579126504", "CorpusId": "528", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/1a563a3b3fbf6b2bda912bf3275657edd540a05e

Application of Support Vector Regression to Interpolation of Sparse Shock Physics Data Sets

[ { "authorId": "2614207", "name": "Nikita A. Sakhanenko" }, { "authorId": "1734779", "name": "G. Luger" }, { "authorId": "1995923", "name": "H. Makaruk" }, { "authorId": "34146531", "name": "D. Holtkamp" } ]

ArXiv

2,006

16

0

false

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

[ "JournalArticle" ]

2006-03-20T00:00:00

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

[ "support vector machine", "velocimetry", "support vector" ]

[ "support vector", "support vector machine", "velocimetry", "svm", "regression model" ]

[ "svm", "support vector", "support vector machine", "velocimetry", "regression model" ]

[ "classifiers", "velocimeters", "correlation analysis", "machine learning", "flow visualization", "mathematics", "artificial intelligence", "visualization", "computer science", "human computer interaction" ]

531

We describe how specialized database technology and data analysis methods were applied by the Swedish defense to help deal with the violation of Swedish marine territory by foreign submarine intruders during the Eighties and early Nineties. Among several approaches tried some yielded interesting information, although most of the key questions remain unanswered. We conclude with a survey of belief-function- and genetic-algorithm-based methods which were proposed to support interpretation of intelligence reports and prediction of future submarine positions, respectively.

2022-09-01T05:09:17.269Z

{ "ACL": null, "DBLP": "conf/kdd/BergstenSS97", "ArXiv": "cs/0305022", "MAG": "2949289357", "CorpusId": "531", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Applying Data Mining and Machine Learning Techniques to Submarine Intelligence Analysis

[ { "authorId": "39869874", "name": "Ulla Bergsten" }, { "authorId": "144792483", "name": "J. Schubert" }, { "authorId": "2069760072", "name": "P. Svensson" } ]

KDD

1,997

13

14

0

false

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

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

1997-08-14T00:00:00

{ "name": null, "volume": null, "pages": "127-130" }

[ "data mining", "intelligence analysts", "machine learning", "intelligence analysis", "database systems" ]

[ "data mining", "machine learning", "intelligence analysis", "intelligence analysts", "database systems", "genetic algorithms", "association rules", "correlation analysis" ]

[ "data mining", "genetic algorithms", "correlation analysis", "intelligence analysts", "machine learning", "intelligence analysis", "database systems", "association rules" ]

[ "computer science", "artificial intelligence", "mathematics", "visual analytics", "computer systems", "information visualization", "visualization tools", "interactive computer graphics", "information analysis", "graphical user interfaces", "data visualization", "visualization", "user interfaces", "computer imaging and vision", "information systems", "human computer interaction" ]

532

The Metric Traveling Salesman Problem (TSP) is a classical NP-hard optimization problem. The double-tree shortcutting method for Metric TSP yields an exponentially-sized space of TSP tours, each of which approximates the optimal solution within, at most, a factor of 2. We consider the problem of finding among these tours the one that gives the closest approximation, that is, the minimum-weight double-tree shortcutting. Burkard et al. gave an algorithm for this problem, running in time O(n3 + 2d n2) and memory O(2d n2), where d is the maximum node degree in the rooted minimum spanning tree. We give an improved algorithm for the case of small d (including planar Euclidean TSP, where d ≤ 4), running in time O(4d n2) and memory O(4d n). This improvement allows one to solve the problem on much larger instances than previously attempted. Our computational experiments suggest that in terms of the time-quality trade-off, the minimum-weight double-tree shortcutting method provides one of the best existing tour-constructing heuristics.

2022-08-25T02:45:01.502Z

{ "ACL": null, "DBLP": "journals/corr/abs-0710-0318", "ArXiv": "0710.0318", "MAG": "1998414344", "CorpusId": "532", "PubMed": null, "DOI": "10.1145/1498698.1594232", "PubMedCentral": null }

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

Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough?

[ { "authorId": "1729333", "name": "V. Deineko" }, { "authorId": "1835401", "name": "A. Tiskin" } ]

JEAL

2,007

33

6

0

true

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

[ "JournalArticle" ]

2007-10-01T00:00:00

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

[ "optimal solutions", "minimum spanning trees", "optimization problems" ]

[ "optimization problems", "optimization", "trade", "combinatorial problems", "combinatorial optimization" ]

[ "trade", "optimal solutions", "optimization", "combinatorial problems", "minimum spanning trees", "combinatorial optimization", "optimization problems" ]

[ "commerce", "computer systems", "mathematics", "combinatorial mathematics", "graph theory", "correlation analysis", "economics", "computer science", "theoretical computer science" ]

534

In this paper, we address the power-aware scheduling of sporadic constrained-deadline hard real-time tasks using dynamic voltage scaling upon multiprocessor platforms. We propose two distinct algorithms. Our first algorithm is an off-line speed determination mechanism which provides an identical speed for each processor. That speed guarantees that all deadlines are met if the jobs are scheduled using EDF. The second algorithm is an on-line and adaptive speed adjustment mechanism which reduces the energy consumption while the system is running.

2022-09-05T01:25:19.969Z

{ "ACL": null, "DBLP": "conf/sutc/NelisGDMN08", "ArXiv": "0712.2958", "MAG": "2951053271", "CorpusId": "534", "PubMed": null, "DOI": "10.1109/SUTC.2008.31", "PubMedCentral": null }

https://www.semanticscholar.org/paper/02c83ec811813426e60465d1949e42309b1731c2

Power-Aware Real-Time Scheduling upon Identical Multiprocessor Platforms

[ { "authorId": "2613260", "name": "Vincent Nélis" }, { "authorId": "144686425", "name": "J. Goossens" }, { "authorId": "1717527", "name": "Raymond R. Devillers" }, { "authorId": "2649521", "name": "D. Milojevic" }, { "authorId": "50880512", "name": "N. Navet" } ]

2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008)

2,007

48

29

2

true

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

[ "JournalArticle", "Conference" ]

2007-12-18T00:00:00

{ "name": "2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008)", "volume": null, "pages": "209-216" }

[ "real time scheduling", "real-time tasks", "multi-processor platforms", "hard real-time" ]

[ "real time scheduling", "multiprocessors", "multi-processor platforms", "adaptive algorithms", "multiprocessor system", "shared memory multiprocessors" ]

[ "multiprocessors", "real-time tasks", "multiprocessor system", "shared memory multiprocessors", "real time scheduling", "multi-processor platforms", "adaptive algorithms", "hard real-time" ]

[ "multiprocessing systems", "multi core", "embedded systems", "real time systems", "buffer storage", "software", "parallel processing systems", "microprocessor chips", "program processors", "computer systems", "knowledge based systems", "object oriented programming", "mobile robots", "field programmable gate array", "online systems", "digital signal processing", "telecommunication traffic", "bandwidth", "data communication systems", "computer science", "distributed systems", "computer hardware", "artificial intelligence", "computer programming", "robotics", "signal processing", "telecommunication networks", "computer networks", "distributed computer systems", "engineering", "telecommunication systems" ]

535

In this note we analyse various stability properties of a max-min fair rate control protocol (RCP) operating with small buffers. We first tackle the issue of stability for networks with arbitrary topologies. We prove that the max-min fair RCP fluid model is globally stable in the absence of propagation delays, and also derive a set of conditions for local stability when arbitrary heterogeneous propagation delays are present. The network delay stability result assumes that, at equilibrium, there is only one bottleneck link along each route. Lastly, in the simpler setting of a single link, single delay model, we investigate the impact of the loss of local stability via a Hopf bifurcation.

2022-09-04T01:03:36.894Z

{ "ACL": null, "DBLP": "journals/corr/abs-0710-5830", "ArXiv": "0710.5830", "MAG": "2145026316", "CorpusId": "535", "PubMed": null, "DOI": "10.1109/TAC.2009.2022115", "PubMedCentral": null }

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

Stability Analysis of a Max-Min Fair Rate Control Protocol (RCP) in a Small Buffer Regime

[ { "authorId": "1769473", "name": "T. Voice" }, { "authorId": "3090272", "name": "G. Raina" } ]

IEEE Transactions on Automatic Control

2,007

33

25

2

true

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

[ "JournalArticle" ]

2007-10-31T00:00:00

{ "name": "IEEE Transactions on Automatic Control", "volume": "54", "pages": "1908-1913" }

[ "fluid models", "rate control", "local stability" ]

[ "asymptotic stability", "asymptotical stability", "local stability", "rate control", "fluid models" ]

[ "asymptotical stability", "fluid models", "asymptotic stability", "rate control", "local stability" ]

[ "control system stability", "stability criteria", "delay control systems", "sufficient conditions", "numerical example", "queueing theory", "linear matrix inequalities", "visual communication", "global stability", "control system analysis", "lyapunov functions", "control systems", "time delay", "numerical methods", "telecommunication traffic", "matrix algebra", "image coding", "adaptive control systems", "differential equations", "computer systems", "mathematics", "telecommunication networks", "image processing", "process control", "computer science", "telecommunication systems", "computer imaging and vision", "automation", "engineering" ]

537

This paper introduces new methods based on exponential families for modeling the correlations between words in text and speech. While previous work assumed the effects of word co-occurrence statistics to be constant over a window of several hundred words, we show that their influence is nonstationary on a much smaller time scale. Empirical data drawn from English and Japanese text, as well as conversational speech, reveals that the "attraction" between words decays exponentially, while stylistic and syntactic contraints create a "repulsion" between words that discourages close co-occurrence. We show that these characteristics are well described by simple mixture models based on two-stage exponential distributions which can be trained using the EM algorithm. The resulting distance distributions can then be incorporated as penalizing features in an exponential language model.

2022-09-05T01:55:39.351Z

{ "ACL": "P97-1048", "DBLP": "conf/acl/BeefermanBL97", "ArXiv": "cmp-lg/9706018", "MAG": "2120804083", "CorpusId": "537", "PubMed": null, "DOI": "10.3115/976909.979665", "PubMedCentral": null }

https://www.semanticscholar.org/paper/3826b23a763d0bbae21ea5323062c4858791dc53

A Model of Lexical Attraction and Repulsion

[ { "authorId": "1745366", "name": "Doug Beeferman" }, { "authorId": "1710580", "name": "A. Berger" }, { "authorId": "1739581", "name": "J. Lafferty" } ]

ACL

1,997

20

97

10

true

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

[ "JournalArticle", "Conference" ]

1997-06-12T00:00:00

{ "name": null, "volume": null, "pages": "373-380" }

[ "japanese", "language model", "syntactics", "correlation analysis" ]

[ "syntactics", "correlation analysis", "part of speech", "distribution functions", "language model", "natural speech", "syntactic structure" ]

[ "part of speech", "natural speech", "correlation analysis", "syntactic structure", "japanese", "distribution functions", "syntactics", "language model" ]

[ "natural language processing", "speech communication", "mathematics", "asian continental ancestry group", "probability density function", "probability distributions", "computational linguistics", "artificial intelligence", "natural languages", "linguistics", "genotype", "genetic association", "probability", "database systems", "computer science", "semantics", "single nucleotide polymorphism", "genetic analysis", "computer systems", "bioinformatics" ]

540

User interfaces that adapt their characteristics to those of the user are referred to as adaptive interfaces. We propose Adaptive Agent Oriented Software Architecture (AAOSA) as a new way of designing adaptive interfaces. AAOSA is a new approach to software design based on an agent-oriented architecture. In this approach agents are considered adaptively communicating concurrent modules which are divided into a white box module responsible for the communications and learning, and a black box which is responsible for the independent specialized processes of the agent. A distributed learning policy that makes use of this architecture is used for purposes of system adaptability.

2022-06-20T11:59:55.937Z

{ "ACL": null, "DBLP": "journals/corr/cs-HC-9812015", "ArXiv": "cs/9812015", "MAG": "1646887912", "CorpusId": "540", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/13d16b3d7782c88d6de1304a7a4b997a42fc86c9

Adaptive Interaction Using the Adaptive Agent Oriented Software Architecture (AAOSA)

[ { "authorId": "3024670", "name": "B. Hodjat" }, { "authorId": "2266748", "name": "M. Amamiya" } ]

ArXiv

1,998

30

1

0

false

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

[ "JournalArticle" ]

1998-12-11T00:00:00

{ "name": "ArXiv", "volume": "cs.HC/9812015", "pages": null }

[ "user interfaces", "software design", "agent-oriented", "communication", "software architecture" ]

[ "intelligent agents", "software agents", "software", "software architecture", "software design", "communication" ]

[ "user interfaces", "software design", "software agents", "agent-oriented", "intelligent agents", "software", "communication", "software architecture" ]

[ "human computer interaction", "software engineering", "multiagent system", "computer science", "artificial intelligence" ]

541

The Integrated Computer Control System (ICCS) for the National Ignition Facility (NIF) is a layered architecture of 300 front-end processors (FEP) coordinated by supervisor subsystems including automatic beam alignment and wavefront control, laser and target diagnostics, pulse power, and shot control timed to 30 ps. FEP computers incorporate either VxWorks on PowerPC or Solaris on UltraSPARC processors that interface to over 45,000 control points attached to VME-bus or PCI-bus crates respectively. Typical devices are stepping motors, transient digitizers, calorimeters, and photodiodes. The front-end layer is divided into another segment comprised of an additional 14,000 control points for industrial controls including vacuum, argon, synthetic air, and safety interlocks implemented with Allen-Bradley programmable logic controllers (PLCs). The computer network is augmented asynchronous transfer mode (ATM) that delivers video streams from 500 sensor cameras monitoring the 192 laser beams to operator workstations. Software is based on an object-oriented framework using CORBA distribution that incorporates services for archiving, machine configuration, graphical user interface, monitoring, event logging, scripting, alert management, and access control. Software coding using a mixed language environment of Ada95 and Java is one-third complete at over 300 thousand source lines. Control system installation is currently under way for the first 8 beams, with project completion scheduled for 2008.

2022-09-04T13:24:06.310Z

{ "ACL": null, "DBLP": "journals/corr/cs-SE-0111045", "ArXiv": "cs/0111045", "MAG": "3011824115", "CorpusId": "541", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

The Overview of the National Ignition Facility Distributed Computer Control System

[ { "authorId": "1923570", "name": "L. Lagin" }, { "authorId": "2178370", "name": "R. Bettenhausen" }, { "authorId": "145446945", "name": "R. Carey" }, { "authorId": "46350908", "name": "C. Estes" }, { "authorId": "145907792", "name": "J. Fisher" }, { "authorId": "1890527", "name": "J. Krammen" }, { "authorId": "32768556", "name": "R. K. Reed" }, { "authorId": "2970432", "name": "P. VanArsdall" }, { "authorId": "1868549", "name": "J. Woodruff" } ]

ArXiv

2,001

13

0

false

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

[ "JournalArticle", "Review" ]

2001-10-15T00:00:00

{ "name": "ArXiv", "volume": "cs.SE/0111045", "pages": null }

[ "graphical user interfaces", "layered", "computer networks", "control systems", "object oriented", "sensors", "asynchronous transfer mode", "programmable logic controllers", "access control", "software", "control point", "computer control systems", "java", "video streams" ]

[ "computer control", "computer control systems", "control systems", "layered", "control point", "programmable logic", "programmable logic controllers", "computer networks", "asynchronous transfer mode", "video streams", "sensors", "software", "graphical user interfaces", "user interfaces", "access control", "java" ]

[ "graphical user interfaces", "layered", "computer networks", "control systems", "object oriented", "user interfaces", "computer control", "programmable logic", "sensors", "asynchronous transfer mode", "programmable logic controllers", "access control", "software", "control point", "computer control systems", "java", "video streams" ]

[ "software architecture patterns", "computer science", "computer systems", "object oriented programming", "human computer interaction", "logic gates", "programmed control systems", "logic devices", "computer hardware", "telecommunication services", "bandwidth", "microprocessor chips", "computer security", "image coding", "splines", "curve fitting", "computer programming languages", "high level languages", "video streaming", "software architecture", "computer programming", "field programmable gate array", "telecommunication traffic", "data communication systems", "image processing", "computer aided design", "mathematics", "multimedia systems", "software design", "telecommunication networks", "computer imaging and vision", "internet", "software engineering", "telecommunication systems" ]

544

This paper presents a new method, based on a multiagent system and on digital mock-up technology, to assess an efficient path planner for a manikin for access and visibility task under ergonomic constraints. In order to solve this problem, the human operator is integrated in the process optimization to contribute to a global perception of the environment. This operator cooperates, in real-time, with several automatic local elementary agents. The result of this work validates solutions brought by digital mock-up and that can be applied to simulate maintenance task.

2022-08-21T02:31:06.449Z

{ "ACL": null, "DBLP": "journals/corr/abs-0707-2042", "ArXiv": "0707.2042", "MAG": "1914352487", "CorpusId": "544", "PubMed": null, "DOI": "10.1109/ROMAN.2001.981873", "PubMedCentral": null }

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

A distributed approach for access and visibility task under ergonomic constraints with a manikin in a virtual reality environment

[ { "authorId": "152632772", "name": "F. Bidault" }, { "authorId": "1747337", "name": "D. Chablat" }, { "authorId": "2046346", "name": "P. Chedmail" }, { "authorId": "35199325", "name": "Laurent Pino" } ]

Proceedings 10th IEEE International Workshop on Robot and Human Interactive Communication. ROMAN 2001 (Cat. No.01TH8591)

2,001

16

8

0

true

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

[ "JournalArticle" ]

2001-09-18T00:00:00

{ "name": "Proceedings 10th IEEE International Workshop on Robot and Human Interactive Communication. ROMAN 2001 (Cat. No.01TH8591)", "volume": null, "pages": "32-37" }

[ "virtual reality", "ergonomics", "human operator", "optimization", "path planners", "maintenance tasks", "multiagent system" ]

[ "ergonomics", "virtual reality", "multi-agent", "multiagent system", "path planners", "human operator", "optimization" ]

[ "virtual reality", "ergonomics", "human operator", "optimization", "multi-agent", "path planners", "maintenance tasks", "multiagent system" ]

[ "human computer interaction", "human engineering", "man machine systems", "intelligent robots", "remote control", "mathematics", "robot programming", "path planning", "software maintenance", "artificial intelligence", "computer science", "cognitive systems", "robotics", "user interfaces", "mobile robots", "sensors", "robots", "robotic manipulators", "motion planning", "software systems", "computer software maintenance", "computer hardware", "software design", "object oriented programming", "software engineering", "computer programming" ]

545

This paper presents a detailed analysis of pseudocodewords of Tanner graphs. Pseudocodewords arising on the iterative decoder's computation tree are distinguished from pseudocodewords arising on finite degree lifts. Lower bounds on the minimum pseudocodeword weight are presented for the BEC, BSC, and AWGN channel. Some structural properties of pseudocodewords are examined, and pseudocodewords and graph properties that are potentially problematic with min-sum iterative decoding are identified. An upper bound on the minimum degree lift needed to realize a particular irreducible lift-realizable pseudocodeword is given in terms of its maximal component, and it is shown that all irreducible lift-realizable pseudocodewords have components upper bounded by a finite value t that is dependent on the graph structure. Examples and different Tanner graph representations of individual codes are examined and the resulting pseudocodeword distributions and iterative decoding performances are analyzed. The results obtained provide some insights in relating the structure of the Tanner graph to the pseudocodeword distribution and suggest ways of designing Tanner graphs with good minimum pseudocodeword weight.

2022-09-02T14:39:11.486Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0504013", "ArXiv": "cs/0504013", "MAG": "2116815462", "CorpusId": "545", "PubMed": null, "DOI": "10.1109/TIT.2007.907501", "PubMedCentral": null }

https://www.semanticscholar.org/paper/657b54e728f33fca568a6b7ecd08ba275e32fdba

Pseudocodewords of Tanner Graphs

[ { "authorId": "2686911", "name": "C. Kelley" }, { "authorId": "2331824", "name": "D. Sridhara" } ]

IEEE Transactions on Information Theory

2,005

31

90

6

true

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

[ "JournalArticle" ]

2005-04-05T00:00:00

{ "name": "IEEE Transactions on Information Theory", "volume": "53", "pages": "4013-4038" }

[ "iterative decoding", "min-sum", "minimum degree", "decoding performance", "graph structures", "tanner graphs", "awgn channel", "iterative decoder" ]

[ "tanner graphs", "directed graphs", "iterative decoder", "awgn", "awgn channel", "minimum degree" ]

[ "iterative decoding", "min-sum", "minimum degree", "decoding performance", "graph structures", "tanner graphs", "awgn", "awgn channel", "directed graphs", "iterative decoder" ]

[ "bit error rate", "information theory", "ldpc codes", "graph g", "graphic methods", "turbo codes", "coding errors", "block codes", "additive noise", "fading channels", "white noise", "graph theory", "communication channels", "signal to noise ratio", "probability", "communication", "signal encoding", "low-density parity-check codes", "polynomial approximation", "quadrature amplitude modulation", "convolutional codes", "code division multiple access", "additive white gaussian noise", "data communication systems", "image compression", "spurious signal noise", "gaussian noise (electronic)", "theoretical computer science", "wireless telecommunication systems", "signal processing", "mathematics", "channel capacity", "matrix algebra", "fading (radio)", "rayleigh fading", "orthogonal frequency division multiplexing", "computer systems", "image quality", "image coding", "computer science", "computer networks", "communication systems", "telecommunication systems", "engineering", "signal detection", "image analysis", "image processing", "computer imaging and vision" ]

547

A permutation array(or code) of length n and distanced, denoted by(n, d) PA, is a set of permutationsC from some fixed set of n elements such that the Hamming distance between distinct membersx,y ∈ C is at leastd. Let P (n, d) denote the maximum size of an ( , d) PA. New upper bounds onP (n, d) are given. For constant α, β satisfying certain conditions, whenever d = βn, the new upper bounds are asymptotically better than the previou s ones.

2022-06-20T11:49:08.623Z

{ "ACL": null, "DBLP": "journals/corr/abs-0801-3983", "ArXiv": "0801.3983", "MAG": null, "CorpusId": "547", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/75dae36127fe86198c4fc10f8d5f92c3a1c757d2

New Upper Bounds on Sizes of Permutation Arrays

[ { "authorId": "2084795", "name": "Lizhen Yang" }, { "authorId": "49536629", "name": "Ling Dong" }, { "authorId": "89883687", "name": "Kefei Chen" } ]

ArXiv

2,008

0

1

false

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

[ "JournalArticle" ]

2008-01-25T00:00:00

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

[ "hamming distance" ]

[ "hamming distance", "sub-arrays", "linear arrays", "binary codes", "code generation" ]

[ "hamming distance", "linear arrays", "binary codes", "sub-arrays", "code generation" ]

[ "biometrics", "array processing", "information theory", "direction of arrival", "program compilers", "access control", "antenna arrays", "beamforming", "communication", "sensors", "parallel processing systems", "computer programming languages", "computer security", "communication channels", "antennas", "signal to noise ratio", "matrix algebra", "fading channels", "computer hardware", "distributed systems", "computer programming", "computer science", "wireless telecommunication systems", "signal processing", "mathematics", "distributed computer systems", "computer networks", "communication systems", "telecommunication systems", "engineering", "computer systems" ]

548

This paper describes the implementation and evaluation of an open source library for mathematical morphology based on packed binary and run-length compressed images for document imaging applications. Abstractions and patterns useful in the implementation of the interval operations are described. A number of benchmarks and comparisons to bit-blit based implementations on standard document images are provided.

2022-07-31T18:23:02.425Z

{ "ACL": null, "DBLP": "journals/corr/abs-0712-0121", "ArXiv": "0712.0121", "MAG": "1614096913", "CorpusId": "548", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/53b75df6268e67d4686123734c3ea46075aa6b4a

Efficient Binary and Run Length Morphology and its Application to Document Image Processing

[ { "authorId": "1733858", "name": "T. Breuel" } ]

ArXiv

2,007

38

4

0

false

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

[ "JournalArticle" ]

2007-12-01T00:00:00

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

[ "mathematical morphology", "document images", "libraries", "compressed images", "document image processing" ]

[ "electronic document", "document images", "document image processing", "image processing", "libraries", "mathematical morphology" ]

[ "mathematical morphology", "electronic document", "document images", "libraries", "compressed images", "document image processing", "image processing" ]

[ "image segmentation", "word processing", "optical character recognition", "digital image storage", "education", "computer imaging and vision", "image analysis", "text processing", "character recognition", "image compression", "imaging systems", "database systems", "computer science", "natural language processing", "computational linguistics", "data mining", "information retrieval", "pattern recognition", "image quality", "image coding", "image reconstruction", "computer systems", "artificial intelligence", "natural languages", "machine learning", "linguistics", "semantics" ]

551

An algorithm that performs joint equalization and decoding for channels with nonlinear two-dimensional intersymbol interference is presented. The algorithm performs sum-product message-passing on a factor graph that represents the underlying system. The two-dimensional optical storage (Two-DOS) technology is an example of a system with nonlinear two-dimensional intersymbol interference. Simulations for the nonlinear channel model of TwoDOS show significant improvement in performance over uncoded performance. Noise tolerance thresholds for the TwoDOS channel computed using density evolution are also presented

2022-09-04T05:31:18.184Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0509009", "ArXiv": "cs/0509009", "MAG": "2953098193", "CorpusId": "551", "PubMed": null, "DOI": "10.1109/ISIT.2005.1523563", "PubMedCentral": null }

https://www.semanticscholar.org/paper/1bc2899dde0940d3c89563b0f5d20a0084fba66d

Joint equalization and decoding for nonlinear two-dimensional intersymbol interference channels

[ { "authorId": "31406458", "name": "N. Singla" }, { "authorId": "1389600867", "name": "J. O’Sullivan" } ]

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.

2,005

64

18

1

true

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

[ "JournalArticle" ]

2005-09-04T00:00:00

{ "name": "Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.", "volume": null, "pages": "1353-1357" }

[ "factor graphs", "equalization", "intersymbol interference", "channel model", "density evolution", "interference channels" ]

[ "equalization", "intersymbol interference", "interference channels", "factor graphs", "channel model", "density evolution" ]

[ "factor graphs", "equalization", "intersymbol interference", "channel model", "density evolution", "interference channels" ]

[ "belief propagation", "communication systems", "channel estimation", "fading (radio)", "signal receivers", "time division multiple access", "blind equalization", "quadrature amplitude modulation", "multipath channels", "cochannel interference", "multiple access interference", "frequency selective fading", "multiuser detection", "decision feedback equalizers", "additive white gaussian noise", "transceivers", "channel capacity", "fir filters", "fading channels", "mimo systems", "antennas", "turbo codes", "coding errors", "ldpc codes", "multiplexing", "transmitters", "signal interference", "information theory", "backpropagation algorithm", "graph theory", "computer systems", "communication channels", "bit error rate", "signal detection", "signal to noise ratio", "medium access control", "wireless telecommunication systems", "rayleigh fading", "orthogonal frequency division multiplexing", "multipath propagation", "spread spectrum communication", "radio interference", "code division multiple access", "data communication systems", "white noise", "gaussian noise (electronic)", "signal processing", "signal encoding", "low-density parity-check codes", "convolutional codes", "image compression", "spurious signal noise", "communication", "neural networks", "theoretical computer science", "computer science", "probability", "network protocols", "computer networks", "telecommunication systems", "engineering", "iterative decoding", "matrix algebra", "image quality", "image coding", "machine learning", "mathematics", "internet", "image analysis", "image processing", "artificial intelligence", "computer imaging and vision" ]

552

Document management software systems are having a wide audience at present. However, groupware as a term has a wide variety of possible definitions. Groupware classification attempt is made in this paper. Possible approaches to groupware are considered including document management, document control and mailing systems. Lattice theory and concept modelling are presented as a theoretical background for the systems in question. Current technologies in state-of-the-art document managenent software are discussed. Design and implementation aspects for user-friendly integrate enterprise systems are described. Results for a real system to be implemented are given. Perspectives of the field in question are discussed.

2022-06-20T12:22:18.710Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0607121", "ArXiv": "cs/0607121", "MAG": "1614876883", "CorpusId": "552", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Object-Based Groupware: Theory, Design and Implementation Issues

[ { "authorId": "28959539", "name": "S. Zykov" }, { "authorId": "2143261", "name": "Gleb G. Pogodayev" } ]

ArXiv

2,006

17

5

0

false

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

[ "JournalArticle" ]

2006-07-27T00:00:00

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

[ "enterprise system", "groupware", "software", "software systems" ]

[ "groupware", "electronic document", "software", "software systems", "enterprise system" ]

[ "electronic document", "enterprise system", "software", "groupware", "software systems" ]

[ "word processing", "enterprise resource planning", "computer science", "interactive computer systems", "software design", "object oriented programming", "text processing", "information technology", "information systems", "user interfaces", "software engineering", "computer programming", "natural language processing", "computational linguistics", "data mining", "information retrieval", "computer systems", "human computer interaction", "artificial intelligence", "natural languages", "database systems", "linguistics", "semantics" ]

554

Lexical constraints on the input of speech and on-line handwriting systems improve the performance of such systems. A significant gain in speed can be achieved by integrating in a digraph structure the different Hidden Markov Models (HMM) corresponding to the words of the relevant lexicon. This integration avoids redundant computations by sharing intermediate results between HMM's corresponding to different words of the lexicon. In this paper, we introduce a token passing method to perform simultaneously the computation of the a posteriori probabilities of all the words of the lexicon. The coding scheme that we introduce for the tokens is optimal in the information theory sense. The tokens use the minimum possible number of bits. Overall, we optimize simultaneously the execution speed and the memory requirement of the recognition systems.

2022-06-20T12:23:57.284Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0601108", "ArXiv": "cs/0601108", "MAG": "1754735251", "CorpusId": "554", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/717db86fc84ca56db9f527e4a54a61ecd53fe63e

Fast Lexically Constrained Viterbi Algorithm (FLCVA): Simultaneous Optimization of Speed and Memory

[ { "authorId": "2876997", "name": "A. Lifchitz" }, { "authorId": "1737645", "name": "F. Maire" }, { "authorId": "3187053", "name": "D. Revuz" } ]

ArXiv

2,006

22

0

false

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

[ "JournalArticle" ]

2006-01-25T00:00:00

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

[ "hidden markov models", "digraph", "optimization", "hidden markov model (hmm)", "coding scheme", "information theory" ]

[ "optimization", "digraph", "hidden markov models", "hidden markov model (hmm)", "markov model", "information theory", "hand-written characters", "parallel computation" ]

[ "parallel computation", "hidden markov models", "hand-written characters", "digraph", "optimization", "hidden markov model (hmm)", "coding scheme", "information theory", "markov model" ]

[ "parallel algorithms", "parallel computing", "markov processes", "character recognition", "directed graphs", "mathematics", "image coding", "network coding", "communication", "parallel processing systems", "parallel architectures", "correlation analysis", "pattern recognition", "graph theory", "image processing", "multicasts", "distributed systems", "machine learning", "theoretical computer science", "computer imaging and vision", "wireless telecommunication systems", "telecommunication networks", "bandwidth", "data communication systems", "distributed computer systems", "artificial intelligence", "computer science", "computer networks", "communication systems", "telecommunication systems", "computer systems" ]

555

Significant effort has been invested recently to accelerate handover operations in a next generation mobile Internet. Corresponding works for developing efficient mobile multicast management are emergent. Both problems simultaneously expose routing complexity between subsequent points of attachment as a characteristic parameter for handover performance in access networks. As continuous mobility handovers necessarily occur between access routers located in geographic vicinity, this paper investigates on the hypothesis that geographically adjacent edge networks attain a reduced network distances as compared to arbitrary Internet nodes. We therefore evaluate and analyze edge distance distributions in various regions for clustered IP ranges on their geographic location such as a city. We use traceroute to collect packet forwarding path and round-trip-time of each intermediate node to scan-wise derive an upper bound of the node distances. Results of different scanning origins are compared to obtain the best estimation of network distance of each pair. Our results are compared with corresponding analysis of CAIDA Skitter data, overall leading to fairly stable, reproducible edge distance distributions. As a first conclusion on expected impact on handover performance measures, our results indicate a general optimum for handover anticipation time in 802.11 networks of 25 ms.

2022-08-31T12:20:53.486Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0701130", "ArXiv": "cs/0701130", "MAG": "2950607893", "CorpusId": "555", "PubMed": null, "DOI": "10.1109/ICN.2007.61", "PubMedCentral": null }

https://www.semanticscholar.org/paper/66591a6e543a02b27fcae921f48d45582be04bf7

On the Correlation of Geographic and Network Proximity at Internet Edges and Its Implications for Mobile Unicast and Multicast Routing

[ { "authorId": "145827833", "name": "T. Schmidt" }, { "authorId": "9381507", "name": "Matthias Wählisch" }, { "authorId": "48379623", "name": "Y. Zhang" } ]

Sixth International Conference on Networking (ICN'07)

2,007

17

4

0

true

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

[ "JournalArticle", "Conference" ]

2007-01-20T00:00:00

{ "name": "Sixth International Conference on Networking (ICN'07)", "volume": null, "pages": "94-94" }

[ "handover", "intermediate node", "handover performance", "access network", "access routers", "unicast", "mobile internet", "routing algorithms", "multicasts", "internet", "multicast routing" ]

[ "internet", "unicast", "multicasts", "multicast routing", "routing algorithms", "handover", "mobile internet", "handover performance", "access network", "access routers", "routers", "round-trip time", "intermediate node", "network architecture", "handover process", "vertical handovers", "multicast traffic", "routing scheme", "distribution functions" ]

[ "network architecture", "handover", "multicast routing", "handover process", "intermediate node", "round-trip time", "multicast traffic", "access routers", "access network", "distribution functions", "routing scheme", "unicast", "mobile internet", "routers", "routing algorithms", "handover performance", "vertical handovers", "multicasts", "internet" ]

[ "computer networks", "mobile telecommunication systems", "internet protocols", "telecommunication links", "network routing", "quality of service", "wireless networks", "ad hoc networks", "sensor networks", "wireless sensor networks", "network coding", "routing protocols", "transmission control protocol", "mobile ip", "mobile nodes", "broadband networks", "fiber optic networks", "local area networks", "probability density function", "probability distributions", "mobile devices", "telecommunication traffic", "bandwidth", "radio systems", "wireless telecommunication systems", "telecommunication networks", "data communication systems", "computer science", "communication channels", "wireless communications", "packet networks", "wireless local area networks (wlan)", "sensors", "embedded systems", "energy utilization", "sensor nodes", "information theory", "congestion control (communication)", "probability", "mobile computing", "communication systems", "telecommunication systems", "computer systems", "computer hardware", "electricity", "communication", "mathematics", "engineering" ]

558

Studies of Aspect-Oriented Programming (AOP) usually focus on a language in which a specific aspect extension is integrated with a base language. Languages specified in this manner have a fixed, non-extensible AOP functionality. This paper argues the need for AOP to support the integration and use of multiple domain-specific aspect extensions together. We study the more general case of integrating a base language with a set of third-party aspect extensions for that language. We present a general mixin-based semantic framework for implementing dynamic aspect extensions in such a way that multiple, independently developed aspect mechanisms can be subject to third-party composition and work collaboratively. Principles governing the design of a collaborative aspect mechanism are aspectual effect exposure and implementation hiding.

2022-09-03T14:10:40.012Z

{ "ACL": null, "DBLP": "conf/oopsla/KojarskiL05", "ArXiv": "cs/0505004", "MAG": "2054494096", "CorpusId": "558", "PubMed": null, "DOI": "10.1145/1094811.1094831", "PubMedCentral": null }

https://www.semanticscholar.org/paper/36af27db916d7ec3f5dc0e847e04458e5b37f7c4

Pluggable AOP: designing aspect mechanisms for third-party composition

[ { "authorId": "2151287", "name": "Sergei Kojarski" }, { "authorId": "2153132", "name": "D. Lorenz" } ]

OOPSLA '05

2,005

78

32

3

true

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

[ "JournalArticle" ]

2005-04-30T00:00:00

{ "name": null, "volume": null, "pages": "247-263" }

[ "aspect-oriented programming", "aop", "semantics" ]

[ "aspect-oriented programming", "aop", "semantics", "programming languages", "aspect-oriented" ]

[ "programming languages", "aop", "aspect-oriented programming", "aspect-oriented", "semantics" ]

[ "computer programming languages", "linguistics", "computer systems programming", "software design", "software architecture", "computer programming", "software engineering", "object oriented programming", "computer science" ]

559

We consider geometric instances of the Maximum Weighted Matching Problem (MWMP) and the Maximum Traveling Salesman Problem (MTSP) with up to 3,000,000 vertices. Making use of a geometric duality relationship between MWMP, MTSP, and the Fermat-Weber-Problem (FWP), we develop a heuristic approach that yields in near-linear time solutions as well as upper bounds. Using various computational tools, we get solutions within considerably less than 1% of the optimum.An interesting feature of our approach is that, even though an FWP is hard to compute in theory and Edmonds' algorithm for maximum weighted matching yields a polynomial solution for the MWMP, the practical behavior is just the opposite, and we can solve the FWP with high accuracy in order to find a good heuristic solution for the MWMP.

2022-09-02T18:49:51.765Z

{ "ACL": null, "DBLP": "journals/corr/cs-DS-0212044", "ArXiv": "cs/0212044", "MAG": "2178480572", "CorpusId": "559", "PubMed": null, "DOI": "10.1145/944618.944629", "PubMedCentral": null }

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

Solving a "Hard" problem to approximate an "Easy" one: heuristics for maximum matchings and maximum traveling salesman problems

[ { "authorId": "1707693", "name": "S. Fekete" }, { "authorId": "143936187", "name": "H. Meijer" }, { "authorId": "2888835", "name": "André Rohe" }, { "authorId": "26126082", "name": "Walter Tietze" } ]

JEAL

2,001

47

23

1

false

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

[ "JournalArticle" ]

2001-01-05T00:00:00

{ "name": "ArXiv", "volume": "cs.DS/0212044", "pages": null }

[ "maximum matchings", "heuristic approaches" ]

[ "heuristic approaches", "maximum matchings", "matching algorithm", "matching methods", "combinatorial problems" ]

[ "matching algorithm", "combinatorial problems", "maximum matchings", "matching methods", "heuristic approaches" ]

[ "image matching", "combinatorial mathematics", "approximation algorithms", "bipartite graphs", "heuristic programming", "image processing", "graph theory", "approximation theory", "artificial intelligence", "computer imaging and vision", "theoretical computer science", "mathematics", "computer science" ]

561

A definition for a class of asynchronous cellular arrays is proposed. An example of such asynchrony would be independent Poisson arrivals of cell iterations. The Ising model in the continuous time formulation of Glauber falls into this class. Also proposed are efficient parallel algorithms for simulating these asynchronous cellular arrays. In the algorithms, one or several cells are assigned to a processing element (PE), local times for different PEs can be different. Although the standard serial algorithm by Metropolis, Rosenbluth, Rosenbluth, Teller, and Teller can simulate such arrays, it is usually believed to be without an efficient parallel counterpart. However, the proposed parallel algorithms contradict this belief proving to be both efficient and able to perform the same task as the standard algorithm. The results of experiments with the new algorithms are encouraging: the speed-up is greater than 16 using 25 PEs on a shared memory MIMD bus computer, and greater than 1900 using 2**14 PEs on a SIMD computer. The algorithm by Bortz, Kalos, and Lebowitz can be incorporated in the proposed parallel algorithms, further contributing to speed-up. [In this paper I invented the update-cites-of-local-time-minima parallel simulation scheme. Now the scheme is becoming popular. Many misprints of the original 1987 Complex Systems publication are corrected here.-B.L.]

2022-09-02T15:39:59.059Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0502039", "ArXiv": "cs/0502039", "MAG": "1635531668", "CorpusId": "561", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Efficient Parallel Simulations of Asynchronous Cellular Arrays

[ { "authorId": "1723627", "name": "B. Lubachevsky" } ]

Complex Syst.

2,005

16

55

6

false

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

[ "JournalArticle" ]

2005-02-07T00:00:00

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

[ "parallel algorithms", "shared memories", "continuous time", "processing elements", "cellular arrays" ]

[ "asynchronous system", "cellular", "cellular arrays", "sub-arrays", "continuous time", "parallel algorithms" ]

[ "parallel algorithms", "shared memories", "continuous time", "processing elements", "cellular", "sub-arrays", "cellular arrays", "asynchronous system" ]

[ "parallel processing systems", "program processors", "parallel architectures", "continuous time systems", "field programmable gate array", "multiprocessing systems", "embedded systems", "wireless", "cellular telephone systems", "cellular radio systems", "direction of arrival", "fault tolerant computer systems", "distributed systems", "microprocessor chips", "linear systems", "linear matrix inequalities", "computer hardware", "computer systems", "radio", "mobile computing", "mobile telecommunication systems", "communication channels", "telecommunication traffic", "signal to noise ratio", "antenna arrays", "sensors", "computer networks", "distributed computer systems", "matrix algebra", "computer science", "wireless telecommunication systems", "telecommunication networks", "data communication systems", "signal processing", "antennas", "mathematics", "communication systems", "telecommunication systems", "engineering" ]

562

It is known at a qualitative level that directional antennas can be used to boost the capacity of wireless ad hoc networks. Lacking is a measure to quantify this advantage and to compare directional antennas of different footprint patterns. This paper introduces the concept of the effective beam width (and the effective null width as its dual counterpart) as a measure which quantitatively captures the capacity-boosting capability of directional antennas. Beam width is commonly defined to be the directional angle spread within which the main-lobe beam power is above a certain threshold. In contrast, our effective beam width definition lumps the effects of the (i) antenna pattern, (ii) active-node distribution, and (iii) channel characteristics, on network capacity into a single quantitative measure. We investigate the mathematical properties of the effective beam width and show how the convenience afforded by these properties can be used to analyze the effectiveness of complex directional antenna patterns in boosting network capacity, with fading and multi-user interference taken into account. In particular, we derive the extent to which network capacity can be scaled with the use of phased array antennas. We show that a phased array antenna with N elements can boost transport capacity of an Aloha-like network by a factor of order N^1.620.

2022-02-13T16:01:26.965Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0701131", "ArXiv": "cs/0701131", "MAG": "1669512234", "CorpusId": "562", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Effective Beam Width of Directional Antennas in Wireless Ad Hoc Networks

[ { "authorId": "2128685665", "name": "Jialiang Zhang" }, { "authorId": "1736584", "name": "S. Liew" } ]

ArXiv

2,007

31

1

0

false

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

[ "JournalArticle" ]

2007-01-21T00:00:00

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

[ "wireless", "ad hoc networks", "multi-user interference", "beam widths", "antenna pattern", "phased array antennas", "directional antenna", "boosting", "channel characteristics" ]

[ "beam widths", "directional antenna", "antennas", "antenna arrays", "wireless", "ad hoc networks", "array antennas", "antenna pattern", "channel characteristics", "phased arrays", "phased array antennas", "antenna element", "antenna systems", "omni-directional antenna", "radiation patterns", "network architecture", "mobile ad hoc networks" ]

[ "mobile ad hoc networks", "phased arrays", "network architecture", "antennas", "antenna element", "array antennas", "wireless", "antenna arrays", "omni-directional antenna", "radiation patterns", "ad hoc networks", "multi-user interference", "beam widths", "antenna pattern", "phased array antennas", "directional antenna", "boosting", "channel characteristics", "antenna systems" ]

[ "routing protocols", "antenna phased arrays", "computer networks", "wireless telecommunication systems", "mim devices", "antenna accessories", "directional patterns (antenna)", "radio", "communication channels", "signal to noise ratio", "matrix algebra", "directive antennas", "routers", "mobile telecommunication systems", "internet protocols", "quality of service", "wireless local area networks (wlan)", "multicasts", "routing algorithms", "sensors", "code division multiple access", "bit error rate", "signal receivers", "adaptive boosting", "channel model", "computer science", "communication systems", "telecommunication systems", "multiplexing", "signal processing", "mathematics", "telecommunication traffic", "bandwidth", "telecommunication networks", "local area networks", "data communication systems", "computer hardware", "probability", "signal detection", "classifiers", "fading channels", "channel capacity", "mimo systems", "computer systems", "engineering", "machine learning", "information theory", "artificial intelligence", "communication" ]

564

Resumen. El modo de acceder a la informacion ha evolucionado sobremanera gracias al desarrollo de las nuevas tecnologias y de las posibilidades que ofrece la multimedia. El proyecto que aqui se presenta, valiendose de estos avances, pretende crear una comunidad de Bibliotecas Virtuales que contengan el maximo posible de informacion en formato multimedia, divulgandola de modo atractivo, rapido y transparente al lector usuario. CiberBiblio es una Biblioteca Virtual de programas interactivos editados en el Pais Vasco desarrollada conjuntamente por la Fundacion Cultural Privada Aurten Bai, empresa dedicada a la promocion y difusion de la cultura y lengua vascas, y el Grupo Hipermedia y Multimedia (GHyM) de la UPV-EHU. Es de cobertura local, distribuida, de acceso libre con contenidos de interes general, basada en una arquitectura sencilla, escalable, y que utiliza mecanismos de comparticion de recursos para llevar a cabo su cometido. En este articulo se describe con detalle cada una de las cualidades antes mencionadas y se comentan aspectos a tener en cuenta a la hora de implantar un servicio de estas caracteristicas, haciendo especial hincapie en los problemas que se deben solventar para ello.

2022-02-13T16:00:07.271Z

{ "ACL": null, "DBLP": "conf/jbidi/Lopez-CuadradoVSPAZ01", "ArXiv": null, "MAG": "1559962876", "CorpusId": "564", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

CIBERBIBLIO: Una Biblioteca Virtual Multimedia

[ { "authorId": "2066043223", "name": "Javier López-Cuadrado" }, { "authorId": "2102952698", "name": "Mikel Villamañe" }, { "authorId": "2054358022", "name": "Julián Gutiérrez Serrano" }, { "authorId": "1739549953", "name": "Tomás Andrés Pérez" }, { "authorId": "3114312", "name": "R. Arruabarrena" }, { "authorId": "1993692", "name": "José Ángel Vadillo Zorita" } ]

JBIDI

2,001

9

0

false

null

[ "JournalArticle" ]

null

{ "name": "", "volume": "", "pages": "5" }

[]

[ "multimedia contents", "virtual spaces", "multimedia data", "interactive multimedia", "streaming media" ]

[ "streaming media", "interactive multimedia", "virtual spaces", "multimedia data", "multimedia contents" ]

[ "media streaming", "multimedia systems", "interactive computer systems", "virtual reality", "multimedia services", "acoustic streaming", "internet", "user interfaces", "human computer interaction", "internet protocols", "videotex", "computer science", "telecommunication traffic", "video streaming", "telecommunication networks", "image coding", "telecommunication systems", "image processing", "computer systems", "computer imaging and vision" ]

566

Motivated by secure wireless networking, we consider the problem of placing fixed localizers that enable mobile communication devices to prove they belong to a secure region that is defined by the interior of a polygon. Each localizer views an infinite wedge of the plane, and a device can prove membership in the secure region if it is inside the wedges for a set of localizers whose common intersection contains no points outside the polygon. This model leads to a broad class of new art gallery type problems, for which we provide upper and lower bounds.

2022-08-25T17:13:11.286Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0603057", "ArXiv": "cs/0603057", "MAG": "1656537067", "CorpusId": "566", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/1f8a6ee1e410de44495ae9bae6b6c0b542697a6d

Guard Placement For Wireless Localization

[ { "authorId": "1719358", "name": "D. Eppstein" }, { "authorId": "1679615", "name": "M. Goodrich" }, { "authorId": "1731269", "name": "N. Sitchinava" } ]

ArXiv

2,006

26

8

1

false

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

[ "JournalArticle" ]

2006-03-14T00:00:00

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

[ "mobile communications", "wireless" ]

[ "wireless", "wireless communications", "mobile communications", "communication", "mobile terminal" ]

[ "mobile communications", "wireless communications", "wireless", "mobile terminal", "communication" ]

[ "mobile telecommunication systems", "computer networks", "radio", "mobile phones", "communication channels", "telecommunication networks", "computer science", "wireless telecommunication systems", "computer hardware", "telecommunication systems", "communication systems", "computer systems" ]

569

This paper develops a computational model of paraphrase under which text modification is carried out reluctantly; that is, there are external constraints, such as length or readability, on an otherwise ideal text, and modifications to the text are necessary to ensure conformance to these constraints. This problem is analogous to a mathematical optimisation problem: the textual constraints can be described as a set of constraint equations, and the requirement for minimal change to the text can be expressed as a function to be minimised; so techniques from this domain can be used to solve the problem. The work is done as part of a computational paraphrase system using the XTAG system as a base. The paper will present a theoretical computational framework for working within the Reluctant Paraphrase paradigm: three types of textual constraints are specified, effects of paraphrase on text are described, and a model incorporating mathematical optimisation techniques is outlined.

2022-09-03T06:17:41.846Z

{ "ACL": null, "DBLP": "journals/corr/cmp-lg-9707001", "ArXiv": "cmp-lg/9707001", "MAG": "1519539483", "CorpusId": "569", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Reluctant Paraphrase: Textual Restructuring under an Optimisation Model

[ { "authorId": "1795294", "name": "M. Dras" } ]

ArXiv

1,997

21

18

0

false

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

[ "JournalArticle" ]

1997-07-03T00:00:00

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

[ "optimization problems" ]

[ "multi-objective optimisation", "textual data", "differential equations", "text document", "text data" ]

[ "textual data", "multi-objective optimisation", "differential equations", "text document", "text data", "optimization problems" ]

[ "text mining", "evolutionary algorithms", "numerical methods", "information retrieval systems", "correlation analysis", "text processing", "genetic algorithms", "mathematics", "database systems", "information retrieval", "natural language processing", "computational linguistics", "data mining", "artificial intelligence", "computer systems", "computer science", "natural languages", "linguistics", "semantics" ]

574

An important goal for digital libraries is to enable researchers to more easily explore related work. While citation data is often used as an indicator of relatedness, in this paper we demonstrate that digital access records (e.g. http-server logs) can be used as indicators as well. In particular, we show that measures based on co-access provide better coverage than co-citation, that they are available much sooner, and that they are more accurate for recent papers.

2022-09-04T09:05:20.805Z

{ "ACL": null, "DBLP": "journals/corr/abs-0704-2902", "ArXiv": "0704.2902", "MAG": "2007628822", "CorpusId": "574", "PubMed": null, "DOI": "10.1145/1255175.1255260", "PubMedCentral": null }

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

Recommending related papers based on digital library access records

[ { "authorId": "2056595203", "name": "Stefan Pohl" }, { "authorId": "1803571", "name": "Filip Radlinski" }, { "authorId": "1680188", "name": "T. Joachims" } ]

JCDL '07

2,007

9

38

4

true

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

[ "JournalArticle" ]

2007-04-23T00:00:00

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

[ "digital libraries" ]

[ "digital libraries", "digital collections", "libraries", "coauthorship", "semantic distance" ]

[ "semantic distance", "digital libraries", "coauthorship", "libraries", "digital collections" ]

[ "semantic similarity", "world wide web", "database systems", "user interfaces", "social network analysis", "education", "natural language processing", "ontology", "internet", "computer systems", "human computer interaction", "social networks", "artificial intelligence", "natural languages", "semantics", "computer science", "linguistics" ]

575

We present an algorithm to perform a simultaneous modular reduction of several residues. This enables to compress polynomials into integers and perform several modular operations with machine integer arithmetic. The idea is to convert the X-adic representation of modular polynomials, with X an indeterminate, to a q-adic representation where q is an integer larger than the field characteristic. With some control on the different involved sizes it is then possible to perform some of the q-adic arithmetic directly with machine integers or floating points. Depending also on the number of performed numerical operations one can then convert back to the q-adic or X-adic representation and eventually mod out high residues. In this note we present a new version of both conversions: more tabulations and a way to reduce the number of divisions involved in the process are presented. The polynomial multiplication is then applied to arithmetic and linear algebra in small finite field extensions.

2022-09-02T03:11:47.225Z

{ "ACL": null, "DBLP": "conf/issac/Dumas08", "ArXiv": "0710.0510", "MAG": "2089130193", "CorpusId": "575", "PubMed": null, "DOI": "10.1145/1390768.1390780", "PubMedCentral": null }

https://www.semanticscholar.org/paper/88f7b68a0563313f50e387f335f500bd32d4b874

Q-adic transform revisited

[ { "authorId": "145561355", "name": "J. Dumas" } ]

ISSAC '08

2,007

17

8

0

true

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

[ "JournalArticle" ]

2007-10-02T00:00:00

{ "name": null, "volume": null, "pages": "63-70" }

[ "multiplication", "floating points", "finite fields" ]

[ "floating-point arithmetic", "multiplication", "finite fields", "real number", "floating points" ]

[ "floating points", "finite fields", "multiplication", "real number", "floating-point arithmetic" ]

[ "digital arithmetic", "cryptography", "information theory", "multiplying circuits", "number theory", "field programmable gate array", "mathematics", "cryptology", "communication", "adders", "integrated circuit layout", "digital signal processing", "numerical methods", "computer hardware", "computer security", "vlsi circuits", "computer aided design", "microprocessor chips", "signal processing", "computer science", "engineering" ]

577

Geometric complexity theory (GCT) is an approach to the $P$ vs. $NP$ and related problems through algebraic geometry and representation theory. This article gives a high-level exposition of the basic plan of GCT based on the principle, called the flip, without assuming any background in algebraic geometry or representation theory.

2022-09-05T02:08:40.415Z

{ "ACL": null, "DBLP": "journals/corr/abs-0709-0748", "ArXiv": "0709.0748", "MAG": "1585088333", "CorpusId": "577", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/03c2ed0ec039709799f79659e7c378c29f9d9757

On P vs. NP, Geometric Complexity Theory, and the Flip I: a high level view

[ { "authorId": "2641986", "name": "K. Mulmuley" } ]

ArXiv

2,007

140

12

1

false

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

[ "JournalArticle" ]

2007-09-05T00:00:00

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

[ "geometry" ]

[ "geometry", "viewpoint", "system theory" ]

[ "viewpoint", "system theory", "geometry" ]

[ "software architecture", "artificial intelligence", "software design", "computer science", "software engineering" ]

578

Network firewalls and routers use a rule database to decide which packets will be allowed from one network onto another. By filtering packets the firewalls and routers can improve security and performance. However, as the size of the rule list increases, it becomes difficult to maintain and validate the rules, and lookup latency may increase significantly. Ordered binary decision diagrams (BDDs) - a compact method of representing and manipulating boolean expressions - are a potential method of representing the rules. This paper presents a new algorithm for representing such lists as a BDD and then shows how the resulting boolean expression can be used to analyse rule sets.

2022-09-05T00:56:43.509Z

{ "ACL": null, "DBLP": "journals/corr/cs-NI-0008006", "ArXiv": "cs/0008006", "MAG": "1639322829", "CorpusId": "578", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Algorithms for Analysing Firewall and Router Access Lists

[ { "authorId": "3295785", "name": "S. Hazelhurst" } ]

ArXiv

2,000

7

88

5

false

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

[ "JournalArticle" ]

2000-08-09T00:00:00

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

[ "bdd", "routers", "firewall", "binary decision diagrams", "database systems", "decision diagram" ]

[ "firewall", "routers", "database systems", "binary decision", "binary decision diagrams", "bdd", "decision diagram" ]

[ "bdd", "routers", "firewall", "binary decision diagrams", "database systems", "binary decision", "decision diagram" ]

[ "telecommunication traffic", "bandwidth", "computer system firewalls", "decision theory", "finite automata", "logic design", "boolean functions", "computer systems", "fusion center", "telecommunication networks", "computer networks", "computer crime", "network security", "artificial intelligence", "automata theory", "field programmable gate array", "mathematics", "computer science", "cognitive radio", "sensor networks", "wireless sensor networks", "sensor data fusion", "fading channels", "signal detection", "data fusion", "telecommunication systems", "security of data", "cryptography", "formal languages and automata theory", "computer hardware", "wireless telecommunication systems", "routing algorithms", "embedded systems", "sensors", "wireless communications", "energy utilization", "sensor nodes", "signal processing", "communication channels", "signal to noise ratio", "computer security", "cryptology", "theoretical computer science", "communication systems", "electricity", "engineering" ]

584

Context sensitive rewrite rules have been widely used in several areas of natural language processing, including syntax, morphology, phonology and speech processing. Kaplan and Kay, Karttunen, and Mohri & Sproat have given various algorithms to compile such rewrite rules into finite-state transducers. The present paper extends this work by allowing a limited form of backreferencing in such rules. The explicit use of backreferencing leads to more elegant and general solutions.

2022-08-29T14:30:56.491Z

{ "ACL": "E99-1017", "DBLP": "conf/eacl/GerdemannN99", "ArXiv": "cs/9904008", "MAG": "2021833629", "CorpusId": "584", "PubMed": null, "DOI": "10.3115/977035.977053", "PubMedCentral": null }

https://www.semanticscholar.org/paper/018c8c942d38c46e90b7a633b079cf0d0db13078

Transducers from Rewrite Rules with Backreferences

[ { "authorId": "1717808", "name": "D. Gerdemann" }, { "authorId": "143715131", "name": "Gertjan van Noord" } ]

EACL

1,999

38

50

1

true

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

[ "JournalArticle", "Conference" ]

1999-04-15T00:00:00

{ "name": null, "volume": null, "pages": "126-133" }

[ "phonology", "natural language processing" ]

[ "natural languages", "natural language processing", "phonology", "rule base", "natural language understanding", "text processing" ]

[ "text processing", "natural languages", "natural language processing", "phonology", "natural language understanding", "rule base" ]

[ "computational linguistics", "data mining", "information retrieval", "linguistics", "semantics", "artificial intelligence", "knowledge representation", "knowledge based systems", "database systems", "computer science", "computer systems" ]

587

Information technology should have much to offer linguistics, not only through the opportunities offered by large-scale data analysis and the stimulus to develop formal computational models, but through the chance to use language in systems for automatic natural language processing. The paper discusses these possibilities in detail, and then examines the actual work that has been done. It is evident that this has so far been primarily research within a new field, computational linguistics, which is largely motivated by the demands, and interest, of practical processing systems, and that information technology has had rather little influence on linguistics at large. There are different reasons for this, and not all good ones: information technology deserves more attention from linguists.

2022-06-20T12:13:38.465Z

{ "ACL": null, "DBLP": "journals/corr/cmp-lg-9702011", "ArXiv": "cmp-lg/9702011", "MAG": "1508659016", "CorpusId": "587", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/55c6a2270a8c549a84bc284be37d0b977d14a54e

How much has information technology contributed to linguistics?

[ { "authorId": "145848824", "name": "Karen Spärck Jones" } ]

ArXiv

1,997

109

4

0

false

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

[ "JournalArticle" ]

1997-02-17T00:00:00

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

[ "information technology", "linguistics", "computational linguistics", "natural language processing" ]

[ "information technology", "linguistics", "computational linguistics", "natural languages", "natural language processing" ]

[ "computational linguistics", "natural languages", "linguistics", "natural language processing", "information technology" ]

[ "database systems", "semantics", "artificial intelligence", "computer science", "computer systems" ]

589

Much work in computer science has adopted competitive analysis as a tool for decision making under uncertainty. In this work we extend competitive analysis to the context of multi-agent systems. Unlike classical competitive analysis where the behavior of an agent's environment is taken to be arbitrary, we consider the case where an agent's environment consists of other agents. These agents will usually obey some (minimal) rationality constraints. This leads to the definition of rational competitive analysis. We introduce the concept of rational competitive analysis, and initiate the study of competitive analysis for multi-agent systems. We also discuss the application of rational competitive analysis to the context of bidding games, as well as to the classical oneway trading problem.

2022-09-02T11:49:21.735Z

{ "ACL": null, "DBLP": "journals/corr/cs-AI-0112015", "ArXiv": "cs/0112015", "MAG": "2951793235", "CorpusId": "589", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Rational Competitive Analysis

[ { "authorId": "1708847", "name": "Moshe Tennenholtz" } ]

IJCAI

2,001

23

12

1

false

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

[ "JournalArticle", "Conference" ]

2001-08-04T00:00:00

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

[ "competitive analysis", "computer science", "multiagent system" ]

[ "competitive analysis", "computer science", "multi-agent", "multiagent system", "agent systems" ]

[ "competitive analysis", "computer science", "agent systems", "multi-agent", "multiagent system" ]

[ "on-line algorithms", "intelligent agents", "mobile agents", "artificial intelligence", "online systems", "mobile computing", "mobile telecommunication systems", "distributed computer systems", "computer systems", "wireless telecommunication systems", "telecommunication networks", "data communication systems", "communication channels", "computer networks", "communication systems", "telecommunication systems" ]

590

Relational representation of knowledge makes it possible to perform all the computations and decision making in a uniform relational way by means of special relational compositions called triangle and square products. In this paper some applications in manufacturing related to cost analysis are described. Testing fuzzy relational structures for various relational properties allows us to discover dependencies, hierarchies, similarities, and equivalences of the attributes characterizing technological processes and manufactured artifacts in their relationship to costs and performance. A brief overview of mathematical aspects of BK-relational products is given in Appendix 1 together with further references in the literature.

2022-09-03T09:41:20.348Z

{ "ACL": null, "DBLP": "journals/corr/cs-CE-0310021", "ArXiv": "cs/0310021", "MAG": "1727219661", "CorpusId": "590", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Fuzzy Relational Modeling of Cost and Affordability for Advanced Technology Manufacturing Environment

[ { "authorId": "3340301", "name": "L. Kohout" }, { "authorId": "40504686", "name": "Eunjin Kim" }, { "authorId": "2040850", "name": "G. Zenz" } ]

ArXiv

2,003

106

2

0

false

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

[ "JournalArticle", "Review" ]

2003-10-11T00:00:00

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

[]

[ "relational data models", "investment costs", "capital investment", "flexible manufacturing", "parallel computation" ]

[ "parallel computation", "capital investment", "investment costs", "relational data models", "flexible manufacturing" ]

[ "parallel algorithms", "parallel computing", "investments", "relational database", "flexible manufacturing systems", "parallel processing systems", "parallel architectures", "economics", "knowledge based systems", "query languages", "petri nets", "distributed systems", "artificial intelligence", "database systems", "graph theory", "distributed computer systems", "computer science", "computer systems", "theoretical computer science" ]

591

With the increasing demand of users in the broadcasting and communication services, coverage and interference prediction techniques need to be more accurate and applicable under different conditions. No single propagation model satisfies all the variations observed by the signal. Tuning of the existing models and development of new models are continuing and ongoing processes. With this objective in the present study path loss exponents have been deduced from various VHF/UHF measurements conducted over different regions of Indian subcontinent. These have been compared with the model of Perez-Vega and Zamanillo. The suitability of the model and the deviations has been presented in the paper

2022-09-03T19:34:46.408Z

{ "ACL": null, "DBLP": "journals/tbc/Prasad06", "ArXiv": null, "MAG": "2160265340", "CorpusId": "591", "PubMed": null, "DOI": "10.1109/TBC.2006.879853", "PubMedCentral": null }

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

Path loss exponents deduced from VHF & UHF measurements over Indian subcontinent and model comparison

[ { "authorId": "144404363", "name": "M. Prasad" } ]

IEEE Transactions on Broadcasting

2,006

8

15

2

false

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

[ "JournalArticle" ]

2006-08-21T00:00:00

{ "name": "IEEE Transactions on Broadcasting", "volume": "52", "pages": "290-298" }

[ "communication", "uhf", "broadcasting" ]

[ "uhf", "ultra-high frequency", "broadcasting", "communication", "hierarchical model" ]

[ "ultra-high frequency", "uhf", "hierarchical model", "communication", "broadcasting" ]

[ "uhf rfid", "rfid", "hierarchical system", "communication channels", "antennas", "rfid systems", "tracked objects", "radio waves", "computer systems", "wireless telecommunication systems", "authentication", "rf-id tags", "cryptography", "object tracking", "target tracking", "signal processing", "computer science", "computer networks", "communication systems", "telecommunication systems", "security of data", "cryptology", "object recognition", "sensors", "engineering", "computer security", "pattern recognition", "image segmentation", "computer hardware", "machine learning", "image analysis", "image processing", "artificial intelligence", "computer imaging and vision" ]

594

Temiar reduplication is a difficult piece of prosodic morphology. This paper presents the first computational analysis of Temiar reduplication, using the novel finite-state approach of One-Level Prosodic Morphology originally developed by Walther (1999b, 2000). After reviewing both the data and the basic tenets of One-level Prosodic Morphology, the analysis is laid out in some detail, using the notation of the FSA Utilities finite-state toolkit (van Noord 1997). One important discovery is that in this approach one can easily define a regular expression operator which ambiguously scans a string in the leftor rightward direction for a certain prosodic property. This yields an elegant account of base-length-dependent triggering of reduplication as found in Temiar.

2022-09-01T23:28:04.148Z

{ "ACL": "W00-1802", "DBLP": "journals/corr/cs-CL-0008015", "ArXiv": "cs/0008015", "MAG": "2165706900", "CorpusId": "594", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/760f121108801cfe40becf58177d106db0fc43aa

Temiar Reduplication in One-Level Prosodic Morphology

[ { "authorId": "144380013", "name": "Markus Walther" } ]

ACL 2000

2,000

18

5

0

false

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

[ "JournalArticle", "Review" ]

2000-08-01T00:00:00

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

[]

[ "finite state automata", "finite state machines", "correlation analysis", "automation", "finite automata" ]

[ "finite state machines", "automation", "correlation analysis", "finite state automata", "finite automata" ]

[ "engineering", "mathematics", "translation (languages)", "automata theory", "computational linguistics", "linguistics", "formal languages and automata theory", "database systems", "theoretical computer science", "computer systems", "computer science" ]

595

In this- two-part series of papers, a generalized non-orthogonal amplify and forward (GNAF) protocol which generalizes several known cooperative diversity protocols is proposed. Transmission in the GNAF protocol comprises of two phases - the broadcast phase and the cooperation phase. In the broadcast phase, the source broadcasts its information to the relays as well as the destination. In the cooperation phase, the source and the relays together transmit a space-time code in a distributed fashion. The GNAF protocol relaxes the constraints imposed by the protocol of Jing and Hassibi on the code structure. In part-I of this paper, a code design criteria is obtained and it is shown that the GNAF protocol is delay efficient and coding gain efficient as well. Moreover the GNAF protocol enables the use of sphere decoders at the destination with a non-exponential maximum likelihood (ML) decoding complexity. In part-II, several low decoding complexity code constructions are studied and a lower bound on the diversity-multiplexing gain tradeoff of the GNAF protocol is obtained

2022-09-02T05:47:10.095Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0610161", "ArXiv": "cs/0610161", "MAG": "2164937706", "CorpusId": "595", "PubMed": null, "DOI": "10.1109/ITW2.2006.323826", "PubMedCentral": null }

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

A Non-orthogonal Distributed Space-Time Coded Protocol Part I: Signal Model and Design Criteria

[ { "authorId": "144760509", "name": "G. Rajan" }, { "authorId": "144190949", "name": "B. S. Rajan" } ]

2006 IEEE Information Theory Workshop - ITW '06 Chengdu

2,006

20

40

2

true

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

[ "JournalArticle" ]

2006-10-01T00:00:00

{ "name": "2006 IEEE Information Theory Workshop - ITW '06 Chengdu", "volume": null, "pages": "385-389" }

[ "broadcast", "coding gains", "maximum likelihood", "space-time coding", "decoding complexity", "cooperative diversity" ]

[ "space-time coding", "communication protocols", "transport protocols", "cooperative diversity", "broadcast", "maximum likelihood", "multiplexing", "multiplexing gains" ]

[ "broadcast", "multiplexing gains", "coding gains", "maximum likelihood", "space-time coding", "multiplexing", "decoding complexity", "transport protocols", "communication protocols", "cooperative diversity" ]

[ "ad hoc networks", "broadcasting", "channel state information", "space time adaptive processing", "mim devices", "image coding", "block codes", "rayleigh fading", "maximum likelihood estimation", "likelihood functions", "signal encoding", "antennas", "communication channels", "signal to noise ratio", "iterative decoding", "transmission control protocol", "data communication systems", "network protocols", "communication", "wireless networks", "diversity reception", "channel capacity", "routers", "mobile telecommunication systems", "internet protocols", "quality of service", "wireless local area networks (wlan)", "multicasts", "routing algorithms", "sensors", "fading (radio)", "transmitters", "mimo systems", "fading channels", "image processing", "bit error rate", "information theory", "mathematics", "correlation analysis", "wireless telecommunication systems", "signal processing", "congestion control (communication)", "computer systems", "internet", "computer networks", "wireless communications", "packet networks", "signal receivers", "telecommunication traffic", "bandwidth", "telecommunication networks", "local area networks", "computer hardware", "signal detection", "computer imaging and vision", "probability", "communication systems", "telecommunication systems", "engineering", "computer science" ]

596

I describe a newly developed online scientific web-log (SciBlog). The online facility consists of several moduls needed in a common and conventional research activity. I show that this enables scientists around the world to perform an online collaboration over the net.

2022-09-02T19:21:40.459Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0508061", "ArXiv": "cs/0508061", "MAG": "1681085083", "CorpusId": "596", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/807e97a633913c83ac30400fc615d0130944f22a

SciBlog : A Tool for Scientific Collaboration

[ { "authorId": "1748301", "name": "L. T. Handoko" } ]

ArXiv

2,005

0

2

1

false

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

[ "JournalArticle" ]

2005-08-11T00:00:00

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

[]

[ "online learning", "collaborative work", "cooperative works", "collaborative activities", "world wide web" ]

[ "world wide web", "online learning", "collaborative work", "collaborative activities", "cooperative works" ]

[ "internet", "online systems", "groupware", "human engineering", "collaborative learning", "computer science", "computer systems", "interactive computer systems", "human computer interaction", "e-learning", "user interfaces", "information systems", "education" ]

598

An animation manifold encapsulates an animation sequence of surfaces contained within a higher dimensional manifold with one dimension being time. An iso–surface extracted from this structure is a frame of the animation sequence. In this dissertation I make an argument for the use of animation manifolds as a representation of complex animation sequences. In particular animation manifolds can represent transitions between shapes with differing topological structure and polygonal density. I introduce the animation manifold, and show how it can be constructed from a keyframe animation sequence and rendered using raytracing or graphics hardware. I then adapt three Laplacian editing frameworks to the higher dimensional context. I derive new boundary conditions for both primal and dual Laplacian methods, and present a technique to adaptively regularise the sampling of a deformed manifold after editing. The animation manifold can be used to represent a morph sequence between surfaces of arbitrary topology. I present a novel framework for achieving this by connecting planar cross sections in a higher dimension with a new constrained Delaunay triangulation. Topological alteration is achieved by using the Voronoi skeleton, a novel structure which provides a fast medial axis approximation.

2022-07-01T02:07:11.265Z

{ "ACL": null, "DBLP": "phd/ethos/Southern08", "ArXiv": null, "MAG": "2505808490", "CorpusId": "598", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Animation manifolds for representing topological alteration

[ { "authorId": "144766839", "name": "Richard Southern" } ]

2,008

112

2

1

false

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

null

{ "name": "", "volume": "", "pages": null }

[ "topological structure", "topology", "graphics hardware", "medial axis", "voronoi" ]

[ "topological structure", "topology", "graphics hardware", "computer hardware", "voronoi", "medial axis" ]

[ "topological structure", "computer hardware", "topology", "graphics hardware", "medial axis", "voronoi" ]

[ "computer science", "interactive computer graphics", "gpu", "visualization", "voronoi diagrams", "geometry", "user interfaces", "computer imaging and vision", "program processors", "human computer interaction", "graphic methods", "parallel processing systems", "microprocessor chips", "graph theory", "distributed systems", "theoretical computer science", "distributed computer systems", "computer systems" ]

599

We propose a lexical organisation for multilingual lexical databases (MLDB). This organisation is based on acceptions (word-senses). We detail this lexical organisation and show a mock-up built to experiment with it. We also present our current work in defining and prototyping a specialised system for the management of acception-based MLDB.

2022-08-31T22:38:21.432Z

{ "ACL": "C94-1044", "DBLP": "conf/coling/Serasset94", "ArXiv": "cmp-lg/9502001", "MAG": "2171078680", "CorpusId": "599", "PubMed": null, "DOI": "10.3115/991886.991933", "PubMedCentral": null }

https://www.semanticscholar.org/paper/30b116414d52fe70fd407a2095995534e513d8eb

lnterlinguai Lexical Organisation for Multilingual Lexical Databases in NADIA

[ { "authorId": "1753940", "name": "Gilles Sérasset" } ]

COLING

1,994

16

40

1

true

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

[ "JournalArticle", "Conference" ]

1994-08-05T00:00:00

{ "name": null, "volume": null, "pages": "278-282" }

[ "lexical database", "prototyping" ]

[ "syntactics", "lexical database", "database systems", "word sense", "bilingual" ]

[ "bilingual", "prototyping", "word sense", "lexical database", "syntactics", "database systems" ]

[ "multilingualism", "software development", "word sense disambiguation", "natural language processing", "computational linguistics", "computer systems", "linguistics", "software project", "software architecture", "word segmentation", "artificial intelligence", "natural languages", "computer science", "software design", "character recognition", "semantics", "software engineering", "pattern recognition", "machine learning" ]

603

Ordinal regression is an important type of learning, which has properties of both classification and regression. Here we describe an effective approach to adapt a traditional neural network to learn ordinal categories. Our approach is a generalization of the perceptron method for ordinal regression. On several benchmark datasets, our method (NNRank) outperforms a neural network classification method. Compared with the ordinal regression methods using Gaussian processes and support vector machines, NNRank achieves comparable performance. Moreover, NNRank has the advantages of traditional neural networks: learning in both online and batch modes, handling very large training datasets, and making rapid predictions. These features make NNRank a useful and complementary tool for large-scale data mining tasks such as information retrieval, Web page ranking, collaborative filtering, and protein ranking in bioinformatics. The neural network software is available at: http://www.cs.missouri.edu/~chengji/cheng software.html.

2022-09-05T01:07:18.192Z

{ "ACL": null, "DBLP": "journals/corr/abs-0704-1028", "ArXiv": "0704.1028", "MAG": "2131490903", "CorpusId": "603", "PubMed": null, "DOI": "10.1109/IJCNN.2008.4633963", "PubMedCentral": null }

https://www.semanticscholar.org/paper/23c663410a862d2e7c7954ea6f6120d73aa39637

A neural network approach to ordinal regression

[ { "authorId": "39609402", "name": "Jianlin Cheng" }, { "authorId": "92471582", "name": "Zheng Wang" }, { "authorId": "2028880", "name": "G. Pollastri" } ]

2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence)

2,007

75

139

15

false

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

[ "JournalArticle", "Conference" ]

2007-04-08T00:00:00

{ "name": "2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence)", "volume": null, "pages": "1279-1284" }

[ "classification methods", "data mining", "collaborative filtering", "html", "http", "support vector machine", "web content", "bioinformatics", "software", "regression model", "gaussian processes", "neural networks", "information retrieval" ]

[ "neural networks", "feedforward neural networks", "regression model", "gaussians", "gaussian processes", "data mining", "information retrieval", "web content", "collaborative filtering", "bioinformatics", "software" ]

[ "classification methods", "data mining", "regression model", "feedforward neural networks", "collaborative filtering", "http", "gaussian processes", "support vector machine", "web content", "software", "gaussians", "html", "bioinformatics", "neural networks", "information retrieval" ]

[ "computer systems", "computer science", "correlation analysis", "recommender systems", "servers", "client server computer systems", "internet protocols", "gaussian distribution", "classifiers", "world wide web", "xml", "user interfaces", "machine learning", "mathematics", "security of data", "telecommunication traffic", "multimedia systems", "distributed computer systems", "data communication systems", "database systems", "gaussian noise (electronic)", "internet", "human computer interaction", "artificial intelligence", "computer security", "telecommunication networks", "signal to noise ratio", "telecommunication systems", "signal processing", "engineering" ]

604

Summary: Here, we present PRINSEQ for easy and rapid quality control and data preprocessing of genomic and metagenomic datasets. Summary statistics of FASTA (and QUAL) or FASTQ files are generated in tabular and graphical form and sequences can be filtered, reformatted and trimmed by a variety of options to improve downstream analysis. Availability and Implementation: This open-source application was implemented in Perl and can be used as a stand alone version or accessed online through a user-friendly web interface. The source code, user help and additional information are available at http://prinseq.sourceforge.net/. Contact: [email protected]; [email protected]

2022-09-05T03:52:32.012Z

{ "ACL": null, "DBLP": "journals/bioinformatics/SchmiederE11", "ArXiv": null, "MAG": "2121180999", "CorpusId": "604", "PubMed": "21278185", "DOI": "10.1093/bioinformatics/btr026", "PubMedCentral": "3051327" }

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

Quality control and preprocessing of metagenomic datasets

[ { "authorId": "145943966", "name": "Robert Schmieder" }, { "authorId": "144251731", "name": "R. Edwards" } ]

Bioinform.

2,011

7

3,622

359

true

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

[ "JournalArticle" ]

2011-01-28T00:00:00

{ "name": "Bioinformatics", "volume": "27", "pages": "863 - 864" }

[ "http", "correlation analysis", "source codes" ]

[ "correlation analysis", "source codes", "graphical representations", "user information", "switching control" ]

[ "correlation analysis", "source codes", "http", "graphical representations", "user information", "switching control" ]

[ "mathematics", "software engineering", "servers", "client server computer systems", "internet protocols", "graphic methods", "recommender systems", "personal information", "switching systems", "computer science", "world wide web", "security of data", "telecommunication traffic", "multimedia systems", "distributed computer systems", "data communication systems", "database systems", "user interfaces", "graph theory", "information retrieval", "privacy", "linear matrix inequalities", "internet", "computer security", "telecommunication networks", "computer systems", "human computer interaction", "theoretical computer science", "matrix algebra", "telecommunication systems" ]

605

We study the problem of generating connected random graphs with no self-loops or multiple edges and that, in addition, have a given degree sequence. The generation method we focus on is the edge-switching Markov-chain method, whose functioning depends on a parameter w related to the method's core operation of an edge switch. We analyze two existing heuristics for adjusting w during the generation of a graph and show that they result in a Markov chain whose stationary distribution is uniform, thus ensuring that generation occurs uniformly at random. We also introduce a novel w-adjusting heuristic which, even though it does not always lead to a Markov chain, is still guaranteed to converge to the uniform distribution under relatively mild conditions. We report on extensive computer experiments comparing the three heuristics' performance at generating random graphs whose node degrees are distributed as power laws.

2022-09-01T12:38:29.602Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0512105", "ArXiv": "cs/0512105", "MAG": "1603174542", "CorpusId": "605", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

A study of the edge-switching Markov-chain method for the generation of random graphs

[ { "authorId": "2103373", "name": "Alexandre O. Stauffer" }, { "authorId": "1685359", "name": "V. Barbosa" } ]

ArXiv

2,005

38

18

0

false

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

[ "JournalArticle" ]

2005-12-29T00:00:00

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

[ "random graphs", "markov chains", "stationary distribution" ]

[ "markov chains", "random graphs", "stationary distribution", "continuous time markov chain", "directed graphs" ]

[ "random graphs", "continuous time markov chain", "markov chains", "stationary distribution", "directed graphs" ]

[ "graph theory", "random processes", "stochastic processes", "markov processes", "probability distributions", "theoretical computer science", "probability", "correlation analysis", "computer science", "mathematics" ]

607

We present a construction for quantum error correcting codes. The basic ingredients are a graph and a finite Abelian group, from which the code can explicitly be obtained. We prove necessary and sufficient conditions for the graph such that the resulting code corrects a certain number of errors. This allows a simple verification of the one-error correcting property of codes of length 5 in any dimension. As examples, we construct a large class of maximum distance separable codes, i.e. codes saturating the Singleton bound, as well as a code of length 10 detecting three errors.

2022-09-04T20:50:13.751Z

{ "ACL": null, "DBLP": "journals/corr/quant-ph-0012111", "ArXiv": "quant-ph/0012111", "MAG": "1503834475", "CorpusId": "607", "PubMed": null, "DOI": "10.1103/PhysRevA.65.012308", "PubMedCentral": null }

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

Quantum error-correcting codes associated with graphs

[ { "authorId": "2024111", "name": "D. Schlingemann" }, { "authorId": "40479325", "name": "R. Werner" } ]

ArXiv

2,000

39

282

12

true

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

[ "JournalArticle" ]

2000-12-20T00:00:00

{ "name": "ArXiv", "volume": "quant-ph/0012111", "pages": null }

[ "verification", "sufficient conditions" ]

[ "directed graphs", "weighted graph", "sufficient conditions", "verification", "verification method" ]

[ "verification", "weighted graph", "sufficient conditions", "verification method", "directed graphs" ]

[ "verification and validation", "graphic methods", "linear matrix inequalities", "model checking", "formal verifications", "graph theory", "software quality", "matrix algebra", "embedded systems", "architecture verification and validation", "theoretical computer science", "software design", "mathematics", "computer systems", "architecting", "computer science", "software engineering", "software architecture" ]

608

Syntactic natural language parsers have shown themselves to be inadequate for processing highly-ambiguous large-vocabulary text, as is evidenced by their poor performance on domains like the Wall Street Journal, and by the movement away from parsing-based approaches to text-processing in general. In this paper, I describe SPATTER, a statistical parser based on decision-tree learning techniques which constructs a complete parse for every sentence and achieves accuracy rates far better than any published result. This work is based on the following premises: (1) grammars are too complex and detailed to develop manually for most interesting domains; (2) parsing models must rely heavily on lexical and contextual information to analyze sentences accurately; and (3) existing n-gram modeling techniques are inadequate for parsing models. In experiments comparing SPATTER with IBM's computer manuals parser, SPATTER significantly outperforms the grammar-based parser. Evaluating SPATTER against the Penn Treebank Wall Street Journal corpus using the PARSEVAL measures, SPATTER achieves 86% precision, 86% recall, and 1.3 crossing brackets per sentence for sentences of 40 words or less, and 91% precision, 90% recall, and 0.5 crossing brackets for sentences between 10 and 20 words in length.

2022-09-04T16:26:36.477Z

{ "ACL": "P95-1037", "DBLP": "journals/corr/cmp-lg-9504030", "ArXiv": "cmp-lg/9504030", "MAG": "2950455042", "CorpusId": "608", "PubMed": null, "DOI": "10.3115/981658.981695", "PubMedCentral": null }

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

Statistical Decision-Tree Models for Parsing

[ { "authorId": "2580777", "name": "David M. Magerman" } ]

ACL

1,995

9

720

44

true

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

[ "JournalArticle", "Conference" ]

1995-04-28T00:00:00

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

[ "parsing algorithm", "natural languages", "treebanks", "decision tree models", "syntactics", "decision tree learning" ]

[ "decision trees", "decision tree models", "parsing algorithm", "syntactics", "syntactic structure", "natural languages", "vocabulary", "text processing", "decision tree learning", "treebanks" ]

[ "vocabulary", "text processing", "syntactic structure", "parsing algorithm", "treebanks", "natural languages", "decision trees", "decision tree models", "syntactics", "decision tree learning" ]

[ "linguistics", "natural language processing", "computational linguistics", "data mining", "information retrieval", "formal languages", "semantics", "classifiers", "artificial intelligence", "database systems", "computer science", "formal languages and automata theory", "machine learning", "computer systems", "theoretical computer science" ]

609

This paper focuses on the branching process for solving any constraint satisfaction problem (CSP). A parametrised schema is proposed that (with suitable instantiations of the parameters) can solve CSP's on both finite and infinite domains. The paper presents a formal specification of the schema and a statement of a number of interesting properties that, subject to certain conditions, are satisfied by any instances of the schema. It is also shown that the operational procedures of many constraint systems including cooperative systems) satisfy these conditions. Moreover, the schema is also used to solve the same CSP in different ways by means of different instantiations of its parameters.

2022-09-02T12:47:26.064Z

{ "ACL": null, "DBLP": "journals/corr/cs-PL-0109060", "ArXiv": "cs/0109060", "MAG": "1610912307", "CorpusId": "609", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/9c72d1a2019a98eeb0b25f18d5d089e64c555b78

Branching: the Essence of Constraint Solving

[ { "authorId": "145596773", "name": "Antonio J. Fernández" }, { "authorId": "1723952", "name": "P. Hill" } ]

ArXiv

2,001

21

3

0

false

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

[ "JournalArticle" ]

2001-09-24T00:00:00

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

[ "communicating sequential processes", "formal specification", "cooperative systems" ]

[ "communicating sequential processes", "formal specification", "cooperative systems", "constraint satisfaction problems (csp)", "relational schemas" ]

[ "formal specification", "communicating sequential processes", "cooperative systems", "relational schemas", "constraint satisfaction problems (csp)" ]

[ "formal methods", "real time systems", "software engineering", "formal languages", "computer hardware description languages", "computer programming languages", "model checking", "cooperative communication", "relational data models", "artificial intelligence", "formal logic", "knowledge based systems", "object oriented programming", "mobile robots", "field programmable gate array", "embedded systems", "online systems", "digital signal processing", "computer science", "linguistics", "formal languages and automata theory", "computer programming", "architecture verification and validation", "wireless sensor networks", "fading channels", "communication", "relational database", "robotics", "computer hardware", "computer systems", "signal processing", "theoretical computer science", "architecting", "wireless communications", "energy utilization", "sensor nodes", "routing algorithms", "communication channels", "signal to noise ratio", "query languages", "engineering", "software architecture", "computer networks", "electricity", "sensors", "wireless telecommunication systems", "database systems", "software design", "communication systems", "telecommunication systems" ]

610

This paper presents our preprocessing and clustering analysis on the clickstream dataset proposed for the ECMLPKDD 2005 Discovery Challenge. The main contributions of this article are double. First, after presenting the clickstream dataset, we show how we build a rich data warehouse based an advanced preprocesing. We take into account the intersite aspects in the given ecommerce domain, which offers an interesting data structuration. A preliminary statistical analysis based on time period clickstreams is given, emphasing the importance of intersite user visits in such a context. Secondly, we describe our crossed-clustering method which is applied on data generated from our data warehouse. Our preliminary results are interesting and promising illustrating the benefits of our WUM methods, even if more investigations are needed on the same dataset.

2022-06-26T15:24:13.458Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0511106", "ArXiv": "cs/0511106", "MAG": "1624475019", "CorpusId": "610", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/4835dc9f600a27b520e28d7b7810fc5f0388424c

Benefits of InterSite Pre-Processing and Clustering Methods in E-Commerce Domain

[ { "authorId": "2647047", "name": "S. Chelcea" }, { "authorId": "39294916", "name": "A. D. Silva" }, { "authorId": "1744090", "name": "Y. Lechevallier" }, { "authorId": "1798527", "name": "D. Tanasa" }, { "authorId": "1759121", "name": "B. Trousse" } ]

ArXiv

2,005

12

3

0

false

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

[ "JournalArticle" ]

2005-10-03T00:00:00

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

[ "clustering methods", "correlation analysis", "e-commerce", "data warehouses" ]

[ "clustering algorithms", "clustering methods", "commerce", "correlation analysis", "navigation patterns", "web usage", "data warehouses", "warehouses" ]

[ "navigation patterns", "commerce", "correlation analysis", "data warehouses", "clustering algorithms", "web usage", "e-commerce", "clustering methods", "warehouses" ]

[ "web usage mining", "economics", "mathematics", "data mining", "information management", "web content", "internet", "information technology", "web mining", "computer science", "database systems", "world wide web", "search engines", "computer systems" ]

612

Many physical theories like chaos theory are fundamentally concerned with the conceptual tension between determinism and randomness. Kolmogorov complexity can express randomness in determinism and gives an approach to formulate chaotic behavior.

2022-02-13T16:01:25.085Z

{ "ACL": null, "DBLP": "journals/corr/nlin-CD-0303016", "ArXiv": "nlin/0303016", "MAG": null, "CorpusId": "612", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/015cd47ff264b0eeaff0882141fc31ff4e154841

Algorithmic Chaos

[ { "authorId": "46641506", "name": "P. Vitányi" } ]

ArXiv

2,003

18

1

0

false

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

[ "JournalArticle" ]

2003-03-07T00:00:00

{ "name": "ArXiv", "volume": "nlin.CD/0303016", "pages": null }

[ "chaotic behaviors" ]

[ "chaotic systems", "chaotic behaviors", "hyperchaos", "logistic maps", "hyperchaotic" ]

[ "chaotic behaviors", "hyperchaotic", "logistic maps", "hyperchaos", "chaotic systems" ]

[ "hyper-chaotic systems", "image encryptions", "lyapunov methods", "cryptography", "lyapunov stability theory", "lyapunov exponent", "riccati equations", "time-varying delay", "robotic manipulators", "time delay", "cryptology", "adaptive control systems", "lyapunov functions", "linear matrix inequalities", "control systems", "discrete time control systems", "optimal control systems", "linear systems", "time varying control systems", "robots", "computer systems", "computer security", "process control", "differential equations", "matrix algebra", "nonlinear control systems", "optimal control", "linear control systems", "robotics", "computer science", "automation", "numerical methods", "mathematics", "feedback systems", "control theory", "optimization", "engineering" ]

613

Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), exploits structured interaction to produce significant computational gains. Empirically, CSA exhibits very good anytime performance, but an error bound on the results has not been established. We reformulate the algorithm and derive both online and offline error bounds for approximate solutions. Moreover, we propose an effective way to automatically reduce the complexity of the interaction. Our experiments show that this is a promising approach to solve a broad class of decentralized decision problems. The general formulation used by the algorithm makes it both easy to implement and widely applicable to a variety of other AI problems.

2022-09-05T02:19:14.690Z

{ "ACL": null, "DBLP": "conf/aaai/PetrikZ07", "ArXiv": null, "MAG": "74393337", "CorpusId": "613", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Anytime Coordination Using Separable Bilinear Programs

[ { "authorId": "145630605", "name": "Marek Petrik" }, { "authorId": "1707550", "name": "S. Zilberstein" } ]

AAAI

2,007

19

29

4

false

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

[ "JournalArticle", "Conference" ]

2007-07-22T00:00:00

{ "name": null, "volume": null, "pages": "750-755" }

[ "multiagent system" ]

[ "coordination mechanisms", "multi-agent", "multiagent system", "agent systems", "artificial intelligence" ]

[ "agent systems", "artificial intelligence", "multi-agent", "coordination mechanisms", "multiagent system" ]

[ "intelligent agents", "mobile agents", "computer science", "mobile computing", "mobile telecommunication systems", "distributed computer systems", "wireless telecommunication systems", "telecommunication networks", "data communication systems", "communication channels", "computer systems", "computer networks", "communication systems", "telecommunication systems" ]

614

The well-studied local postage stamp problem (LPSP) is thefollowing: given a positive integer k, a set of positiveintegers 1 = a1 < a2 < … <ak and an integer h ≥ 1, what is the smallestpositive integer which cannot be represented as a linearcombinationΣ1≤i≤kx1aiwhere Σ1≤i≤kx1 ≤ h andeach xi is a non-negative integer? In this notewe prove that LPSP is NP-hard under Turing reductions, but can besolved in polynomial time if k is fixed.

2022-09-04T01:18:37.917Z

{ "ACL": null, "DBLP": "journals/sigact/Shallit02", "ArXiv": "math/0112257", "MAG": "2003926749", "CorpusId": "614", "PubMed": null, "DOI": "10.1145/507457.507473", "PubMedCentral": null }

https://www.semanticscholar.org/paper/90c9e6d00cd04ea53d8bf0dc94580034069f250a

The computational complexity of the local postage stamp problem

[ { "authorId": "1679162", "name": "J. Shallit" } ]

SIGA

2,001

15

16

0

true

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

[ "JournalArticle" ]

2001-12-22T00:00:00

{ "name": "ArXiv", "volume": "math.NT/0112257", "pages": null }

[]

[ "computational efficiency", "combinatorial problems", "combinatorial optimization", "turing machines", "polynomial space" ]

[ "computational efficiency", "combinatorial problems", "polynomial space", "turing machines", "combinatorial optimization" ]

[ "theoretical computer science", "combinatorial mathematics", "polynomial approximation", "exact algorithms", "automata theory", "optimization", "computer science", "graph theory", "approximation algorithms", "formal languages and automata theory", "mathematics", "approximation theory" ]

615

Special needs children with neurodevelopment disorders such as autism are often uncooperative and disruptive during routine hospitalization processes such as initiation of anesthesia and transfer to operating table. These patients are often manually restrained and lifted onto the operating table by healthcare staff after they are anaesthetized, placing these children at risk of fall injuries and hospital staff at risk of back injuries and physical injuries inflicted by these patients. In this paper, we described a prototype robotics system with sensing and actuation systems for safe perioperative transport, transfer and procedures for uncooperative combative children to maximize safety for patients and healthcare workers and to enhance operating theatre efficiency and throughput.

2022-08-03T06:33:10.971Z

{ "ACL": null, "DBLP": "conf/ram/HeeRTNCY17", "ArXiv": null, "MAG": "2785702946", "CorpusId": "615", "PubMed": null, "DOI": "10.1109/ICCIS.2017.8274832", "PubMedCentral": null }

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

Enhancing perioperative transfer of special needs children with the I-MOVE

[ { "authorId": "12516161", "name": "H. Hee" }, { "authorId": "35157559", "name": "K. Raghavan" }, { "authorId": "145333176", "name": "Aloysius Tan" }, { "authorId": "2072576436", "name": "Kiang Loong Ng" }, { "authorId": "145531677", "name": "M. S. Cruz" }, { "authorId": "1741040", "name": "Haoyong Yu" } ]

2017 IEEE International Conference on Cybernetics and Intelligent Systems (CIS) and IEEE Conference on Robotics, Automation and Mechatronics (RAM)

2,017

12

2

0

false

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

[ "JournalArticle", "Conference" ]

2017-11-01T00:00:00

{ "name": "2017 IEEE International Conference on Cybernetics and Intelligent Systems (CIS) and IEEE Conference on Robotics, Automation and Mechatronics (RAM)", "volume": null, "pages": "530-534" }

[ "robotics" ]

[ "robotics", "computational efficiency", "autonomous robot", "industrial robots", "mobile robots" ]

[ "industrial robots", "computational efficiency", "robotics", "autonomous robot", "mobile robots" ]

[ "theoretical computer science", "computer science", "robots" ]

618

The Intelligent Voice Prosthesis is a communication tool which reconstructs the meaning of an ill-structured sequence of icons or symbols, and expresses this meaning into sentences of a Natural Language (French). It has been developed for the use of people who cannot express themselves orally in natural language, and further, who are not able to comply to grammatical rules such as those of natural language. We describe how available corpora of iconic communication by children with Cerebral Palsy has led us to implement a simple and relevant semantic description of the symbol lexicon. We then show how a unification-based, bottom-up semantic analysis allows the system to uncover the meaning of the user's utterances by computing proper dependencies between the symbols. The result of the analysis is then passed to a lexicalization module which chooses the right words of natural language to use, and builds a linguistic semantic network. This semantic network is then generated into French sentences via hierarchization into trees, using a lexicalized Tree Adjoining Grammar. Finally we describe the modular, customizable interface which has been developed for this system.

2022-08-21T01:52:08.753Z

{ "ACL": null, "DBLP": "journals/corr/abs-cmp-lg-9506018", "ArXiv": "cmp-lg/9506018", "MAG": "1827699276", "CorpusId": "618", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Intelligent Voice Prosthesis: Converting Icons into Natural Language Sentences

[ { "authorId": "9882928", "name": "Pascal Vaillant" }, { "authorId": "2054592", "name": "Michael Checler" } ]

ArXiv

1,995

10

6

0

false

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

[ "JournalArticle" ]

1995-06-21T00:00:00

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

[ "semantic information", "natural languages", "linguistics", "semantic descriptions", "semantics", "communication" ]

[ "natural languages", "syntactic structure", "communication", "semantics", "semantic information", "linguistics" ]

[ "semantic information", "syntactic structure", "natural languages", "linguistics", "semantic descriptions", "semantics", "communication" ]

[ "natural language processing", "syntactics", "semantic web", "ontology", "information theory", "artificial intelligence", "computational linguistics", "world wide web", "computer science", "database systems", "internet", "computer systems" ]

619

We investigate the complexity of sorting in the model of sequential quantum circuits. While it is known that in general a quantum algorithm based on comparisons alone cannot outperform classical sorting algorithms by more than a constant factor in time complexity, this is wrong in a space bounded setting. We observe that for all storage bounds n/log ≥ S ≥ log3n, one can devise a quantum algorithm that sorts n numbers (using comparisons only) in time T=O(n3/2 log3/2 n/√S). We then show the following lower bound on the time-space tradeoff for sorting n numbers from a polynomial size range in a general sorting algorithm (not necessarily based on comparisons): TS=Ω(n3/2). Hence for small values of S the upper bound is almost tight. Classically the time-space tradeoff for sorting is TS=Θ(n2).

2022-09-05T03:00:39.734Z

{ "ACL": null, "DBLP": "conf/stoc/Klauck03", "ArXiv": "quant-ph/0211174", "MAG": "2047235049", "CorpusId": "619", "PubMed": null, "DOI": "10.1145/780542.780553", "PubMedCentral": null }

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

Quantum time-space tradeoffs for sorting

[ { "authorId": "1692094", "name": "H. Klauck" } ]

STOC '03

2,002

22

28

3

true

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

[ "JournalArticle" ]

2002-11-26T00:00:00

{ "name": null, "volume": null, "pages": "69-76" }

[]

[ "quantum gates", "adaptive algorithms", "hybrid algorithms", "hierarchical model", "reversible circuits" ]

[ "reversible circuits", "hybrid algorithms", "quantum gates", "hierarchical model", "adaptive algorithms" ]

[ "reversible logic", "evolutionary algorithms", "particle swarm optimization (pso)", "logic gates", "hierarchical system", "software", "genetic algorithms", "optimization problems", "optimization", "swarm intelligence", "field programmable gate array", "computer systems", "computer science", "artificial intelligence", "correlation analysis", "mathematics", "computer hardware" ]

621

Knowing the norms of a domain is crucial, but there exists no repository of norms. We propose a method to extract them from texts: narrative texts generally do not describe a norm, but rather the discrepancies between what actually happened, and the corresponding normal sequence of events. Answers about the causes of an event often reveal the implicit norms. We apply this idea to the domain of driving, and validate it by designing algorithms that identify, in a text, the "basic" norms to which it refers implicitly.

2022-09-04T08:53:02.670Z

{ "ACL": null, "DBLP": "conf/flairs/KayserN04", "ArXiv": "cs/0607084", "MAG": "1549729700", "CorpusId": "621", "PubMed": null, "DOI": "10.1142/S0218213005001965", "PubMedCentral": null }

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

About Norms and Causes

[ { "authorId": "34936664", "name": "D. Kayser" }, { "authorId": "1783796", "name": "Farid Nouioua" } ]

Int. J. Artif. Intell. Tools

2,005

29

17

0

true

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

[ "JournalArticle" ]

2005-02-01T00:00:00

{ "name": null, "volume": null, "pages": "502-508" }

[]

[ "natural language questions", "adaptive algorithms", "efficient algorithm", "optimization problems", "text document", "textual data", "text data" ]

[ "textual data", "natural language questions", "efficient algorithm", "adaptive algorithms", "text document", "text data", "optimization problems" ]

[ "text mining", "question answering", "computational efficiency", "software", "information retrieval systems", "correlation analysis", "text processing", "natural language processing", "computational linguistics", "information retrieval", "theoretical computer science", "computer science", "database systems", "mathematics", "data mining", "artificial intelligence", "natural languages", "computer systems", "linguistics", "semantics" ]

623

We present conditional expression (CE) for finding blurs convolved in given images. The CE is given in terms of the zero-values of the blurs evaluated at multi-point. The CE can detect multiple blur all at once. We illustrate the multiple blur-detection by using a test image.

2022-06-20T10:56:59.487Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0609164", "ArXiv": "cs/0609164", "MAG": "1673067200", "CorpusId": "623", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Conditional Expressions for Blind Deconvolution: Multi-point form

[ { "authorId": "69490586", "name": "S. Aogaki" }, { "authorId": "48500034", "name": "I. Moritani" }, { "authorId": "144501978", "name": "T. Sugai" }, { "authorId": "2567805", "name": "F. Takeutchi" }, { "authorId": "144874478", "name": "F. M. Toyama" } ]

ArXiv

2,006

5

2

0

false

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

[ "JournalArticle" ]

2006-09-29T00:00:00

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

[ "blind deconvolution" ]

[ "blind deconvolution", "detection algorithm", "image restoration", "color images", "reference image" ]

[ "image restoration", "reference image", "blind deconvolution", "color images", "detection algorithm" ]

[ "image reconstruction", "image enhancement", "image matching", "image quality", "blind source separation", "pattern recognition", "color image processing", "signal detection", "image analysis", "image processing", "matrix algebra", "statistical methods", "machine learning", "image segmentation", "signal processing", "computer imaging and vision", "mathematics", "correlation analysis", "artificial intelligence", "engineering", "computer science" ]

626

Key predistribution is a well-known technique for ensuring secure communication via encryption among sensors deployed in an ad-hoc manner to form a sensor network. In this paper, we propose a novel 2-Phase technique for key predistribution based on a combination of inherited and random key assignments from the given key pool to individual sensor nodes. We also develop an analytical framework for measuring security-performance tradeoffs of different key distribution schemes by providing metrics for measuring sensornet connectivity and resiliency to enemy attacks. In particular, we show analytically that the 2-Phase scheme provides better average connectivity and superior $q$-composite connectivity than the random scheme. We then prove that the invulnerability of a communication link under arbitrary number of node captures by an adversary is higher under the 2-Phase scheme. The probability of a communicating node pair having an exclusive key also scales better with network size under the 2-Phase scheme. We also show analytically that the vulnerability of an arbitrary communication link in the sensornet to single node capture is lower under 2-Phase assuming both network-wide as well as localized capture. Simulation results also show that the number of exclusive keys shared between any two nodes is higher while the number of $q$-composite links compromised when a given number of nodes are captured by the enemy is smaller under the 2-Phase scheme as compared to the random one.

2022-09-02T07:53:42.327Z

{ "ACL": null, "DBLP": "journals/corr/cs-NI-0405035", "ArXiv": "cs/0405035", "MAG": "1580987403", "CorpusId": "626", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Security-Performance Tradeoffs of Inheritance based Key Predistribution for Wireless Sensor Networks

[ { "authorId": "145297301", "name": "R. Kannan" }, { "authorId": "2065880969", "name": "L. Ray" }, { "authorId": "1719412", "name": "A. Durresi" } ]

ArXiv

2,004

44

10

0

false

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

[ "JournalArticle" ]

2004-05-10T00:00:00

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

[ "secure communications", "sensor nodes", "key pre-distribution", "key distribution schemes", "encryption", "wireless sensor networks", "probability", "sensors", "communication", "sensor networks" ]

[ "key pre-distribution", "key distribution schemes", "wireless", "wireless sensor", "wireless sensor networks", "sensor networks", "sensors", "communication", "encryption", "sensor nodes", "key distribution", "probability", "key predistribution scheme", "wsns", "wireless communications", "network architecture", "wireless sensor node", "key establishments", "communication networks" ]

[ "secure communications", "sensor nodes", "network architecture", "key predistribution scheme", "wireless communications", "wireless sensor", "key pre-distribution", "key distribution schemes", "key distribution", "encryption", "wireless sensor networks", "probability", "sensors", "wireless", "wsns", "key establishments", "communication networks", "communication", "sensor networks", "wireless sensor node" ]

[ "authentication", "network security", "computer networks", "telecommunication equipment", "distributed computer systems", "wireless telecommunication systems", "key management", "multicasts", "security of data", "cryptography", "energy utilization", "routing algorithms", "mathematics", "computer hardware", "radio", "telecommunication networks", "routers", "embedded systems", "electric network synthesis", "computer science", "computer systems", "communication systems", "telecommunication systems", "access control", "public key cryptography", "bandwidth", "data communication systems", "computer security", "cryptology", "electricity", "telecommunication traffic", "electric network analysis", "engineering", "electric network topology", "network topology" ]

627

Fourteen linguistically-motivated numerical indicators are evaluated for their ability to categorize verbs as either states or events. The values for each indicator are computed automatically across a corpus of text. To improve classification performance, machine learning techniques are employed to combine multiple indicators. Three machine learning methods are compared for this task: decision tree induction, a genetic algorithm, and log-linear regres-

2022-08-29T05:38:55.721Z

{ "ACL": "W97-0318", "DBLP": "conf/emnlp/Siegel97", "ArXiv": "cmp-lg/9709002", "MAG": "1636932655", "CorpusId": "627", "PubMed": null, "DOI": "10.7916/D8S189VG", "PubMedCentral": null }

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

Learning Methods for Combining Linguistic Indicators to Classify Verbs

[ { "authorId": "2087287", "name": "Eric V. Siegel" } ]

EMNLP

1,997

38

18

1

false

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

[ "JournalArticle", "Conference" ]

1997-09-12T00:00:00

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

[ "classification methods", "genetic algorithms", "machine learning", "linguistics", "decision tree induction" ]

[ "linguistics", "classification methods", "machine learning", "decision trees", "decision tree induction", "genetic algorithms", "classification models", "classifiers", "rule induction" ]

[ "classification methods", "genetic algorithms", "machine learning", "linguistics", "decision tree induction", "decision trees", "classification models", "classifiers", "rule induction" ]

[ "computer systems", "artificial intelligence", "data mining", "decision tables", "computer science", "decision theory" ]

633

Robertson's 2-poisson information retrieve model does not use location and category information. We constructed a framework using location and category information in a 2-poisson model. We submitted two systems based on this framework to the IREX contest, Japanese language information retrieval contest held in Japan in 1999. For precision in the A-judgement measure they scored 0.4926 and 0.4827, the highest values among the 15 teams and 22 systems that participated in the IREX contest. We describe our systems and the comparative experiments done when various parameters were changed. These experiments confirmed the effectiveness of using location and category information.

2022-09-01T12:43:19.453Z

{ "ACL": null, "DBLP": "journals/corr/cs-CL-0008032", "ArXiv": "cs/0008032", "MAG": "2949118752", "CorpusId": "633", "PubMed": null, "DOI": "10.1145/355214.355226", "PubMedCentral": null }

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

Japanese probabilistic information retrieval using location and category information

[ { "authorId": "1697381", "name": "M. Murata" }, { "authorId": "145853732", "name": "Q. Ma" }, { "authorId": "1783611", "name": "Kiyotaka Uchimoto" }, { "authorId": "33743685", "name": "Hiromi Ozaku" }, { "authorId": "1802277", "name": "M. Utiyama" }, { "authorId": "1714134", "name": "H. Isahara" } ]

IRAL '00

2,000

11

42

0

true

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

[ "JournalArticle" ]

2000-08-28T00:00:00

{ "name": null, "volume": null, "pages": "81-88" }

[ "information retrieval", "japanese" ]

[ "information retrieval", "user information", "location based", "location information", "information retrieval systems" ]

[ "information retrieval systems", "japanese", "location based", "user information", "information retrieval", "location information" ]

[ "database systems", "asian continental ancestry group", "location based services", "recommender systems", "personal information", "computer science", "ad hoc networks", "sensor networks", "wireless sensor networks", "telecommunication equipment", "computer systems", "genotype", "genetic association", "mobile devices", "privacy", "routers", "mobile telecommunication systems", "internet protocols", "quality of service", "wireless local area networks (wlan)", "multicasts", "routing algorithms", "sensors", "wireless telecommunication systems", "embedded systems", "wireless communications", "energy utilization", "sensor nodes", "single nucleotide polymorphism", "genetic analysis", "mobile computing", "computer security", "telecommunication traffic", "bandwidth", "communication channels", "telecommunication networks", "local area networks", "data communication systems", "computer networks", "computer hardware", "communication systems", "telecommunication systems", "electricity", "bioinformatics", "engineering" ]

636

The theme of symbolic computation in algebraic categories has become of utmost importance in the last decade since it enables the automatic modeling of modern algebra theories. On this theoretical background, the present paper reveals the utility of the parameterized categorical approach by deriving a multivariate polynomial category (over various coefficient domains), which is used by our Mathematica implementation of Buchberger's algorithms for determining the Groebner basis. These implementations are designed according to domain and category parameterization principles underlining their advantages: operation protection, inheritance, generality, easy extendibility. In particular, such an extension of Mathematica, a widely used symbolic computation system, with a new type system has a certain practical importance. The approach we propose for Mathematica is inspired from D. Gruntz and M. Monagan's work in Gauss, for Maple.

2022-07-11T01:41:20.635Z

{ "ACL": null, "DBLP": "journals/corr/cs-SC-0208031", "ArXiv": "cs/0208031", "MAG": "1634758794", "CorpusId": "636", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/593695bfa96ca23d89b34f5c487e741ff5715ed9

Parameterized Type Definitions in Mathematica: Methods and Advantages

[ { "authorId": "2701157", "name": "A. Andreica" } ]

ArXiv

2,002

14

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

2002-08-20T00:00:00

{ "name": "ArXiv", "volume": "cs.SC/0208031", "pages": null }

[ "type systems", "parameterization", "mathematical method" ]

[ "parameterization", "type systems", "relational algebra", "reusability", "hardware implementations" ]

[ "reusability", "mathematical method", "hardware implementations", "parameterization", "type systems", "relational algebra" ]

[ "computer software reusability", "numerical methods", "field programmable gate array", "numerical model", "object oriented programming", "program compilers", "linguistics", "relational database", "software design", "computer programming languages", "mathematics", "computer hardware", "computer programming", "parallel processing systems", "knowledge based systems", "query languages", "software engineering", "computer science", "distributed systems", "artificial intelligence", "database systems", "distributed computer systems", "computer systems" ]

637

Because a delay tolerant network (DTN) can often be partitioned, routing is a challenge. However, routing benefits considerably if one can take advantage of knowledge concerning node mobility. This paper addresses this problem with a generic algorithm based on the use of a high-dimensional Euclidean space, that we call MobySpace, constructed upon nodes' mobility patterns. We provide here an analysis and a large scale evaluation of this routing scheme in the context of ambient networking by replaying real mobility traces. The specific MobySpace evaluated is based on the frequency of visits of nodes to each possible location. We show that routing based on MobySpace can achieve good performance compared to that of a number of standard algorithms, especially for nodes that are present in the network a large portion of the time. We determine that the degree of homogeneity of node mobility patterns has a high impact on routing. And finally, we study the ability of nodes to learn their own mobility patterns.

2022-09-04T23:53:15.678Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0511102", "ArXiv": "cs/0511102", "MAG": "2122887675", "CorpusId": "637", "PubMed": null, "DOI": "10.1109/INFOCOM.2006.299", "PubMedCentral": null }

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

Evaluating Mobility Pattern Space Routing for DTNs

[ { "authorId": "145882268", "name": "Jérémie Leguay" }, { "authorId": "13744465", "name": "T. Friedman" }, { "authorId": "1742729", "name": "V. Conan" } ]

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications

2,005

44

368

25

true

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

[ "JournalArticle", "Conference" ]

2005-11-29T00:00:00

{ "name": "Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications", "volume": null, "pages": "1-10" }

[ "dtn", "node mobility", "genetic algorithms", "delay tolerant networks", "mobility pattern", "routing scheme", "routing algorithms" ]

[ "mobility pattern", "routing algorithms", "routing scheme", "dtn", "node mobility" ]

[ "dtn", "node mobility", "genetic algorithms", "delay tolerant networks", "mobility pattern", "routing scheme", "routing algorithms" ]

[ "mobile ad hoc networks", "artificial intelligence", "wireless networks", "ad hoc networks", "routing protocols", "mobility model", "computer networks", "computer science", "wireless communications", "packet networks", "routers", "mobile telecommunication systems", "internet protocols", "quality of service", "wireless local area networks (wlan)", "multicasts", "sensors", "wireless telecommunication systems", "telecommunication traffic", "bandwidth", "communication channels", "telecommunication networks", "local area networks", "data communication systems", "computer hardware", "communication systems", "telecommunication systems", "computer systems" ]

638

Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclasses of LOGCFL arising from varying the arity and nesting of groupoidal quantifiers in first-order logic with linear order. Our work extends the elaborate theory relating monoidal quantifiers to NC1 and its subclasses. In the absence of arithmetical predicates for plus and times (equivalently, in the absence of the BIT predicate), we resolve the main issues: we show in particular that no single outermost unary groupoidal quantifier with FO can capture all the context-free languages, and we obtain the surprising result that a variant of Greibach's hardest context-free language is LOGCFL-complete under quantifier-free reductions without arithmetic. We then prove that FO with unary groupoidal quantifiers is strictly more expressive with predicates for plus and times than without. Considering a particular groupoidal quantifier, we prove that first-order logic with the “majority of pairs” quantifier is strictly more expressive than first-order with majority of individuals. As a technical tool of independent interest, we define the notion of an aperiodic nondeterministic finite automaton and prove that FO translations are precisely the mappings computed by single-valued aperiodic nondeterministic finite transducers.

2022-09-04T12:20:06.216Z

{ "ACL": null, "DBLP": "journals/jcss/LautemannMSV01", "ArXiv": "cs/9809114", "MAG": "2569922990", "CorpusId": "638", "PubMed": null, "DOI": "10.1006/jcss.2000.1742", "PubMedCentral": null }

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

The Descriptive Complexity Approach to LOGCFL

[ { "authorId": "1767683", "name": "C. Lautemann" }, { "authorId": "144264797", "name": "P. McKenzie" }, { "authorId": "1736032", "name": "T. Schwentick" }, { "authorId": "1696405", "name": "H. Vollmer" } ]

J. Comput. Syst. Sci.

1,998

70

38

1

true

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

[ "JournalArticle" ]

1998-09-28T00:00:00

{ "name": "J. Comput. Syst. Sci.", "volume": "62", "pages": "629-652" }

[ "first order logic", "context free languages", "nondeterministic finite automaton" ]

[ "first order logic", "nondeterministic finite automaton", "finite automaton", "automation", "nondeterministic automata" ]

[ "automation", "nondeterministic finite automaton", "finite automaton", "first order logic", "nondeterministic automata", "context free languages" ]

[ "engineering", "translation (languages)", "number of state", "pipeline processing systems", "finite automata", "formal logic", "deterministic automata", "automata theory", "formal languages", "computational linguistics", "linguistics", "program processors", "artificial intelligence", "formal languages and automata theory", "database systems", "parallel processing systems", "microprocessor chips", "computer science", "theoretical computer science", "computer systems", "distributed systems", "computer hardware", "distributed computer systems" ]

639

Grossglauser and Tse (2001) introduced a mobile random network model where each node moves independently on a unit disk according to a stationary uniform distribution and showed that a throughput of Theta(1) is achievable. El Gamal, Mammen, Prabhakar, and Shah (2004) showed that the delay associated with this throughput scales as Theta(nlogn), when each node moves according to an independent random walk. In a later work, Diggavi, Grossglauser, and Tse (2002) considered a random network on a sphere with a restricted mobility model, where each node moves along a randomly chosen great circle on the unit sphere. They showed that even with this one-dimensional restriction on mobility, constant throughput scaling is achievable. Thus, this particular mobility restriction does not affect the throughput scaling. This raises the question whether this mobility restriction affects the delay scaling. This correspondence studies the delay scaling at Theta(1) throughput for a random network with restricted mobility. First, a variant of the scheme presented by Diggavi, Grossglauser, and Tse (2002) is presented and it is shown to achieve Theta(1) throughput using different (and perhaps simpler) techniques. The exact order of delay scaling for this scheme is determined, somewhat surprisingly, to be of Theta(nlogn), which is the same as that without the mobility restriction. Thus, this particular mobility restriction does not affect either the maximal throughput scaling or the corresponding delay scaling of the network. This happens because under this 1-D restriction, each node is in the proximity of every other node in essentially the same manner as without this restriction

2022-09-03T20:45:56.074Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0508074", "ArXiv": "cs/0508074", "MAG": "2153811089", "CorpusId": "639", "PubMed": null, "DOI": "10.1109/TIT.2006.890720", "PubMedCentral": null }

https://www.semanticscholar.org/paper/31031435683d56f7137505294baeb36f07488ece

Throughput and Delay in Random Wireless Networks With Restricted Mobility

[ { "authorId": "143726313", "name": "J. Mammen" }, { "authorId": "145081804", "name": "D. Shah" } ]

IEEE Transactions on Information Theory

2,005

16

102

5

true

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

[ "JournalArticle" ]

2005-08-16T00:00:00

{ "name": "IEEE Transactions on Information Theory", "volume": "53", "pages": "1108-1116" }

[ "wireless networks", "random walk", "mobility model", "one dimensional" ]

[ "wireless", "wireless networks", "network architecture", "random walk", "mobility model", "network mobility", "group mobility", "local mobility", "mobility management", "jitter", "end to end delay", "time delay", "delay jitters", "wireless communications", "hard disks", "intermediate node", "destination nodes", "wireless local area networks (wlan)", "mobile networks", "network components" ]

[ "network architecture", "intermediate node", "time delay", "local mobility", "wireless", "jitter", "wireless networks", "group mobility", "random walk", "mobile networks", "mobility model", "wireless communications", "mobility management", "destination nodes", "delay jitters", "wireless local area networks (wlan)", "network components", "end to end delay", "hard disks", "network mobility", "one dimensional" ]

[ "computer networks", "ad hoc networks", "sensor networks", "wireless sensor networks", "network coding", "routing protocols", "computer systems", "proxy mobile ipv6", "radio", "bandwidth", "packet networks", "graph theory", "random processes", "mobile telecommunication systems", "mobile ad hoc networks", "local area networks", "program compilers", "flash memory", "mobile ip", "two dimensional", "numerical methods", "computer science", "routers", "internet protocols", "quality of service", "multicasts", "routing algorithms", "sensors", "wireless telecommunication systems", "embedded systems", "energy utilization", "sensor nodes", "information theory", "mobile nodes", "handover", "network management", "gateways (computer networks)", "telecommunication traffic", "theoretical computer science", "probability", "communication channels", "telecommunication networks", "parallel processing systems", "computer programming languages", "image processing", "mathematics", "data communication systems", "computer hardware", "communication systems", "telecommunication systems", "electricity", "communication", "distributed systems", "computer programming", "computer imaging and vision", "engineering", "distributed computer systems" ]

640

Many problems in finance require the information on the first passage time (FPT) of a stochastic process. Mathematically, such problems are often reduced to the evaluation of the probability density of the time for such a process to cross a certain level, a boundary, or to enter a certain region. While in other areas of applications the FPT problem can often be solved analytically, in finance we usually have to resort to the application of numerical procedures, in particular when we deal with jump-diffusion stochastic processes (JDP). In this paper, we propose a Monte-Carlo-based methodology for the solution of the first passage time problem in the context of multivariate (and correlated) jump-diffusion processes. The developed technique provide an efficient tool for a number of applications, including credit risk and option pricing. We demonstrate its applicability to the analysis of the default rates and default correlations of several different, but correlated firms via a set of empirical data.

2022-09-03T20:22:48.822Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0702164", "ArXiv": "cs/0702164", "MAG": "1652857348", "CorpusId": "640", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/374ea56fe75c7791d4bb798374246cab5ff6eb67

Monte-Carlo Simulations of the First Passage Time for Multivariate Jump-Diffusion Processes in Financial Applications

[ { "authorId": "2141082713", "name": "Di Zhang" }, { "authorId": "48179399", "name": "R. Melnik" } ]

ArXiv

2,007

32

2

0

false

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

[ "JournalArticle" ]

2007-02-28T00:00:00

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

[ "stochastic processes", "probability", "stochastic process" ]

[ "stochastic", "stochastic processes", "stochastic process", "probability", "markov chains" ]

[ "stochastic processes", "probability", "stochastic process", "markov chains", "stochastic" ]

[ "mathematics", "random processes", "markov processes", "stochasticity", "correlation analysis", "numerical model" ]

642

We define the concept of dependence among multiple variables using maximum entropy techniques and introduce a graphical notation to denote the dependencies. Direct inference of information theoretic quantities from data uncovers dependencies even in undersampled regimes when the joint probability distribution cannot be reliably estimated. The method is tested on synthetic data. We anticipate it to be useful for inference of genetic circuits and other biological signaling networks.

2022-09-04T11:23:10.427Z

{ "ACL": null, "DBLP": "journals/corr/q-bio-QM-0406015", "ArXiv": "q-bio/0406015", "MAG": "1547789987", "CorpusId": "642", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/91cd5883353e6c61574b9676305bcec28f8bc82d

Information theory, multivariate dependence, and genetic network inference

[ { "authorId": "48677292", "name": "I. Nemenman" } ]

ArXiv

2,004

48

39

3

false

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

[ "JournalArticle" ]

2004-06-06T00:00:00

{ "name": "ArXiv", "volume": "q-bio.QM/0406015", "pages": null }

[ "information theory", "inference", "probability distributions" ]

[ "information theory", "inference", "probabilistic inference", "probability", "probability distributions" ]

[ "probability distributions", "probability", "probabilistic inference", "information theory", "inference" ]

[ "mathematics", "inference engines", "bayesian methods", "communication", "artificial intelligence", "computer science" ]

645

The design of a novel prismatic drive is reported in this paper. This transmission is based on Slide-O-Cam, a cam mechanism with multiple rollers mounted on a common translating follower. The design of Slide-O-Cam was reported elsewhere. This drive thus provides pure-rolling motion, thereby reducing the friction of rack-and-pinions and linear drives. Such properties can be used to design new transmissions for parallel-kinematics machines. In this paper, this transmission is optimized to replace ball-screws in Orthoglide, a three-DOF parallel robot optimized for machining applications.

2022-09-05T01:52:48.471Z

{ "ACL": null, "DBLP": "journals/corr/abs-1104-1249", "ArXiv": "0705.1217", "MAG": "2963053886", "CorpusId": "645", "PubMed": null, "DOI": "10.1115/1.2198283", "PubMedCentral": null }

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

The Design of a Novel Prismatic Drive for a Three-DOF Parallel-Kinematics Machine

[ { "authorId": "1747337", "name": "D. Chablat" }, { "authorId": "145280698", "name": "J. Angeles" } ]

ArXiv

2,006

20

3

0

true

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

[ "JournalArticle" ]

2006-07-01T00:00:00

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

[ "parallel kinematic machines", "cam", "parallel robots", "machining" ]

[ "kinematics analysis", "cam", "parallel robots", "robots", "machining" ]

[ "robots", "cam", "parallel robots", "parallel kinematic machines", "kinematics analysis", "machining" ]

[ "robotics", "computer aided manufacturing", "machine design", "robotic manipulators", "flexible manufacturing systems", "inverse kinematics", "computer science", "computer aided design", "petri nets", "graph theory", "theoretical computer science" ]

646

The complexity of round robin method of intraprocedural data flow analysis is measured in number of iterations over the control flow graph. Existing complexity bounds realistically explain the complexity of only Bit-vector frameworks which are separable. In this paper we define the complexity bounds for non-separable frameworks by quantifying the interdependences among the data flow information of program entities using an Entity Dependence Graph.

2022-09-01T22:41:43.194Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0610164", "ArXiv": "cs/0610164", "MAG": "1642217723", "CorpusId": "646", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Complexity of Data Flow Analysis for Non-Separable Frameworks

[ { "authorId": "2207161", "name": "B. Sathe" }, { "authorId": "3210935", "name": "Uday P. Khedker" } ]

Software Engineering Research and Practice

2,006

21

0

false

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

[ "JournalArticle" ]

2006-10-30T00:00:00

{ "name": null, "volume": null, "pages": "828-836" }

[]

[ "inter-procedural", "execution paths", "integrated data", "data flow graphs", "software frameworks" ]

[ "integrated data", "execution paths", "inter-procedural", "data flow graphs", "software frameworks" ]

[ "data integration", "symbolic execution", "static analysis", "graph theory", "computer programming", "data handling", "model checking", "program debugging", "verification", "software engineering", "program compilers", "theoretical computer science", "computer science", "database systems", "embedded systems", "architecture verification and validation", "software quality", "computer debugging", "verification and validation", "parallel processing systems", "computer programming languages", "computer systems", "architecting", "software design", "software", "distributed systems", "software architecture", "distributed computer systems" ]

647

We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general term-orderings (instead of level mappings), like it is done in transformational approaches to logic program termination analysis, but that we apply these orderings directly to the logic program and not to the term-rewrite system obtained through some transformation. We define some variants of acceptability, based on general term-orderings, and show how they are equivalent to LD-termination. We develop a demand driven, constraint-based approach to verify these acceptability-variants. The advantage of the approach over standard acceptability is that in some cases, where complex level mappings are needed, fairly simple term-orderings may be easily generated. The advantage over transformational approaches is that it avoids the transformation step all together.

2022-09-04T11:52:52.316Z

{ "ACL": null, "DBLP": "journals/corr/cs-PL-0011025", "ArXiv": "cs/0011025", "MAG": "1899649530", "CorpusId": "647", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Termination analysis of logic programs using acceptability with general term orders

[ { "authorId": "1747171", "name": "Alexander Serebrenik" }, { "authorId": "1714620", "name": "D. D. Schreye" } ]

ArXiv

2,000

26

3

0

false

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

[ "JournalArticle" ]

2000-05-01T00:00:00

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

[ "logic programs", "termination analysis" ]

[ "termination analysis", "dynamic logic", "multivalued logic", "logic programs", "answer set semantics", "abstract interpretation", "correlation analysis", "stable model", "disjunctive logic programs", "well founded semantics" ]

[ "correlation analysis", "disjunctive logic programs", "logic programs", "dynamic logic", "well founded semantics", "termination analysis", "stable model", "answer set semantics", "multivalued logic", "abstract interpretation" ]

[ "mathematics", "answer set programming", "logic programming", "modal logic", "answer set", "many valued logics", "static analysis", "knowledge representation", "computer programming languages", "formal logic", "logic gates", "logic design", "boolean functions", "software engineering", "program compilers", "knowledge based systems", "semantics", "computer programming", "artificial intelligence", "field programmable gate array", "computer science", "parallel processing systems", "computer hardware", "distributed systems", "distributed computer systems", "computer systems" ]

649

Though database technology has been remarkably successful in building a large market and adapting to the changes of the last three decades, its impact on the broader market of information management is surprisingly limited. If we were to design an information management system from scratch, based upon today’s requirements and hardware capabilities, would it look anything like today’s database systems? In this paper, we introduce Impliance, a next-generation information management system consisting of hardware and software components integrated to form an easy-to-administer appliance that can store, retrieve, and analyze all types of structured, semi-structured, and unstructured information. We first summarize the trends that will shape information management for the foreseeable future. Those trends imply three major requirements for Impliance: (1) to be able to store, manage, and uniformly query and transform all data, not just structured records; (2) to be able to scale out as the volume of this data grows; and (3) to be simple and robust in operation. We then describe four key ideas that are uniquely combined in Impliance to address these requirements, namely the ideas of: (a) integrating software and off-the-shelf hardware into a generic information appliance; (b) automatically discovering, organizing, and managing all data – unstructured as well as structured – in a uniform way; (c) achieving scale-out by exploiting simple, massive parallel processing, and (d) virtualizing compute and storage resources to unify, simplify, and streamline the management of Impliance. Impliance is an ambitious, long-term effort to define simpler, more robust, and more scalable information systems for tomorrow’s enterprises.

2022-08-30T14:34:16.373Z

{ "ACL": null, "DBLP": "conf/cidr/BhattacharjeeGGLMPRRS07", "ArXiv": "cs/0612129", "MAG": "2951602731", "CorpusId": "649", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/80602fc76266f85c83d734bd4dc6170be69fba8f

Impliance: A Next Generation Information Management Appliance

[ { "authorId": "49223443", "name": "Bishwaranjan Bhattacharjee" }, { "authorId": "2680261", "name": "Joseph S. Glider" }, { "authorId": "15625692", "name": "Richard A. Golding" }, { "authorId": "1793770", "name": "G. Lohman" }, { "authorId": "1733290", "name": "V. Markl" }, { "authorId": "2886859", "name": "H. Pirahesh" }, { "authorId": "144765080", "name": "J. Rao" }, { "authorId": "35032447", "name": "R. Rees" }, { "authorId": "145856220", "name": "G. Swart" } ]

CIDR

2,006

42

9

0

false

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

[ "JournalArticle", "Conference" ]

2006-12-22T00:00:00

{ "name": null, "volume": null, "pages": "351-362" }

[ "information systems", "storage resources", "software component", "computer hardware", "parallel processing", "shape information", "software", "database systems", "information management" ]

[ "information management", "information systems", "database systems", "computer hardware", "software", "software component", "parallel processing", "storage resources" ]

[ "information systems", "storage resources", "software component", "computer hardware", "parallel processing", "shape information", "software", "database systems", "information management" ]

[ "computer systems", "digital storage", "grid computing", "cloud computing", "computer science", "parallel algorithms", "content based retrieval", "information technology", "parallel processing systems", "image retrieval", "multimedia systems", "distributed systems", "pattern recognition", "image segmentation", "image enhancement", "information retrieval", "internet", "distributed computer systems", "machine learning", "image analysis", "image processing", "artificial intelligence", "computer imaging and vision" ]

651

This paper addresses the use of COTS microkernels in fault-tolerant, and, to some extent, safety-critical systems. The main issue is to assess the behavior of such components, upon which application software relies, in the presence of faults. Using fault injection, it is possible to classify the behavior of the functional primitives. From the results obtained fault containment mechanisms can be provided as a new API to complement the basic detection mechanisms of the microkernel. Some preliminary experiments with the Chorus microkernel are also reported.

2022-08-24T22:07:43.004Z

{ "ACL": null, "DBLP": "conf/ftdcs/SallesAF97", "ArXiv": null, "MAG": "2166947521", "CorpusId": "651", "PubMed": null, "DOI": "10.1109/FTDCS.1997.644723", "PubMedCentral": null }

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

Can we rely on COTS microkernels for building fault-tolerant systems?

[ { "authorId": "2590007", "name": "F. Salles" }, { "authorId": "1759859", "name": "J. Arlat" }, { "authorId": "84302652", "name": "J. Fabre" } ]

Proceedings of the Sixth IEEE Computer Society Workshop on Future Trends of Distributed Computing Systems

1,997

20

9

0

false

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

[ "JournalArticle" ]

1997-10-29T00:00:00

{ "name": "Proceedings of the Sixth IEEE Computer Society Workshop on Future Trends of Distributed Computing Systems", "volume": null, "pages": "189-194" }

[ "safety critical systems", "fault-tolerant", "microkernel", "fault-tolerant systems", "fault injection", "software" ]

[ "microkernel", "software", "fault injection", "detection algorithm", "fault location" ]

[ "safety critical systems", "fault-tolerant", "microkernel", "fault-tolerant systems", "fault location", "fault injection", "software", "detection algorithm" ]

[ "formal methods", "model checking", "real time systems", "security systems", "fault tolerant computer systems", "software architecture patterns", "fault tolerance", "electric fault location", "fault detection", "computer science", "signal detection", "formal logic", "embedded systems", "architecture verification and validation", "knowledge based systems", "object oriented programming", "mobile robots", "field programmable gate array", "online systems", "digital signal processing", "security of data", "cryptography", "computer networks", "distributed computer systems", "software architecture", "software quality", "discrete cosine transforms", "engineering", "signal processing", "artificial intelligence", "computer systems", "architecting", "computer programming", "robotics", "computer hardware", "computer security", "cryptology", "software design", "cosine transforms", "mathematical transformations", "software engineering", "image compression", "image enhancement", "mathematics", "image quality", "image coding", "image analysis", "image processing", "computer imaging and vision" ]

653

We present an open architecture for just-in-time code generation and dynamic code optimization that is flexible, customizable, and extensible. While previous research has primarily investigated functional aspects of such a system, architectural aspects have so far remained unexplored. In this paper, we argue that these properties are important to generate optimal code for a variety of hardware architectures and different processor generations within processor families. These properties are also important to make system-level code generation useful in practice.

2022-06-20T12:02:45.243Z

{ "ACL": null, "DBLP": "journals/corr/cs-OS-9903014", "ArXiv": "cs/9903014", "MAG": "1612660921", "CorpusId": "653", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/04f6c1a2c91b4cd782dd34e7865fb0756e92e22d

Perpetual Adaptation of Software to Hardware: An Extensible Architecture for Providing Code Optimization as a Central System Service

[ { "authorId": "2861277", "name": "T. Kistler" }, { "authorId": "2060899412", "name": "M. Franz" } ]

ArXiv

1,999

42

4

0

false

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

[ "JournalArticle" ]

1999-03-22T00:00:00

{ "name": "ArXiv", "volume": "cs.OS/9903014", "pages": null }

[ "computer hardware", "optimization", "software", "hardware architecture", "code generation" ]

[ "software", "computer hardware", "architecture designs", "code generation", "optimization", "hardware architecture" ]

[ "computer hardware", "optimization", "architecture designs", "software", "hardware architecture", "code generation" ]

[ "computer science", "mathematics", "software architecture", "field programmable gate array", "program compilers", "software design", "parallel processing systems", "computer programming languages", "software engineering", "distributed systems", "computer programming", "distributed computer systems", "computer systems" ]

655

Bayesian neural networks were used to model the relationship between input parameters, democracy, allies, contingency, distance, capability, dependency and major power, and the output parameter which is either peace or conflict. The automatic relevance determination was used to rank the importance of input variables. Control theory approach was used to identify input variables that would give a peaceful outcome. It was found that using all four controllable variables democracy, allies, capability and dependency; or using only dependency or only capabilities, avoids all the predicted conflicts.

2022-09-02T02:46:06.856Z

{ "ACL": null, "DBLP": "journals/corr/abs-0705-1761", "ArXiv": "0705.1761", "MAG": "2133567002", "CorpusId": "655", "PubMed": null, "DOI": "10.1109/IJCNN.2004.1380119", "PubMedCentral": null }

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

Modeling and controlling interstate conflict

[ { "authorId": "1740675", "name": "T. Marwala" }, { "authorId": "3197404", "name": "M. Lagazio" } ]

2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541)

2,004

54

19

1

true

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

[ "JournalArticle", "Conference" ]

2004-07-25T00:00:00

{ "name": "2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541)", "volume": "2", "pages": "1233-1238 vol.2" }

[ "control theory", "bayesian methods", "neural networks" ]

[ "bayesian methods", "neural networks", "control parameters", "network architecture", "bayesian inference" ]

[ "network architecture", "bayesian methods", "control parameters", "control theory", "bayesian inference", "neural networks" ]

[ "computer networks", "artificial intelligence", "control system analysis", "mathematics", "inference engines", "bayes theorem", "machine learning", "computer science", "adaptive control systems", "control systems", "probability", "correlation analysis", "process control", "computer systems", "automation", "engineering" ]

659

A game-theoretic approach for studying power control in multiple-access networks with transmission delay constraints is proposed. A non-cooperative power control game is considered in which each user seeks to choose a transmit power that maximizes its own utility while satisfying the user's delay requirements. The utility function measures the number of reliable bits transmitted per joule of energy and the user's delay constraint is modeled as an upper bound on the delay outage probability. The Nash equilibrium for the proposed game is derived, and its existence and uniqueness are proved. Using a large-system analysis, explicit expressions for the utilities achieved at equilibrium are obtained for the matched filter, decorrelating and (linear) minimum mean square error multiuser detectors. The effects of delay constraints on the users' utilities (in bits/Joule) and network capacity (i.e., the maximum number of users that can be supported) are quantified

2022-09-02T04:23:54.312Z

{ "ACL": null, "DBLP": "conf/isit/MeshkatiPS05", "ArXiv": "cs/0506012", "MAG": "1978174014", "CorpusId": "659", "PubMed": null, "DOI": "10.1109/ISIT.2005.1523426", "PubMedCentral": null }

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

A non-cooperative power control game in delay-constrained multiple-access networks

[ { "authorId": "1882910", "name": "Farhad Meshkati" }, { "authorId": "145967056", "name": "H. Poor" }, { "authorId": "1732346", "name": "S. Schwartz" } ]

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.

2,005

11

20

0

true

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

[ "JournalArticle" ]

2005-06-05T00:00:00

{ "name": "Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.", "volume": null, "pages": "700-704" }

[ "non-cooperative", "power control game", "power control", "game-theoretic", "utility functions", "nash equilibrium", "transmit power", "multi-user detectors", "mean square error", "outage probability" ]

[ "power control", "transmit power", "power control game", "multiple access", "access network", "utility functions", "outages", "outage probability", "probability", "nash equilibrium", "mean square", "mean square error", "multi-user detectors" ]

[ "non-cooperative", "power control game", "multiple access", "power control", "access network", "probability", "outages", "mean square", "game-theoretic", "utility functions", "nash equilibrium", "transmit power", "multi-user detectors", "mean square error", "outage probability" ]

[ "noncooperative game", "radio", "wireless networks", "frequency division multiple access", "multiple access interference", "multiplexing", "fading channels", "code division multiple access", "signal to noise ratio", "broadband networks", "network architecture", "fiber optic networks", "local area networks", "mathematics", "fading (radio)", "sufficient conditions", "stochastic processes", "game theory", "cognitive radio", "mimo systems", "multiuser detection", "wireless telecommunication systems", "wireless communications", "packet networks", "frequency allocation", "spread spectrum communication", "radio interference", "communication channels", "signal processing", "telecommunication traffic", "bandwidth", "computer networks", "bit error rate", "signal detection", "linear matrix inequalities", "artificial intelligence", "signal receivers", "signal interference", "communication systems", "telecommunication systems", "data communication systems", "engineering", "telecommunication networks", "computer science", "matrix algebra", "spurious signal noise", "computer systems" ]

660

An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are important because they admit analytical designs and simple, practical hardware implementation. The spread factor of an interleaver is a common measure for turbo coding applications. Maximum-spread interleavers are interleavers whose spread factors achieve the upper bound. An infinite sequence of quadratic PPs over integer rings that generate maximum-spread interleavers is presented. New properties of PP interleavers are investigated from an algebraic-geometric perspective resulting in a new non- linearity metric for interleavers. A new interleaver metric that is a function of both the nonlinearity metric and the spread factor is proposed. It is numerically demonstrated that the spread factor has a diminishing importance with the block length. A table of good interleavers for a variety of interleaver lengths according to the new metric is listed. Extensive computer simulation results with impressive frame error rates confirm the efficacy of the new metric. Further, when tail-biting constituent codes are used, the resulting turbo codes are quasi-cyclic.

2022-09-04T05:38:49.993Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0601048", "ArXiv": "cs/0601048", "MAG": "2102991183", "CorpusId": "660", "PubMed": null, "DOI": "10.1109/TIT.2007.896870", "PubMedCentral": null }

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

Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective

[ { "authorId": "1693872", "name": "O. Takeshita" } ]

IEEE Transactions on Information Theory

2,006

57

97

16

true

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

[ "JournalArticle" ]

2006-01-12T00:00:00

{ "name": "IEEE Transactions on Information Theory", "volume": "53", "pages": "2116-2132" }

[ "coding performance", "turbo codes", "channel coding", "quasi-cyclic", "hardware implementations", "block lengths", "turbo coding", "interleavers" ]

[ "interleavers", "turbo codes", "computer hardware", "hardware implementations", "convolutional codes" ]

[ "computer hardware", "convolutional codes", "coding performance", "turbo codes", "quasi-cyclic", "channel coding", "hardware implementations", "block lengths", "turbo coding", "interleavers" ]

[ "computer science", "bit error rate", "information theory", "video coding", "imaging systems", "quadrature amplitude modulation", "signal encoding", "low-density parity-check codes", "code division multiple access", "additive white gaussian noise", "data communication systems", "coding errors", "ldpc codes", "image coding", "fading channels", "channel capacity", "field programmable gate array", "iterative decoding", "rayleigh fading", "communication channels", "signal to noise ratio", "probability", "communication", "video processing", "visual communication", "motion estimation", "image reconstruction", "fading (radio)", "orthogonal frequency division multiplexing", "graph theory", "matrix algebra", "white noise", "gaussian noise (electronic)", "computer systems", "image compression", "image processing", "wireless telecommunication systems", "signal processing", "mathematics", "computer imaging and vision", "image analysis", "signal detection", "theoretical computer science", "image quality", "computer networks", "communication systems", "telecommunication systems", "engineering" ]

661

This paper presents a new view of Explanation-Based Learning (EBL) of natural language parsing. Rather than employing EBL for specializing parsers by inferring new ones, this paper suggests employing EBL for learning how to reduce ambiguity only partially. The present method consists of an EBL algorithm for learning partial-parsers, and a parsing algorithm which combines partial-parsers with existing ``full-parsers". The learned partial-parsers, implementable as Cascades of Finite State Transducers (CFSTs), recognize and combine constituents efficiently, prohibiting spurious overgeneration. The parsing algorithm combines a learned partial-parser with a given full-parser such that the role of the full-parser is limited to combining the constituents, recognized by the partial-parser, and to recognizing unrecognized portions of the input sentence. Besides the reduction of the parse-space prior to disambiguation, the present method provides a way for refining existing disambiguation models that learn stochastic grammars from tree-banks. We exhibit encouraging empirical results using a pilot implementation: parse-space is reduced substantially with minimal loss of coverage. The speedup gain for disambiguation models is exemplified by experiments with the DOP model.

2022-08-27T11:49:13.412Z

{ "ACL": "W97-1013", "DBLP": "conf/conll/Simaan97", "ArXiv": "cmp-lg/9708013", "MAG": "2952584234", "CorpusId": "661", "PubMed": null, "DOI": "10.3726/978-3-653-01498-3", "PubMedCentral": null }

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

Explanation-Based Learning of Data-Oriented Parsing

[ { "authorId": "3540477", "name": "K. Sima'an" } ]

CoNLL

1,997

33

12

0

false

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

[ "JournalArticle" ]

1997-08-01T00:00:00

{ "name": null, "volume": null, "pages": "107-116" }

[ "parsing algorithm", "treebanks", "natural languages", "stochastic" ]

[ "parsing algorithm", "natural languages", "stochastic", "word sense disambiguation", "parse trees" ]

[ "word sense disambiguation", "parsing algorithm", "natural languages", "treebanks", "stochastic", "parse trees" ]

[ "word segmentation", "natural language processing", "computational linguistics", "formal languages", "linguistics", "semantics", "syntactics", "stochastic processes", "stochasticity", "translation (languages)", "character recognition", "artificial intelligence", "database systems", "formal languages and automata theory", "probability", "numerical model", "automata theory", "pattern recognition", "computer science", "computer systems", "theoretical computer science", "mathematics", "machine learning" ]

664

We characterize clique trees of a chordal graph in their relation to simplicial vertices and perfect sequences of maximal cliques. We investigate boundary cliques defined by Shibata[23] and clarify their relation to endpoints of clique trees. Next we define a symmetric binary relation between the set of clique trees and the set of perfect sequences of maximal cliques. We describe the relation as a bipartite graph and prove that the bipartite graph is always connected. Lastly we consider to characterize chordal graphs from the aspect of non-uniqueness of clique trees.

2022-09-02T13:42:48.875Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0607055", "ArXiv": "cs/0607055", "MAG": "1614693244", "CorpusId": "664", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/1e94264b992f25187c4571898f11de8d92b85e2e

Boundary cliques, clique trees and perfect sequences of maximal cliques of a chordal graph

[ { "authorId": "2676563", "name": "Hisayuki Hara" }, { "authorId": "1722771", "name": "A. Takemura" } ]

ArXiv

2,006

31

14

0

false

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

[ "JournalArticle" ]

2006-07-11T00:00:00

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

[ "bipartite graphs" ]

[ "weighted graph", "bipartite graphs", "induced subgraphs", "directed graphs", "general graph" ]

[ "general graph", "weighted graph", "bipartite graphs", "induced subgraphs", "directed graphs" ]

[ "graph g", "approximation algorithms", "graphic methods", "graph theory", "polynomial approximation", "approximation theory", "theoretical computer science", "mathematics", "computer science" ]

666

Runtime reconfiguration considered as “applying required changes to a running system” plays an important role for providing high availability not only of safety- and mission-critical systems, but also for commercial web-applications offering professional services. Hereby, the main concerns are maintaining the consistency of the running system during reconfiguration and minimizing its down-time caused by the reconfiguration. This paper focuses on the platform independent subsystem that realises deployment and redeployment of J2EE modules based on the new J2EE Deployment API as a part of the implementation of our proposed system architecture enabling runtime reconfiguration of component-based systems. Our “controlled runtime redeployment” comprises an extension of hot deployment and dynamic reloading, complemented by allowing for structural changes.

2022-08-28T03:08:28.595Z

{ "ACL": null, "DBLP": "journals/corr/cs-NI-0411057", "ArXiv": "cs/0411057", "MAG": "2952069218", "CorpusId": "666", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Runtime Reconfiguration of J2EE Applications

[ { "authorId": "2086685641", "name": "Jasminka Matevska" }, { "authorId": "3086246", "name": "Sascha Olliges" }, { "authorId": "1712950", "name": "W. Hasselbring" } ]

ArXiv

2,004

22

9

0

false

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

[ "JournalArticle" ]

2004-10-01T00:00:00

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

[ "high availability", "system architectures", "software component" ]

[ "dynamic re-configuration", "partial reconfiguration", "high availability", "web application", "system architectures", "self reconfiguration", "reconfigurability", "runtime systems", "ajax" ]

[ "partial reconfiguration", "high availability", "software component", "web application", "self reconfiguration", "system architectures", "runtime systems", "dynamic re-configuration", "reconfigurability", "ajax" ]

[ "reconfigurable hardware", "reconfigurable architectures", "re-configurable", "fault tolerance", "telecommunication networks", "cloud computing", "software", "world wide web", "modular robots", "software engineering", "object oriented programming", "network architecture", "embedded systems", "sensors", "program compilers", "field programmable gate array", "javascript", "web 2.0", "user interfaces", "software quality", "fault tolerant computer systems", "telecommunication systems", "computer systems", "computer science", "internet", "robot applications", "robotic manipulators", "industrial robots", "computer programming", "computer networks", "computer hardware", "parallel processing systems", "computer programming languages", "scripting languages", "human computer interaction", "software design", "distributed computer systems", "robots", "mobile robots", "robotics", "distributed systems", "high level languages" ]

667

In this paper, we derive the capacity of a special class of mesh networks. A mesh network is defined as a heterogeneous wireless network in which the transmission among power limited nodes is assisted by powerful relays, which use the same wireless medium. We find the capacity of the mesh network when there is one source, one destination, and multiple relays. We call this channel the single source multiple relay single destination (SSMRSD) mesh network. Our approach is as follows. We first look at an upper bound on the information theoretic capacity of these networks in the Gaussian setting. We then show that the bound is achievable asymptotically using the compress-forward strategy for the multiple relay channel. Theoretically, the results indicate the value of cooperation and the utility of carefully deployed relays in wireless ad-hoc and sensor networks. The capacity characterization quantifies how the relays can be used to either conserve node energy or to increase transmission rate

2022-09-02T06:59:05.121Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0605093", "ArXiv": "cs/0605093", "MAG": "2105343036", "CorpusId": "667", "PubMed": null, "DOI": "10.1109/ISIT.2006.261639", "PubMedCentral": null }

https://www.semanticscholar.org/paper/06eb981074e004c266b0914a1f7be4e7b542018a

The Capacity of the Single Source Multiple Relay Single Destination Mesh Network

[ { "authorId": "144745633", "name": "L. Ong" }, { "authorId": "1770486", "name": "M. Motani" } ]

2006 IEEE International Symposium on Information Theory

2,006

41

16

2

true

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

[ "JournalArticle" ]

2006-05-21T00:00:00

{ "name": "2006 IEEE International Symposium on Information Theory", "volume": null, "pages": "1673-1677" }

[ "wireless", "relay channels", "sensor networks", "gaussians", "mesh network", "heterogeneous wireless network" ]

[ "relay node", "decode-and-forward relay", "mesh network", "heterogeneous wireless network", "wireless", "wireless networks", "gaussians", "relay channels", "sensors", "sensor networks", "wireless communications", "destination nodes", "network architecture", "mesh topologies", "wireless mesh networks (wmn)" ]

[ "heterogeneous wireless network", "network architecture", "wireless communications", "destination nodes", "wireless", "relay channels", "sensors", "mesh topologies", "gaussians", "relay node", "wireless networks", "mesh network", "decode-and-forward relay", "sensor networks", "wireless mesh networks (wmn)" ]

[ "computer networks", "ad hoc networks", "wireless sensor networks", "routing protocols", "radio", "amplify-and-forward (af)", "fading (radio)", "multiplexing", "channel capacity", "antennas", "computer hardware", "topology", "gaussian distribution", "network coding", "fading channels", "packet networks", "relay selection", "routers", "wireless telecommunication systems", "routing algorithms", "embedded systems", "wireless local area networks (wlan)", "computer science", "mobile telecommunication systems", "internet protocols", "quality of service", "multicasts", "energy utilization", "sensor nodes", "bit error rate", "signal detection", "communication channels", "signal to noise ratio", "information theory", "gaussian noise (electronic)", "telecommunication traffic", "channel state information", "cooperative communication", "cooperative diversity", "outages", "closed-form expression", "outage probability", "bandwidth", "communication systems", "telecommunication systems", "computer systems", "local area networks", "telecommunication networks", "data communication systems", "electricity", "probability", "signal processing", "communication", "rayleigh fading", "transmitters", "mimo systems", "diversity reception", "engineering", "mathematics", "signal receivers" ]

668

Facilities that support distributed transactions on user-defined types can be implemented efficiently and can simplify the construction of reliable distributed programs. To demonstrate these points, this paper describes a prototype transaction facility, called TABS, that supports objects, transparent communication, synchronization, recovery, and transaction management. Various objects that use the facilities of TABS are exemplified and the performance of the system is discussed in detail. The paper concludes that the prototype provides useful facilities, and that it would be feasible to build a high performance implementation based on its ideas. This work was supported by IBM and the Defense Advanced Research Projects Agency, ARPA Order No. 3597, monitored by the Air Force Avionics Laboratory under Contract F33615-81-K-1539, and by graduate fellowships from the National Science Foundation and the Office of Naval Research. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of any of the sponsoring agencies or the US government. Accent is a trademark of Carnegie.Mellon University. Perq is a trademark of Perq Systems Corporation. TAB is a trademark of the Coca-Cola Company. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission. © 1985 A C M 0 8 9 7 9 l1 7 4 1 1 2 / 8 5 0 1 2 7 $ 0 0 . 7 5 1. In t roduct ion General purpose facilities that support distributed transactions are feasible to implement and useful in simplifying the construction of reliable distributed applications. To justify this assertion, this paper describes the design, implementation, use, and performance of TABS [Spector et al. 85], a prototype facility that supports transactions on user-defined abstract objects. We attempt to generalize from our experi6nces with the prototype, particularly in the sections on the usage and performance of TABS. We define a distributed transaction facility as a distributed collection of components that supports not only such standard abstractions as processes and inter-process communication, but also the execution of transactions and the implementation of objects on which operations can be performed. Although there is room for diversity in its exact functions, a distributed transaction facility must make it easy to initiate and commit transactions, to call operations on .objects from within transactions, and to implement abstract types that have correct synchronization and recovery properties. Transactions provide three properties that should make them useful in a variety of distributed applications [Lomet 77, Liskov 82, Spector and Schwarz 83]. Synchronization properties, such as serializability, guarantee that concurrent readers and writers of data do not interfere with each other. Failure atomicity simplifies the maintenance of invariants on data by ensuring that updates are not partially done. Permanence provides programmers the luxury of knowing that only catastrophic failures will corrupt or erase previously made updates. Certainly, these properties of transactions are useful in database applications [Gray 78, Date 83]. Database applications are typically characterized by the need for absolute data integrity, permanent updates, and careful synchronization between processes that access large quantities of shared data. When considering the application of transactions to other domains such as the construction of distributed operating systems and real time systems, there are questions pertaining to what transaction facilities should be provided, how they should

2022-09-04T21:39:44.307Z

{ "ACL": null, "DBLP": "conf/sosp/SpectorDDEP85", "ArXiv": null, "MAG": "1982918197", "CorpusId": "668", "PubMed": null, "DOI": "10.1145/323647.323641", "PubMedCentral": null }

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

Distributed transactions for reliable systems

[ { "authorId": "35103465", "name": "A. Spector" }, { "authorId": "39221080", "name": "Dean S. Daniels" }, { "authorId": "145174356", "name": "D. Duchamp" }, { "authorId": "2653455", "name": "J. L. Eppinger" }, { "authorId": "1717974", "name": "R. Pausch" } ]

SOSP '85

1,985

97

60

2

true

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

[ "JournalArticle" ]

1985-12-01T00:00:00

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

[ "operating systems", "contracts", "distributed program", "real time systems", "database systems", "serializability", "general purpose", "communication", "distributed applications", "university" ]

[ "communication", "contracts", "university", "general purpose", "serializability", "database systems", "operating systems", "real time systems", "transaction processing", "concurrent transactions", "transaction processing systems" ]

[ "operating systems", "transaction processing systems", "communication", "contracts", "transaction processing", "distributed program", "concurrent transactions", "real time systems", "serializability", "general purpose", "distributed applications", "university", "database systems" ]

[ "computer science", "e-commerce", "concurrency control", "distributed computer systems", "transactional memory", "knowledge based systems", "object oriented programming", "mobile robots", "field programmable gate array", "embedded systems", "online systems", "digital signal processing", "program processors", "distributed systems", "education", "computer systems", "internet", "information technology", "storage allocation (computer)", "parallel programming", "artificial intelligence", "computer programming", "robotics", "computer hardware", "signal processing", "parallel processing systems", "microprocessor chips", "parallel algorithms", "parallel architectures", "computer programming languages", "engineering" ]

669

Motivated by sponsored search auctions with hard budget constraints given by the advertisers, we study multi-unit auctions of a single item. An important example is a sponsored result slot for a keyword, with many units representing its inventory in a month, say. In this single-item multi-unit auction, each bidder has a private value for each unit, and a private budget which is the total amount of money she can spend in the auction. A recent impossibility result [Dobzinski et al., FOCS’08] precludes the existence of a truthful mechanism with Paretooptimal allocations in this important setting. We propose Sort-Cut, a mechanism which does the next best thing from the auctioneer’s point of view, that we term semi-truthful. While we are unable to give a complete characterization of equilibria for our mechanism, we prove that some equilibrium of the proposed mechanism optimizes the revenue over all Pareto-optimal mechanisms, and that this equilibrium is the unique one resulting from a natural rational bidding strategy (where every losing bidder bids at least her true value). Perhaps even more significantly, we show that the revenue of every equilibrium of our mechanism differs by at most the budget of one bidder from the optimum revenue (under some mild assumptions).

2022-09-04T05:44:28.117Z

{ "ACL": null, "DBLP": "journals/corr/abs-0903-1450", "ArXiv": null, "MAG": "1484450013", "CorpusId": "669", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Sort-Cut: A Pareto Optimal and Semi-Truthful Mechanism for Multi-Unit Auctions with Budget-Constrained Bidders

[ { "authorId": "1856823", "name": "I. Hafalir" }, { "authorId": "143896128", "name": "R. Ravi" }, { "authorId": "1406439358", "name": "Amin S. Sayedi-Roshkhar" } ]

ArXiv

2,009

33

17

1

false

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

[ "JournalArticle" ]

2009-03-08T00:00:00

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

[ "revenue", "bidding strategy", "truthful mechanisms", "pareto-optimal" ]

[ "pareto", "pareto-optimal", "pareto optimal solutions", "truthful mechanisms", "revenue", "optimal mechanism", "bidding strategy", "pareto frontiers", "pareto front", "incentive compatible", "auction mechanisms" ]

[ "pareto front", "revenue", "incentive compatible", "pareto", "pareto frontiers", "auction mechanisms", "pareto-optimal", "truthful mechanisms", "pareto optimal solutions", "bidding strategy", "optimal mechanism" ]

[ "pareto principle", "earnings", "internet", "mechanism design", "commerce", "approximation algorithms", "optimal solutions", "e-commerce", "multi-objective optimisation", "investments", "computer science", "game theory", "machine design", "economics", "graph theory", "approximation theory", "computer systems", "information technology", "evolutionary algorithms", "artificial intelligence", "robots", "theoretical computer science", "mathematics", "genetic algorithms", "robotics" ]

674

We study geometrical properties of the complete set of solutions of the random 3-satisfiability problem. We show that even for moderate system sizes the number of clusters corresponds surprisingly well with the theoretic asymptotic prediction. We locate the freezing transition in the space of solutions, which has been conjectured to be relevant in explaining the onset of computational hardness in random constraint satisfaction problems.

2022-09-04T11:35:27.263Z

{ "ACL": null, "DBLP": "journals/corr/abs-0804-0362", "ArXiv": "0804.0362", "MAG": "2157049497", "CorpusId": "674", "PubMed": "18999364", "DOI": "10.1103/PhysRevE.78.040101", "PubMedCentral": null }

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

Exhaustive enumeration unveils clustering and freezing in random 3-SAT

[ { "authorId": "3055562", "name": "John Ardelius" }, { "authorId": "2546601", "name": "L. Zdeborová" } ]

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

2,008

59

20

0

true

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

[ "JournalArticle" ]

2008-04-02T00:00:00

{ "name": "Physical review. E, Statistical, nonlinear, and soft matter physics", "volume": "78 4 Pt 1", "pages": "\n 040101\n " }

[ "clustering algorithms" ]

[ "sat", "satisfiability", "satisfiability problems", "constraint satisfaction problems (csp)", "combinatorial problems" ]

[ "satisfiability", "satisfiability problems", "clustering algorithms", "combinatorial problems", "sat", "constraint satisfaction problems (csp)" ]

[ "formal logic", "data mining", "combinatorial mathematics", "model checking", "boolean functions", "artificial intelligence", "computer science", "graph theory", "embedded systems", "architecture verification and validation", "mathematics", "theoretical computer science", "computer systems", "architecting", "software architecture", "software design", "software engineering" ]

675

Formal verification using the model-checking paradigm has to deal with two aspects. The systems models are structured, often as products of components, and the specification logic has to be expressive enough to allow the formalization of reachability properties. The present paper is a study on what can be achieved for infinite transition systems under these premises. As models, we consider products of infinite transition systems with different synchronization constraints. We introduce finitely synchronized transition systems, i.e. product systems which contain only finitely many synchronized transitions, and show that the decidability of FO(R), first-order logic extended by reachability predicates, of the product system can be reduced to the decidability of FO(R) of the components in a Feferman-Vaught like style. This result is optimal in the following sense. (1) If we allow semifinite synchronization, i.e. just in one component infinitely many transitions are synchronized, the FO(R)-theory of the product system is in general undecidable. (2) We cannot extend the expressive power of the logic under consideration. Already a weak extension of first-order logic with transitive closure, where we restrict the transitive closure operators to arity one and nesting depth two, is undecidable for an asynchronous (and hence finitely synchronized) product, namely for the infinite grid.

2022-09-02T03:04:47.140Z

{ "ACL": null, "DBLP": "journals/corr/abs-0710-5659", "ArXiv": "0710.5659", "MAG": "2148150943", "CorpusId": "675", "PubMed": null, "DOI": "10.2168/LMCS-3(4:5)2007", "PubMedCentral": null }

https://www.semanticscholar.org/paper/241d4e6ddbe13239cfeeeba1f32dd2b6be80f6eb

Model checking synchronized products of infinite transition systems

[ { "authorId": "2591513", "name": "Stefan Wöhrle" }, { "authorId": "144944321", "name": "W. Thomas" } ]

Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.

2,004

32

29

1

true

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

[ "JournalArticle" ]

2004-07-13T00:00:00

{ "name": "Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.", "volume": null, "pages": "2-11" }

[ "first order logic", "model checking", "transition system", "formal verifications" ]

[ "transition system", "formal verifications", "verification", "reachability problem", "first order logic", "grid node", "formal specification", "formal model", "formal semantics", "verification techniques", "automatic verification", "dynamic logic", "multivalued logic", "product design" ]

[ "verification", "multivalued logic", "transition system", "formal specification", "product design", "automatic verification", "grid node", "model checking", "first order logic", "formal semantics", "dynamic logic", "verification techniques", "reachability problem", "formal verifications", "formal model" ]

[ "verification and validation", "many valued logics", "formal methods", "real time systems", "software engineering", "formal languages", "computer hardware description languages", "computer programming languages", "computer aided design", "grid environments", "embedded systems", "architecture verification and validation", "formal logic", "modal logic", "computability and decidability", "petri nets", "software quality", "logic gates", "logic design", "boolean functions", "knowledge based systems", "object oriented programming", "mobile robots", "field programmable gate array", "online systems", "digital signal processing", "computer science", "linguistics", "formal languages and automata theory", "computer programming", "grid computing", "computer systems", "architecting", "artificial intelligence", "automata theory", "graph theory", "software design", "mathematics", "robotics", "computer hardware", "signal processing", "theoretical computer science", "parallel processing systems", "software architecture", "engineering", "distributed systems", "distributed computer systems" ]

676

We suggest two new methodologies for the design of efficient secure protocols, that differ with respect to their underlying computational models. In one methodology we utilize the communication complexity tree (or branching for f and transform it into a secure protocol. In other words, "any function f that can be computed using communication complexity c can be can be computed securely using communication complexity that is polynomial in c and a security parameter". The second methodology uses the circuit computing f, enhanced with look-up tables as its underlying computational model. It is possible to simulate any RAM machine in this model with polylogarithmic blowup. Hence it is possible to start with a computation of f on a RAM machine and transform it into a secure protocol. We show many applications of these new methodologies resulting in protocols efficient either in communication or in computation. In particular, we exemplify a protocol for the "millionaires problem", where two participants want to compare their values but reveal no other information. Our protocol is more efficient than previously known ones in either communication or computation.

2022-09-04T23:08:32.936Z

{ "ACL": null, "DBLP": "journals/corr/cs-CR-0109011", "ArXiv": "cs/0109011", "MAG": "1506049346", "CorpusId": "676", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Communication Complexity and Secure Function Evaluation

[ { "authorId": "1693267", "name": "M. Naor" }, { "authorId": "145725600", "name": "Kobbi Nissim" } ]

Electron. Colloquium Comput. Complex.

2,001

54

36

1

false

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

[ "JournalArticle" ]

2001-09-01T00:00:00

{ "name": "IACR Cryptol. ePrint Arch.", "volume": "2001", "pages": "76" }

[ "communication", "look-up table" ]

[ "communication", "communication protocols", "transport protocols", "random access memory", "wireless communications" ]

[ "look-up table", "wireless communications", "random access memory", "transport protocols", "communication protocols", "communication" ]

[ "table lookup", "computer networks", "random access storage", "transmission control protocol", "data communication systems", "network protocols", "field programmable gate array", "computer science", "parallel processing systems", "microprocessor chips", "internet protocols", "congestion control (communication)", "computer systems", "internet", "computer hardware", "distributed systems", "telecommunication traffic", "distributed computer systems", "telecommunication networks", "telecommunication systems" ]

679

An approach to modeling knowledge acquisition in terms of walks along complex networks is described. Each subset of knowledge is represented as a node, and relations between such knowledge are expressed as edges. Two types of edges are considered, corresponding to free and conditional transitions. The latter case implies that a node can only be reached after visiting previously a set of nodes (the required conditions). The process of knowledge acquisition can then be simulated by considering the number of nodes visited as a single agent moves along the network, starting from its lowest layer. It is shown that hierarchical networks--i.e., networks composed of successive interconnected layers--are related to compositions of the prerequisite relationships between the nodes. In order to avoid deadlocks--i.e., unreachable nodes--the subnetwork in each layer is assumed to be a connected component. Several configurations of such hierarchical knowledge networks are simulated and the performance of the moving agent quantified in terms of the percentage of visited nodes after each movement. The Barabási-Albert and random models are considered for the layer and interconnecting subnetworks. Although all subnetworks in each realization have the same number of nodes, several interconnectivities, defined by the average node degree of the interconnection networks, have been considered. Two visiting strategies are investigated: random choice among the existing edges and preferential choice to so far untracked edges. A series of interesting results are obtained, including the identification of a series of plateaus of knowledge stagnation in the case of the preferential movement strategy in the presence of conditional edges.

2022-09-03T21:20:32.815Z

{ "ACL": null, "DBLP": "journals/corr/abs-physics-0601118", "ArXiv": "physics/0601118", "MAG": "2016269160", "CorpusId": "679", "PubMed": "17025499", "DOI": "10.1103/PhysRevE.74.026103", "PubMedCentral": null }

https://www.semanticscholar.org/paper/1c6f8ca45e9aa54c6a6ad3a280409db898df512d

Learning about knowledge: A complex network approach

[ { "authorId": "145882236", "name": "L. D. Costa" } ]

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

2,006

28

24

1

true

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

[ "JournalArticle" ]

2006-01-17T00:00:00

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

[ "knowledge acquisition", "interconnection networks", "complex networks" ]

[ "complex networks", "network architecture", "knowledge acquisition", "interconnection networks", "intelligent agents" ]

[ "knowledge acquisition", "network architecture", "interconnection networks", "intelligent agents", "complex networks" ]

[ "knowledge management", "computer networks", "parallel processing systems", "multiagent system", "topology", "knowledge based systems", "computer science", "distributed systems", "artificial intelligence", "distributed computer systems", "computer systems" ]

682

Two-way translations between various versions of temporal logic and between temporal logic over finite sequences and star-free regular expressions are presented. The main result is a translation from normal-form temporal logic formulas to formulas that use only future operators. The translation offers a new proof to a theorem claimed by D. Gabbay et al. (1980), stating that restricting temporal logic to the future operators does not impair its expressive power. The theorem is the basis of many temporal proof systems.<<ETX>>

2022-08-26T03:04:36.626Z

{ "ACL": null, "DBLP": "conf/lics/PnueliZ93", "ArXiv": null, "MAG": "2122935690", "CorpusId": "682", "PubMed": null, "DOI": "10.1109/LICS.1993.287594", "PubMedCentral": null }

https://www.semanticscholar.org/paper/285c67f05771737a88991fafe6c526cce717b540

In and out of temporal logic

[ { "authorId": "1698938", "name": "A. Pnueli" }, { "authorId": "1688414", "name": "L. Zuck" } ]

[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science

1,993

12

17

1

false

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

[ "JournalArticle" ]

1993-06-19T00:00:00

{ "name": "[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science", "volume": null, "pages": "124-135" }

[ "temporal logic", "proof system" ]

[ "temporal logic", "linear temporal logic", "temporal correlations", "linear time temporal logic", "dynamic logic" ]

[ "temporal correlations", "linear time temporal logic", "proof system", "linear temporal logic", "temporal logic", "dynamic logic" ]

[ "spatial correlations", "image coding", "model checking", "formal logic", "programmable logic controllers", "network security", "automata theory", "modal logic", "correlation methods", "image processing", "embedded systems", "architecture verification and validation", "artificial intelligence", "microprocessor chips", "cryptography", "computer networks", "formal languages and automata theory", "mathematics", "computer imaging and vision", "computer systems", "architecting", "computer science", "computer hardware", "cryptology", "theoretical computer science", "software architecture", "computer security", "software design", "software engineering" ]

683

With the advent of potent network technology, software development has evolved from traditional platform-centric construction to network-centric evolution. This change involves largely the way we reason about systems as evidenced in the introduction of 'network-centric operations (NCO). Unfortunately, it has resulted in conflicting interpretations of how to map NCO concepts to the field of software architecture. In this paper, we capture the core concepts and goals of NCO, investigate the implications of these concepts and goals on software architecture, and identify the operational characteristics that distinguish network- centric software systems from other systems. More importantly, we use architectural design principles to propose an outline for a network-centric architectural style that helps in characterizing network-centric software systems and that provides a means by which their distinguishing operational characteristics can be realized.

2022-08-31T19:29:54.607Z

{ "ACL": null, "DBLP": "conf/sew/ChiganiAB07", "ArXiv": "cs/0612131", "MAG": "2951595131", "CorpusId": "683", "PubMed": null, "DOI": "10.1109/SEW.2007.95", "PubMedCentral": null }

https://www.semanticscholar.org/paper/003aafadeb31688e3ce02a67e7fbca07e1686d42

Architecting Network-Centric Software Systems: A Style-Based Beginning

[ { "authorId": "2023803", "name": "Amine Chigani" }, { "authorId": "145111648", "name": "J. Arthur" }, { "authorId": "2858430", "name": "S. Bohner" } ]

31st IEEE Software Engineering Workshop (SEW 2007)

2,006

37

6

0

true

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

[ "JournalArticle" ]

2006-12-22T00:00:00

{ "name": "31st IEEE Software Engineering Workshop (SEW 2007)", "volume": null, "pages": "290-299" }

[ "software development", "software architecture patterns", "software architecture", "software systems" ]

[ "software", "software systems", "software architecture", "software development", "architectural models", "software architecture patterns" ]

[ "software development", "software architecture patterns", "architectural models", "software", "software architecture", "software systems" ]

[ "software project", "computer science", "software design", "object oriented programming", "software engineering", "computer programming" ]

685

The problem of determining asymptotic bounds on the capacity of a random ad hoc network is considered. Previous approaches assumed a threshold-based link layer model in which a packet transmission is successful if the SINR at the receiver is greater than a fixed threshold. In reality, the mapping from SINR to packet success probability is continuous. Hence, over each hop, for every finite SINR, there is a non-zero probability of packet loss. With this more realistic link model, it is shown that for a broad class of routing and scheduling schemes, a fixed fraction of hops on each route have a fixed non-zero packet loss probability. In a large network, a packet travels an asymptotically large number of hops from source to destination. Consequently, it is shown that the cumulative effect of per-hop packet loss results in a per-node throughput of only O(1/n) (instead of Theta(1/sqrt{n log{n}})) as shown previously for the threshold-based link model). A scheduling scheme is then proposed to counter this effect. The proposed scheme improves the link SINR by using conservative spatial reuse, and improves the per-node throughput to O(1/(K_n sqrt{n log{n}})), where each cell gets a transmission opportunity at least once every K_n slots, and K_n tends to infinity as n tends to infinity.

2022-07-31T05:52:36.251Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0504099", "ArXiv": "cs/0504099", "MAG": "1836465448", "CorpusId": "685", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

The Capacity of Random Ad hoc Networks under a Realistic Link Layer Model

[ { "authorId": "2230319", "name": "V. Mhatre" }, { "authorId": "144082988", "name": "C. Rosenberg" } ]

ArXiv

2,005

16

9

0

false

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

[ "JournalArticle" ]

2005-04-24T00:00:00

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

[ "packet loss probability", "link layers", "probability", "ad hoc networks", "packet transmissions", "routing algorithms", "packet loss" ]

[ "link layers", "data packet", "probability", "packet loss", "routing algorithms", "packet loss probability" ]

[ "packet loss probability", "link layers", "probability", "ad hoc networks", "packet transmissions", "routing algorithms", "packet loss", "data packet" ]

[ "packet switching", "wireless networks", "physical layers", "network layers", "mathematics", "routers", "mobile telecommunication systems", "internet protocols", "quality of service", "wireless local area networks (wlan)", "multicasts", "sensors", "computer networks", "packet networks", "mobile ad hoc networks", "wireless sensor networks", "data communication systems", "wireless communications", "wireless telecommunication systems", "telecommunication traffic", "bandwidth", "communication channels", "telecommunication networks", "local area networks", "computer hardware", "computer science", "routing protocols", "energy utilization", "sensor nodes", "computer systems", "communication systems", "telecommunication systems", "electricity", "engineering" ]

686

This article gives an overview of a new semantic-based transfer approach developed and applied within the Verbmobil Machine Translation project [22]. We present the declarative transfer formalism and discuss its implementation.The results presented in this paper have been integrated successfully in the Verbmobil system.

2022-07-26T07:22:27.632Z

{ "ACL": null, "DBLP": "journals/corr/cmp-lg-9607010", "ArXiv": "cmp-lg/9607010", "MAG": "1480152078", "CorpusId": "686", "PubMed": null, "DOI": "10.22028/D291-25298", "PubMedCentral": null }

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

Efficient Implementation of a Semantic-based Transfer Approach

[ { "authorId": "2558045", "name": "Michael Dorna" }, { "authorId": "1885867", "name": "M. Emele" } ]

ECAI

1,996

31

20

0

false

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

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

1996-07-01T00:00:00

{ "name": null, "volume": null, "pages": "567-571" }

[ "machine translations" ]

[ "semantics", "speech translation", "machine translations", "semantic information", "syntactics" ]

[ "machine translations", "semantic information", "speech translation", "syntactics", "semantics" ]

[ "natural language processing", "translation (languages)", "information theory", "computer aided language translation", "computational linguistics", "artificial intelligence", "natural languages", "automata theory", "linguistics", "communication", "speech transmission", "database systems", "computer science", "formal languages and automata theory", "speech communication", "computer systems", "theoretical computer science" ]

687

We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which the travel speed is high. More specifically, one can travel from one endpoint of the walkway to the other at speed v > 1, but can only travel at unit speed between any other pair of points. The travel time between any two points in the plane is the minimum between the actual geometric distance, and the time needed to go from one point to the other using the walkway. A location for a walkway is said to be optimal with respect to a given set of points if it minimizes the maximum travel time between any two points of the set. We give a simple linear-time algorithm for finding an optimal location in the case where the points are on a line. We also give an Ω(n logn) lower bound for the problem of computing the travel time diameter of a set of points on a line with respect to a given walkway. Then we describe a O(n logn) algorithm for locating a walkway with the additional restriction that the walkway must be horizontal. This algorithm is based on a recent generic method for solving quasiconvex programs with implicitly defined constraints. It is used in a (1 + e)-approximation algorithm for optimal location of a walkway of arbitrary orientation. Finally, we consider several variants of the transportation model, including escalators, used for traveling between two floors of a building, and elevators, which are strictly vertical.

2022-09-04T06:26:40.582Z

{ "ACL": null, "DBLP": "journals/corr/abs-0705-0635", "ArXiv": "0705.0635", "MAG": "2106293762", "CorpusId": "687", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Moving Walkways, Escalators, and Elevators

[ { "authorId": "144730279", "name": "J. Cardinal" }, { "authorId": "1757130", "name": "Sébastien Collette" }, { "authorId": "145155653", "name": "F. Hurtado" }, { "authorId": "1783074", "name": "S. Langerman" }, { "authorId": "2204355", "name": "Belén Palop" } ]

ArXiv

2,007

29

6

0

false

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

[ "JournalArticle" ]

2007-05-04T00:00:00

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

[]

[ "adaptive algorithms", "approximation algorithms", "control point", "location based", "location information" ]

[ "location based", "adaptive algorithms", "control point", "approximation algorithms", "location information" ]

[ "location based services", "software", "image coding", "splines", "curve fitting", "graph theory", "approximation theory", "ad hoc networks", "sensor networks", "wireless sensor networks", "telecommunication equipment", "mobile devices", "computer science", "image processing", "computer aided design", "mathematics", "theoretical computer science", "routers", "mobile telecommunication systems", "internet protocols", "quality of service", "wireless local area networks (wlan)", "multicasts", "routing algorithms", "sensors", "wireless telecommunication systems", "embedded systems", "wireless communications", "energy utilization", "sensor nodes", "mobile computing", "computer imaging and vision", "telecommunication traffic", "bandwidth", "communication channels", "telecommunication networks", "local area networks", "data communication systems", "computer networks", "computer hardware", "communication systems", "telecommunication systems", "computer systems", "electricity", "engineering" ]

690

Blending schemes based on circles provide smooth `fair' interpolations between series of points. Here we demonstrate a simple, robust set of algorithms for performing circle blends for a range of cases. An arbitrary level of G-continuity can be achieved by simple alterations to the underlying parameterisation. Our method exploits the computational framework provided by conformal geometric algebra. This employs a five-dimensional representation of points in space, in contrast to the four-dimensional representation typically used in projective geometry. The advantage of the conformal scheme is that straight lines and circles are treated in a single, unified framework. As a further illustration of the power of the conformal framework, the basic idea is extended to the case of sphere blending to interpolate over a surface.

2022-08-28T08:34:37.965Z

{ "ACL": null, "DBLP": "journals/corr/cs-CG-0310017", "ArXiv": "cs/0310017", "MAG": "1631065508", "CorpusId": "690", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Circle and sphere blending with conformal geometric algebra

[ { "authorId": "145445634", "name": "C. Doran" } ]

ArXiv

2,003

17

8

1

false

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

[ "JournalArticle" ]

2003-10-09T00:00:00

{ "name": "ArXiv", "volume": "cs.CG/0310017", "pages": null }

[ "geometry" ]

[ "geometry", "parameterization", "relational algebra", "epipolar geometry", "software frameworks" ]

[ "geometry", "epipolar geometry", "parameterization", "relational algebra", "software frameworks" ]

[ "stereo vision", "matrix algebra", "numerical model", "relational database", "computer programming", "image reconstruction", "mathematics", "knowledge based systems", "query languages", "computer science", "image analysis", "image processing", "artificial intelligence", "database systems", "computer imaging and vision", "computer systems" ]

692

We introduce a new approach to take into account the memory architecture and the memory mapping in the High- Level Synthesis of Real-Time embedded systems. We formalize the memory mapping as a set of constraints used in the scheduling step. We use a memory mapping file to include those memory constraints in our HLS tool GAUT. Our scheduling algorithm exhibits a relatively low complexity that permits to tackle complex designs in a reasonable time. Finally, we show how to explore, with the help of GAUT, a wide range of solutions, and to reach a good tradeoff between time, power-consumption, and area.

2022-09-04T10:07:23.845Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0605145", "ArXiv": "cs/0605145", "MAG": "1644792644", "CorpusId": "692", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Memory Aware High-Level Synthesis for Embedded Systems

[ { "authorId": "1707025", "name": "G. Corre" }, { "authorId": "1709961", "name": "E. Senn" }, { "authorId": "35134210", "name": "N. Julien" }, { "authorId": "143651230", "name": "E. Martin" } ]

ArXiv

2,006

13

3

0

false

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

[ "JournalArticle" ]

2006-05-30T00:00:00

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

[ "high level synthesis", "memory architecture", "embedded systems", "real-time embedded systems" ]

[ "random access memory", "high level synthesis", "embedded systems", "memory architecture", "non-volatile memories" ]

[ "embedded systems", "real-time embedded systems", "random access memory", "high level synthesis", "non-volatile memories", "memory architecture" ]

[ "computer systems", "real time systems", "embedded software", "random access storage", "field programmable gate array", "computer aided design", "flash memory", "multi core", "parallel architectures", "computer science", "knowledge based systems", "object oriented programming", "mobile robots", "online systems", "digital signal processing", "parallel processing systems", "microprocessor chips", "computer hardware", "program processors", "artificial intelligence", "computer programming", "robotics", "signal processing", "distributed systems", "engineering", "distributed computer systems" ]

693

This paper outlines a three-step procedure for determining the low bit error rate performance curve of a wide class of LDPC codes of moderate length. The traditional method to estimate code performance in the higher SNR region is to use a sum of the contributions of the most dominant error events to the probability of error. These dominant error events will be both code and decoder dependent, consisting of low-weight codewords as well as non-codeword events if ML decoding is not used. For even moderate length codes, it is not feasible to find all of these dominant error events with a brute force search. The proposed method provides a convenient way to evaluate very low bit error rate performance of an LDPC code without requiring knowledge of the complete error event weight spectrum or resorting to a Monte Carlo simulation. This new method can be applied to various types of decoding such as the full belief propagation version of the message passing algorithm or the commonly used min-sum approximation to belief propagation. The proposed method allows one to efficiently see error performance at bit error rates that were previously out of reach of Monte Carlo methods. This result will provide a solid foundation for the analysis and design of LDPC codes and decoders that are required to provide a guaranteed very low bit error rate performance at certain SNRs.

2022-09-02T07:20:38.270Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0605051", "ArXiv": "cs/0605051", "MAG": "1772907943", "CorpusId": "693", "PubMed": null, "DOI": null, "PubMedCentral": null }

https://www.semanticscholar.org/paper/5483ab5506c6e2671f1666171d42ebb43fa30faf

A General Method for Finding Low Error Rates of LDPC Codes

[ { "authorId": "39082569", "name": "C. A. Cole" }, { "authorId": "8936335", "name": "Stephen G. Wilson" }, { "authorId": "2797830", "name": "E. K. Hall" }, { "authorId": "2156869", "name": "T. R. Giallorenzi" } ]

ArXiv

2,006

24

96

6

false

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

[ "JournalArticle" ]

2006-05-11T00:00:00

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

[ "bit error rate", "min-sum", "message passing algorithm", "error performance", "probability", "ldpc codes", "belief propagation", "snr" ]

[ "bit error rate", "ldpc codes", "snr", "probability", "belief propagation", "error performance" ]

[ "bit error rate", "min-sum", "message passing algorithm", "error performance", "probability", "ldpc codes", "belief propagation", "snr" ]

[ "communication channels", "signal to noise ratio", "inference engines", "graphical model", "information theory", "iterative decoding", "block codes", "fading (radio)", "rayleigh fading", "mimo systems", "mathematics", "signal encoding", "low-density parity-check codes", "backpropagation algorithm", "graph theory", "wireless telecommunication systems", "signal processing", "artificial intelligence", "bayesian methods", "graphic methods", "communication", "signal detection", "fading channels", "channel capacity", "matrix algebra", "neural networks", "theoretical computer science", "computer networks", "communication systems", "telecommunication systems", "engineering", "computer science", "machine learning", "computer systems" ]

695

This paper studies a two-tier code-division multiple-access (CDMA) system in which the microcell base is converted into a data access point (DAP), i.e., is a limited-range base station that provides high-speed access to one user at a time. The microcell (or DAP) user operates on the same frequency as the macrocell users and has the same chip rate. However, it adapts its spreading factor, and thus its data rate, in accordance with interference conditions. By contrast, the macrocell serves multiple simultaneous data users, each with the same fixed rate. The achievable throughput for individual microcell users is examined and a simple accurate approximation for its probability distribution is presented. Computations for average throughputs, both per-user and total, are also presented. The numerical results highlight the impact of a desensitivity parameter used in the base-selection process.

2022-06-20T10:47:31.730Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0503040", "ArXiv": "cs/0503040", "MAG": "2109263701", "CorpusId": "695", "PubMed": null, "DOI": "10.1109/TWC.2005.852144", "PubMedCentral": null }

https://www.semanticscholar.org/paper/12ad82db02794682e2a4d2fd5a583d43cfb345c6

Uplink throughput in a single-macrocell/single-microcell CDMA system with application to data access points

[ { "authorId": "143902560", "name": "S. Kishore" }, { "authorId": "1732346", "name": "S. Schwartz" }, { "authorId": "1777823", "name": "L. Greenstein" }, { "authorId": "145967056", "name": "H. Poor" } ]

IEEE Transactions on Wireless Communications

2,005

19

4

1

true

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

[ "JournalArticle" ]

2005-03-18T00:00:00

{ "name": "IEEE Transactions on Wireless Communications", "volume": "4", "pages": "1302-1306" }

[ "numerical results", "probability distributions", "cdma system", "uplink", "base stations", "access points" ]

[ "uplink", "code division multiple access", "cdma system", "access points", "base stations", "multiple access", "probability", "probability distributions", "numerical results" ]

[ "numerical results", "multiple access", "probability distributions", "cdma system", "probability", "base stations", "uplink", "access points", "code division multiple access" ]

[ "wireless telecommunication systems", "numerical methods", "wireless networks", "frequency division multiple access", "multiple access interference", "multiplexing", "fading channels", "mathematics", "mobile telecommunication systems", "ofdma", "wireless local area networks (wlan)", "communication channels", "computer networks", "communication systems", "telecommunication systems", "wireless communications", "packet networks", "frequency allocation", "spread spectrum communication", "radio interference", "signal to noise ratio", "telecommunication networks", "orthogonal frequency division multiplexing", "local area networks", "computer science", "computer systems", "telecommunication traffic", "data communication systems", "fading (radio)", "signal receivers", "signal interference", "signal processing", "bit error rate", "signal detection", "spurious signal noise", "engineering" ]

701

Given a planar graph $\Ggg$ and a sequence ${\CC}_1,\ldots,{\CC}_q$, where each ${\CC}_i$ is a family of vertex subsets of $\Ggg$, we wish to find a plane embedding of $\Ggg$, if any exists, such that, for each $i\in\{1,\ldots,q\}$, there is a face Fi in the embedding whose boundary contains at least one vertex from each set in CCi. This problem has applications in the recovery of topological information from geographical data and the design of constrained layouts in VLSI. Let $\inputsize$ be the input size, i.e., the total number of vertices and edges in $\Ggg$ and the families CCi, counting multiplicity. We show that this problem is NP-complete in general. We also show that it is solvable in $O(\inputsize\log \inputsize)$ time for the special case in which, for each input family CCi, each set in CCi induces a connected subgraph of the input graph $\Ggg$. Note that the classical problem of simply finding a planar embedding is a further special case of this case with q=0. Therefore, the processing of the additional constraints CC1, . . .,CCq incurs only a logarithmic factor of overhead.

2022-09-02T17:17:08.213Z

{ "ACL": null, "DBLP": "journals/corr/cs-DS-0102007", "ArXiv": "cs/0102007", "MAG": "2952030048", "CorpusId": "701", "PubMed": null, "DOI": "10.1137/S009753970037775X", "PubMedCentral": null }

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

Common-Face Embeddings of Planar Graphs

[ { "authorId": "2109250019", "name": "Zhi-Zhong Chen" }, { "authorId": "115698518", "name": "Xin He" }, { "authorId": "1704494", "name": "M. Kao" } ]

SIAM J. Comput.

2,001

98

2

0

true

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

[ "JournalArticle" ]

2001-02-09T00:00:00

{ "name": "ArXiv", "volume": "cs.DS/0102007", "pages": null }

[ "vlsi", "planar graph" ]

[ "facial images", "planar graph", "vlsi", "general graph", "directed graphs" ]

[ "general graph", "planar graph", "facial images", "vlsi", "directed graphs" ]

[ "graph g", "approximation algorithms", "graphic methods", "face recognition", "vlsi circuits", "graph theory", "polynomial approximation", "approximation theory", "pattern recognition", "image processing", "computer hardware", "theoretical computer science", "mathematics", "machine learning", "computer imaging and vision", "computer science", "artificial intelligence" ]

702

We study here schedulers for a class of rules that naturally arise in the context of rule-based constraint programming. We systematically derive a scheduler for them from a generic iteration algorithm of Apt (2000). We apply this study to so-called membership rules of Apt and Monfroy (2001). This leads to an implementation that yields a considerably better performance for these rules than their execution as standard CHR rules. Finally, we show how redundant rules can be identified and how appropriately reduced sets of rules can be computed.

2022-06-29T18:53:04.544Z

{ "ACL": null, "DBLP": "journals/tplp/Brand05", "ArXiv": "cs/0403037", "MAG": "2100410698", "CorpusId": "702", "PubMed": null, "DOI": "10.1017/S1471068405002401", "PubMedCentral": null }

https://www.semanticscholar.org/paper/993f461da2e6a5ab82182f51e5585045c3173b72

Schedulers and redundancy for a class of constraint propagation rules

[ { "authorId": "46525444", "name": "S. Brand" }, { "authorId": "1748061", "name": "K. Apt" } ]

Theory and Practice of Logic Programming

2,004

14

2

0

true

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

[ "JournalArticle" ]

2004-03-23T00:00:00

{ "name": "Theory and Practice of Logic Programming", "volume": "5", "pages": "441 - 465" }

[ "constraint programming", "constraint propagation" ]

[ "constraint propagation", "rule base", "constraint programming", "programming languages", "constraint networks" ]

[ "programming languages", "constraint networks", "constraint propagation", "constraint programming", "rule base" ]

[ "computer programming languages", "linguistics", "computer programming", "constraint satisfaction problems (csp)", "knowledge based systems", "computer science", "artificial intelligence" ]

704

We present work in progress on abstracting dialog managers from their domain in order to implement a dialog manager development tool which takes (among other data) a domain description as input and delivers a new dialog manager for the described domain as output. Thereby we will focus on two topics; firstly, the construction of domain descriptions with description logics and secondly, the interpretation of utterances in a given domain.

2022-06-20T13:03:00.877Z

{ "ACL": null, "DBLP": "conf/dlog/LudwigGN98", "ArXiv": "cmp-lg/9808005", "MAG": "2949169006", "CorpusId": "704", "PubMed": null, "DOI": null, "PubMedCentral": null }

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

Combining Expression and Content in Domains for Dialog Managers

[ { "authorId": "144580493", "name": "Bernd Ludwig" }, { "authorId": "34669274", "name": "Günther Görz" }, { "authorId": "144290244", "name": "H. Niemann" } ]

Description Logics

1,998

36

8

0

false

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

[ "JournalArticle" ]

1998-08-01T00:00:00

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

[ "description logic" ]

[ "dialogue", "dialogue management", "dialogue manager", "description logic", "spoken dialogue" ]

[ "spoken dialogue", "dialogue manager", "dialogue management", "dialogue", "description logic" ]

[ "dialogue systems", "speech communication", "human computer interaction", "argumentation", "linguistics", "formal logic", "knowledge representation", "ontology", "formal languages", "natural language processing", "computer science", "logic programming", "autonomous agents", "artificial intelligence", "knowledge based systems", "semantics", "formal languages and automata theory", "natural languages", "computer programming languages", "multiagent system", "theoretical computer science", "computer programming" ]

705

In this paper we show that an account for coordination can be constructed using the derivation structures in a lexicalized Tree Adjoining Grammar (LTAG). We present a notion of derivation in LTAGs that preserves the notion of fixed constituency in the LTAG lexicon while providing the flexibility needed for coordination phenomena. We also discuss the construction of a practical parser for LTAGs that can handle coordination including cases of non-constituent coordination.

2022-09-04T02:19:53.346Z

{ "ACL": "C96-2103", "DBLP": "journals/corr/cmp-lg-9606006", "ArXiv": "cmp-lg/9606006", "MAG": "2088020722", "CorpusId": "705", "PubMed": null, "DOI": "10.3115/993268.993275", "PubMedCentral": null }

https://www.semanticscholar.org/paper/4131e7f7eecbab24b8bf5a9aebd3929c118af7cf

Coordination in Tree Adjoining Grammars: Formalization and Implementation

[ { "authorId": "3028658", "name": "Anoop Sarkar" }, { "authorId": "1714374", "name": "A. Joshi" } ]

COLING

1,996

33

70

2

true

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

[ "JournalArticle", "Conference" ]

1996-06-06T00:00:00

{ "name": null, "volume": null, "pages": "610-615" }

[]

[ "coordination mechanisms", "context-free", "syntactic structure", "parsing algorithm", "context sensitive grammars" ]

[ "syntactic structure", "parsing algorithm", "context-free", "context sensitive grammars", "coordination mechanisms" ]

[ "natural language processing", "syntactics", "computational linguistics", "formal languages", "context free languages", "graph theory", "multiagent system", "artificial intelligence", "natural languages", "database systems", "linguistics", "formal languages and automata theory", "automata theory", "theoretical computer science", "computer science", "semantics", "computer systems" ]

707

This paper presents a method for jointly designing the transmitter-receiver pair in a block-by-block communication system that employs (intrablock) decision feedback detection. We provide closed-form expressions for transmitter-receiver pairs that simultaneously minimize the arithmetic mean squared error (MSE) at the decision point (assuming perfect feedback), the geometric MSE, and the bit error rate of a uniformly bit-loaded system at moderate-to-high signal-to-noise ratios. Separate expressions apply for the "zero-forcing" and "minimum MSE" (MMSE) decision feedback structures. In the MMSE case, the proposed design also maximizes the Gaussian mutual information and suggests that one can approach the capacity of the block transmission system using (independent instances of) the same (Gaussian) code for each element of the block. Our simulation studies indicate that the proposed transceivers perform significantly better than standard transceivers and that they retain their performance advantages in the presence of error propagation.

2022-09-04T12:24:02.693Z

{ "ACL": null, "DBLP": "journals/corr/abs-cs-0504015", "ArXiv": "cs/0504015", "MAG": "1977132383", "CorpusId": "707", "PubMed": null, "DOI": "10.1109/TSP.2005.861779", "PubMedCentral": null }

https://www.semanticscholar.org/paper/4858d966f6916518751f6911fb076bebe2472612

Design of block transceivers with decision feedback detection

[ { "authorId": "2143943814", "name": "Fang Xu" }, { "authorId": "145101911", "name": "T. Davidson" }, { "authorId": "2047971173", "name": "Jian-Kang Zhang" }, { "authorId": "143949382", "name": "K. Wong" } ]

IEEE Transactions on Signal Processing

2,005

87

93

25

true

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

[ "JournalArticle" ]

2005-04-05T00:00:00

{ "name": "IEEE Transactions on Signal Processing", "volume": "54", "pages": "965-978" }

[ "transceivers", "bit error rate", "signal to noise ratio", "zero-forcing", "closed-form expression", "decision feedback", "mutual informations", "block transmissions", "gaussians", "mse", "communication systems", "mean square error" ]

[ "transceivers", "transmitters", "decision feedback", "communication", "closed-form expression", "mean square", "mean square error", "mse", "bit error rate", "noise ratios", "gaussians", "mutual informations" ]

[ "transmitters", "transceivers", "zero-forcing", "signal to noise ratio", "bit error rate", "closed-form expression", "decision feedback", "noise ratios", "mutual informations", "mean square", "block transmissions", "gaussians", "communication", "mse", "communication systems", "mean square error" ]

[ "signal receivers", "antennas", "communication channels", "precoding", "mimo", "beamforming", "signal processing", "probability", "rayleigh fading", "decision feedback equalizers", "fading channels", "mimo systems", "acoustic intensity", "information theory", "sufficient conditions", "stochastic processes", "single carrier", "gaussian distribution", "computer systems", "signal detection", "wireless telecommunication systems", "multiplexing", "orthogonal frequency division multiplexing", "engineering", "mathematics", "data communication systems", "fading (radio)", "linear matrix inequalities", "frequency division multiple access", "frequency domains", "carrier communication", "channel estimation", "gaussian noise (electronic)", "computer science", "computer networks", "telecommunication systems", "matrix algebra", "frequency allocation", "frequency domain analysis", "telecommunication traffic", "bandwidth", "time domain analysis", "telecommunication networks" ]