|
| Computer Research Repository : Hybrid Reasoning and the Future of Iconic Representations |
| arXiv:0803.1457 (March 2008) | | Hybrid Reasoning and the Future of Iconic Representations | | Catherine Recanati | | Received. 10 March 2008 Last updated. 10 March 2008 | | Abstract. We give a brief overview of the main characteristics of diagrammatic reasoning, analyze a case of human reasoning in a mastermind game, and explain why hybrid representation systems (HRS) are particularly attractive and promising for Artificial General Intelligence and Computer Science in general. | | Categories. cs.AI cs.LO | | Subject. Artificial Intelligence; Logic in Computer Science | | Comment. pp. 299-310 | | Journal-ref. Dans Artificial General Intelligence 2008 - The First AGI Conference, Memphis, Tennessee : États-Unis d'Amérique (2008) |
|
DISCUSS... |
|
| Computer Research Repository : Tight Bounds on the Capacity of Binary Input random CDMA Systems |
| arXiv:0803.1454 (March 2008) | | Tight Bounds on the Capacity of Binary Input random CDMA Systems | | Satish Babu Korada and Nicolas Macris | | Received. 10 March 2008 Last updated. 10 March 2008 | | Abstract. We consider multiple access communication on a binary input additive white Gaussian noise channel using randomly spread code division. For a general class of symmetric distributions for spreading coefficients, in the limit of a large number of users, we prove an upper bound on the capacity, which matches a formula that Tanaka obtained by using the replica method. We also show concentration of various relevant quantities including mutual information, capacity and free energy. The mathematical methods are quite general and allow us to discuss extensions to other multiuser scenarios. | | Categories. cs.IT math.IT | | Subject. Information Theory; | | Comment. 34 pages License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
|
DISCUSS... |
|
| Computer Research Repository : Distributed Joint Source-Channel Coding on a Multiple Access Channel with Side Information |
| arXiv:0803.1445 (March 2008) | | Distributed Joint Source-Channel Coding on a Multiple Access Channel with Side Information | | R. Rajesh and Vinod Sharma | | Received. 10 March 2008 Last updated. 10 March 2008 | | Abstract. We consider the problem of transmission of several distributed sources over a multiple access channel (MAC) with side information at the sources and the decoder. Source-channel separation does not hold for this channel. Sufficient conditions are provided for transmission of sources with a given distortion. The source and/or the channel could have continuous alphabets (thus Gaussian sources and Gaussian MACs are special cases). Various previous results are obtained as special cases. We also provide several good joint source-channel coding schemes for a discrete/continuous source and discrete/continuous alphabet channel. Channels with feedback and fading are also considered. Keywords: Multiple access channel, side information, lossy joint source-channel coding, channels with feedback, fading channels. | | Categories. cs.IT math.IT | | Subject. Information Theory; | | Comment. 49 pages, Technical Report, DRDO-IISc programme on Advanced Research in Mathematical Engineering, Dept of ECE, Indian Institute of Science, Bangalore, India | | Report No. TR-PME-2008-01 License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
|
DISCUSS... |
|
| Computer Research Repository : Lexical growth, entropy and the benefits of networking |
| arXiv:0803.1443 (March 2008) | | Lexical growth, entropy and the benefits of networking | | Robert Shour | | Received. 10 March 2008 Last updated. 10 March 2008 | | Abstract. If each node of an idealized network has an equal capacity to efficiently exchange benefits, then the network's capacity to use energy is scaled by the average amount of energy required to connect any two of its nodes. The scaling factor equals e, and the network's entropy is ln(n). Networking emerges in consequence of nodes maximizing the ratio of energy use to benefit, and their connectibility. Networking leads to nested hierarchical clustering, which multiplies a network's capacity to use its energy to benefit its nodes. Network entropy multiplies a node's capacity. For a real network in which the nodes have the capacity to exchange benefits, network entropy may be estimated as Clog(n), where the base of the log is the path length L, and C is the clustering coefficient. Since n, L and C can be calculated for real networks, network entropy for real networks can be calculated and can reveal aspects of emergence and also of economic, biological, conceptual and other networks, such as the relationship between rates of lexical growth and divergence, and the economic benefit of adding customers to a commercial communications network. Entropy dating can help estimate the age of network processes, such as the growth of hierarchical society and of grammatically organized language. | | Categories. cs.IT math.IT | | Subject. Information Theory; | | ACM-class. E.4; H.1.1; J.4 License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | | Comment. About 27 pages, double spaced |
|
DISCUSS... |
|
| Computer Research Repository : On the need for a global academic internet platform |
| arXiv:0803.1360 (March 2008) | | On the need for a global academic internet platform | | Nadja Kutz | | Received. 10 March 2008 Last updated. 10 March 2008 | | Abstract. The article collects arguments for the necessity of a global academic internet platform, which is organized as a kind of "global scientific parliament". With such a constitution educational and research institutions will have direct means for communicating scientific results, as well as a platform for representing academia and scientific life in the public. | | Categories. cs.CY | | Subject. Computers and Society | | ACM-class. K.4.1; K.4.3 License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | | Comment. 22 pages, no figures |
|
DISCUSS... |
|
| Computer Research Repository : Power-Aware Real-Time Scheduling upon Identical Multiprocessor Platforms |
| arXiv:0712.2958 (December 2007) | | Power-Aware Real-Time Scheduling upon Identical Multiprocessor Platforms | | Vincent Nélis, Joël Goossens, Nicolas Navet, Raymond Devillers and Dragomir Milojevic | | Received. 18 December 2007 Last updated. 10 March 2008 | | Abstract. 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. | | Categories. cs.OS | | Subject. Operating Systems | | Comment. The manuscript corresponds to the final version of SUTC 2008 conference |
|
DISCUSS... |
|
| Computer Research Repository : Probabilistic Analysis of Linear Programming Decoding |
| cs/0702014 (February 2007) | | Probabilistic Analysis of Linear Programming Decoding | | Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp and Martin J. Wainwright | | Received. 02 February 2007 Last updated. 10 March 2008 | | Abstract. We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code ensemble, the linear programming decoder of Feldman et al. succeeds in correcting a constant fraction of errors with high probability. The fraction of correctable errors guaranteed by our analysis surpasses previous non-asymptotic results for LDPC codes, and in particular exceeds the best previous finite-length result on LP decoding by a factor greater than ten. This improvement stems in part from our analysis of probabilistic bit-flipping channels, as opposed to adversarial channels. At the core of our analysis is a novel combinatorial characterization of LP decoding success, based on the notion of a generalized matching. An interesting by-product of our analysis is to establish the existence of "probabilistic expansion" in random bipartite graphs, in which one requires only that almost every (as opposed to every) set of a certain size expands, for sets much larger than in the classical worst-case setting. | | Categories. cs.IT cs.DM math.IT | | Subject. Information Theory; Discrete Mathematics; | | Comment. To appear, IEEE Transactions on Information Theory, (replaces shorter version that appeared in SODA'07) |
|
DISCUSS... |
|
| Computer Research Repository : A new key exchange cryptosystem |
| arXiv:0801.1362 (January 2008) | | A new key exchange cryptosystem | | An-Ping Li | | Received. 09 January 2008 Last updated. 10 January 2008 | | Abstract. In this paper, we will present a new key exchange cryptosystem based on linear algebra, which take less operations than Diffie-Hellman's one. | | Categories. cs.CR | | Subject. Cryptography and Security | | Comment. we add a remark in the end of the paper, where show a attack for the key exchange system presented |
|
DISCUSS... |
|
| Computer Research Repository : On the graph isomorphism problem |
| arXiv:0801.0398 (January 2008) | | On the graph isomorphism problem | | Shmuel Friedland | | Received. 02 January 2008 Last updated. 10 January 2008 | | Abstract. We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper. | | Categories. cs.CC cs.DM | | Subject. Computational Complexity; Discrete Mathematics | | ACM-class. G.2.2; F.2.2 | | Comment. 12 pages |
|
DISCUSS... |
|
| Computer Research Repository : The capacity of a class of 3-receiver broadcast channels with degraded message sets |
| arXiv:0712.3327 (December 2007) | | The capacity of a class of 3-receiver broadcast channels with degraded message sets | | Chandra Nair and Abbas El Gamal | | Received. 20 December 2007 Last updated. 10 January 2008 | | Abstract. Korner and Marton established the capacity region for the 2-receiver broadcast channel with degraded message sets. Recent results and conjectures suggest that a straightforward extension of the Korner-Marton region to more than 2 receivers is optimal. This paper shows that this is not the case. We establish the capacity region for a class of 3-receiver broadcast channels with 2 degraded message sets and show that it can be strictly larger than the straightforward extension of the Korner-Marton region. The key new idea is indirect decoding, whereby a receiver who cannot directly decode a cloud center, finds it indirectly by decoding satellite codewords. This idea is then used to establish new inner and outer bounds on the capacity region of the general 3-receiver broadcast channel with 2 and 3 degraded message sets. We show that these bounds are tight for some nontrivial cases. The results suggest that the capacity of the 3-receiver broadcast channel with degraded message sets is as at least as hard to find as the capacity of the general 2-receiver broadcast channel with common and private message. | | Categories. cs.IT math.IT | | Subject. Information Theory; | | Comment. Submitted to IEEE transactions on Information Theory |
|
DISCUSS... |
|
|
|