RedTram News Search Engine
Русский  English Українська  Français  Polski  Deutsch  Italiano  Español  中文   
12 May 2008 year (time zone GMT 00:00)  Number of sources in English: 4107
Navigating the themes
Navigating the regions
All Themes Recreation & Entertainment Computers & Internet World
Computers & Internet (World) RSS 2.0

Announcing Dark Horizons, Gritty Sci-Fi Space Adventures

12.05.2008 05:46    mortality.net
Sinister Adventures, LLC, an adventure publisher dedicated to delivering the very finest RPG modules in multiple game systems is pleased to announce two new DARK HORIZONS products available now for Preorder. Dark Horizons #1: Cold Black The Known Universe Gazetteer

Sinister Goes to WAR!

12.05.2008 05:46    mortality.net
Sinister Adventures, LLC, is pleased to show off its new cover art, painted by the one and only Wayne Antony Reynolds, for the first in their flagship line of Dark Vista OGL D20 adventures RAZOR COAST now available for preorder.

Rite Publishing releases free web enhancment for Monte Cook's Arcana Evolved

12.05.2008 05:44    mortality.net
Rite Publishing has released a free Web Enhancement for Vieled Denizens its monster supplement for Monte Cook's Arcana Evolved.

Assessment of effective parameters on dilution using approximate reasoning methods in longwall mining method, Iran coal mines. (arXiv:0805.1288v1 [cs.AI])

12.05.2008 05:19    arxiv.org
Approximately more than 90% of all coal production in Iranian undergroundmines is derived directly longwall mining method. Out of seam dilution is oneof the essential problems in these mines. Therefore the dilution can impose theadditional cost of mining and milling.

A New Stream Cipher: Dicing. (arXiv:0805.1278v1 [cs.CR])

12.05.2008 05:19    arxiv.org
In this paper, we will propose a new synchronous stream cipher named DICING,which can be viewed as a clock-controlled one but with a new mechanism ofaltering steps. It has satisfactory performance and there have not been foundweakness for the known

Optimal Node Density for Two-Dimensional Sensor Arrays. (arXiv:0805.1262v1 [cs.IT])

12.05.2008 05:19    arxiv.org
The problem of optimal node density for ad hoc sensor networks deployed formaking inferences about two dimensional correlated random fields is considered.Using a symmetric first order conditional autoregressive Gauss-Markov randomfield model, large deviations results are used to characterize the asymptoticper-node

Approximation Algorithms for Shortest Descending Paths in Terrains. (arXiv:0805.1401v1 [cs.CG])

12.05.2008 05:19    arxiv.org
A path from s to t on a polyhedral terrain is descending if the height of apoint p never increases while we move p along the path from s to t. Noefficient algorithm is known to find a shortest descending

Linear Time Algorithm for Weak Parity Games. (arXiv:0805.1391v1 [cs.LO])

12.05.2008 05:19    arxiv.org
We consider games played on graphs with the winning conditions for theplayers specified as weak-parity conditions. In weak-parity conditions thewinner of a play is decided by looking into the set of states appearing in theplay, rather than the set of

A language for mathematical language management. (arXiv:0805.1386v1 [cs.LO])

12.05.2008 05:19    arxiv.org
We argue that the language of Zermelo Fraenkel set theory with definitionsand partial functions provides the most promising bedrock semantics forcommunicating and sharing mathematical knowledge. We then describe a syntacticsugaring of that language that provides a way of writing remarkably

Testability of AND-EXOR Based Iterative Logic Arrays. (arXiv:0805.1293v1 [cs.OH])

12.05.2008 05:19    arxiv.org
Iterative Logic Arrays (ILAs) are ideal as VLSI sub-systems because of theirregular structure and its close resemblance with FPGAs (Field Programmable GateArrays). AND-EXOR based circuits are of interest in the design of very lowpower circuits where energy loss implied by

Physically-Relativized Church-Turing Hypotheses. (arXiv:0805.1292v1 [physics.comp-ph])

12.05.2008 05:19    arxiv.org
We turn `the' Church-Turing Hypothesis from an ambiguous source ofsensational speculations into a (collection of) sound and well-definedscientific problem(s):Examining recent controversies, and causes for misunderstanding, concerningthe state of the Church-Turing Hypothesis (CTH), suggests to study the CTHrelative to an arbitrary

Randomized Work-Competitive Scheduling for Cooperative Computing on $k$-partite Task Graphs. (arXiv:0805.1257v1 [cs.DC])

12.05.2008 05:19    arxiv.org
A fundamental problem in distributed computing is the task of cooperativelyexecuting a given set of $t$ tasks by $p$ processors where the communicationmedium is dynamic and subject to failures. The dynamics of the communicationmedium lead to groups of processors being

Spectrum Allocation in Two-Tier Networks. (arXiv:0805.1226v1 [cs.NI])

12.05.2008 05:19    arxiv.org
Two-tier networks, comprising a conventional cellular network overlaid withshorter range hotspots (e.g. femtocells, distributed antennas, or wiredrelays), offer an economically viable way to improve cellular system capacity.The capacity-limiting factor in such networks is interference. The cross-tierinterference between macrocells and femtocells

Almost-natural proofs. (arXiv:0805.1385v1 [cs.CC])

12.05.2008 05:19    arxiv.org
Razborov and Rudich famously showed that so-called "natural proofs" are notuseful for separating P from NP unless hard pseudorandom number generators donot exist. Their result is widely regarded as a serious barrier to provingstrong lower bounds in circuit complexity theory.By

1 | 2 | 3 »