Items of some interest:

These are my recent Pin​board​.in links:

Items of some interest:

These are my recent Pin​board​.in links:

  • Tar­get Expres­sion Exam­ples — Eureqa Formulize

    ‘The “Tar­get Expres­sion” in the field at the top of the Set Tar­get tab tells For­mulize what type of model to search for. By default, the tar­get expres­sion is an equa­tion where y (or, if there’s no y, what­ever vari­able is in col­umn A) is mod­eled as a func­tion of all other vari­ables. To edit the tar­get expres­sion, click on it, then make the desired alter­ations. Use the spe­cial func­tion f(…) to spec­ify the part of the equa­tion that For­mulize will attempt to fill in; For­mulize will search for the for­mula f(…) using the vari­ables you put inside the parentheses.’

    for­mulize eureqa genetic-​​programming symbolic-​​regression mod­el­ing doc­u­men­ta­tion
  • A New Solu­tion to the Puz­zle of Sim­plic­ity — PhilSci-​​Archive

    “Explain­ing the con­nec­tion, if any, between sim­plic­ity and truth is among the deep­est prob­lems fac­ing the phi­los­o­phy of sci­ence, sta­tis­tics, and machine learn­ing. Say that an effi­cient truth-​​finding method min­i­mizes worst-​​case costs en route to con­verg­ing to the true answer to a the­ory choice prob­lem. Let the costs con­sid­ered include the num­ber of times a false answer is selected, the num­ber of times opin­ion is reversed, and the times at which the rever­sals occur. It is demon­strated that (1)always choos­ing the sim­plest the­ory com­pat­i­ble with expe­ri­ence and (2) hang­ing onto it while it remains sim­plest is both nec­es­sary and suf­fi­cient for efficiency.”

    via:cshalizi occam’s-razor sim­plic­ity model-​​discovery expla­na­tion philosophy-​​of-​​science
  • [1206.4599] A Uni­fied Robust Clas­si­fi­ca­tion Model

    “A wide vari­ety of machine learn­ing algo­rithms such as sup­port vec­tor machine (SVM), min­i­max prob­a­bil­ity machine (MPM), and Fisher dis­crim­i­nant analy­sis (FDA), exist for binary clas­si­fi­ca­tion. The pur­pose of this paper is to pro­vide a uni­fied clas­si­fi­ca­tion model that includes the above mod­els through a robust opti­miza­tion approach. This uni­fied model has sev­eral ben­e­fits. One is that the exten­sions and improve­ments intended for SVM become applic­a­ble to MPM and FDA, and vice versa. Another ben­e­fit is to pro­vide the­o­ret­i­cal results to above learn­ing meth­ods at once by deal­ing with the uni­fied model. We give a sta­tis­ti­cal inter­pre­ta­tion of the uni­fied clas­si­fi­ca­tion model and pro­pose a non-​​convex opti­miza­tion algo­rithm that can be applied to non-​​convex vari­ants of exist­ing learn­ing methods.”

    clas­si­fi­ca­tion algo­rithms lumpers-​​and-​​spliters-​​sittin-​​in-​​a-​​tree
  • CUDA Down­loads | NVIDIA Devel­oper Zone

    This release of the CUDA Toolkit  enables devel­op­ment using GPUs using the Kepler archi­tec­ture, such as the GeForce GTX680. Fea­ture and func­tion­al­ity builds on the foun­da­tion of the CUDA 4.1 release which intro­duced: A new  LLVM-​​based CUDA com­piler 1000+ new image pro­cess­ing func­tions Redesigned Visual Pro­filer with auto­mated per­for­mance analy­sis and inte­grated expert guidance

    CUDA GPU pro­gram­ming library MacOS
  • [1206.2057] Fin­ish­ing Flows Quickly with Pre­emp­tive Scheduling

    “Today’s data cen­ters face extreme chal­lenges in pro­vid­ing low latency. How­ever, fair shar­ing, a prin­ci­ple com­monly adopted in cur­rent con­ges­tion con­trol pro­to­cols, is far from opti­mal for sat­is­fy­ing latency require­ments. We pro­pose Pre­emp­tive Dis­trib­uted Quick (PDQ) flow sched­ul­ing, a pro­to­col designed to com­plete flows quickly and meet flow dead­lines. PDQ enables flow pre­emp­tion to approx­i­mate a range of sched­ul­ing dis­ci­plines. For exam­ple, PDQ can emu­late a short­est job first algo­rithm to give pri­or­ity to the short flows by paus­ing the con­tend­ing flows. PDQ bor­rows ideas from cen­tral­ized sched­ul­ing dis­ci­plines and imple­ments them in a fully dis­trib­uted man­ner, mak­ing it scal­able to today’s data cen­ters. Fur­ther, we develop a mul­ti­path ver­sion of PDQ to exploit path diver­sity. Through exten­sive packet-​​level and flow-​​level sim­u­la­tion, we demon­strate that PDQ sig­nif­i­cantly out­per­forms TCP, RCP and D3 in data cen­ter envi­ron­ments. We fur­ther show that PDQ is sta­ble, resilient to packet loss, and pre­serves nearly all its per­for­mance gains even given inac­cu­rate flow information.”

    queuing-​​models engineering-​​design algo­rithms performance-​​measure nudge-​​targets
  • [1206.2216] Com­plex Sys­tems Sci­ence: Dreams of Uni­ver­sal­ity, Real­ity of Interdisciplinarity

    “Using a large data­base (~ 215 000 records) of rel­e­vant arti­cles, we empir­i­cally study the “com­plex sys­tems” field and its claims to find uni­ver­sal prin­ci­ples apply­ing to sys­tems in gen­eral. The study of ref­er­ences shared by the papers allows us to obtain a global point of view on the struc­ture of this highly inter­dis­ci­pli­nary field. We show that its over­all coher­ence does not arise from a uni­ver­sal the­ory but instead from com­pu­ta­tional tech­niques and fruit­ful adap­ta­tions of the idea of self-​​organization to spe­cific sys­tems. We also find that com­mu­ni­ca­tion between dif­fer­ent dis­ci­plines goes through spe­cific “trad­ing zones”, ie sub-​​communities that cre­ate an inter­face around spe­cific tools (a DNA microchip) or con­cepts (a network).”

    via:cshalizi com­plex­ol­ogy pro­fes­sion­al­iza­tion network-​​theory disappointed-​​by-​​lack-​​of-​​Abbott-​​ref citation-​​networks

Items of some interest:

These are my recent Pin​board​.in links:

  • [1204.4366] Multipath-​​dominant, pulsed doppler analy­sis of rotat­ing blades

    “We present a novel angu­lar fin­ger­print­ing algo­rithm for detect­ing changes in the direc­tion of rota­tion of a tar­get with a mono­sta­tic, sta­tion­ary sonar plat­form. Unlike other approaches, we assume that the target’s cen­troid is sta­tion­ary, and exploit doppler mul­ti­path sig­nals to resolve the oth­er­wise unavoid­able ambi­gu­i­ties that arise. Since the algo­rithm is based on an under­ly­ing dif­fer­en­tial topo­log­i­cal the­ory, it is highly robust to dis­tor­tions in the col­lected data. We demon­strate per­for­mance of this algo­rithm exper­i­men­tally, by exhibit­ing a pulsed doppler sonar col­lec­tion sys­tem that runs on a smart­phone. The per­for­mance of this sys­tem is suf­fi­ciently good to both detect changes in tar­get rota­tion direc­tion using angu­lar fin­ger­prints, and also to form high-​​resolution inverse syn­thetic aper­a­ture images of the target.”

    signal-​​processing algo­rithms radar nudge-​​targets the-​​imperial-​​we
  • [1204.3850] Sim­ple Agents Learn to Find Their Way: An Intro­duc­tion on Map­ping Polygons

    “This paper gives an intro­duc­tion to the prob­lem of map­ping sim­ple poly­gons with autonomous agents. We focus on min­i­mal­is­tic agents that move from ver­tex to ver­tex along straight lines inside a poly­gon, using their sen­sors to gather local obser­va­tions at each ver­tex. Our atten­tion revolves around the ques­tion whether a given con­fig­u­ra­tion of sen­sors and move­ment capa­bil­i­ties of the agents allows them to cap­ture enough data in order to draw con­clu­sions regard­ing the global lay­out of the poly­gon. In par­tic­u­lar, we study the prob­lem of recon­struct­ing the vis­i­bil­ity graph of a sim­ple poly­gon by an agent mov­ing either inside or on the bound­ary of the poly­gon. Our aim is to pro­vide insight about the algo­rith­mic chal­lenges faced by an agent try­ing to map a poly­gon. We present an overview of tech­niques for solv­ing this prob­lem with agents that are equipped with sim­ple sen­so­r­ial capa­bil­i­ties. We illus­trate these tech­niques on exam­ples with sen­sors that mea– sure angles between lines of sight or iden­tify the pre­vi­ous loca­tion. We give an overview over related prob­lems in com­bi­na­to­r­ial geom­e­try as well as graph exploration.”

    agent-​​based algo­rithms nudge-​​targets
  • [1204.4202] Fuzzy Dynam­i­cal Genetic Pro­gram­ming in XCSF

    “A num­ber of rep­re­sen­ta­tion schemes have been pre­sented for use within Learn­ing Clas­si­fier Sys­tems, rang­ing from binary encod­ings to Neural Net­works, and more recently Dynam­i­cal Genetic Pro­gram­ming (DGP). This paper presents results from an inves­ti­ga­tion into using a fuzzy DGP rep­re­sen­ta­tion within the XCSF Learn­ing Clas­si­fier Sys­tem. In par­tic­u­lar, asyn­chro­nous Fuzzy Logic Net­works are used to rep­re­sent the tra­di­tional condition-​​action pro­duc­tion sys­tem rules. It is shown pos­si­ble to use self-​​adaptive, open-​​ended evo­lu­tion to design an ensem­ble of such fuzzy dynam­i­cal sys­tems within XCSF to solve sev­eral well-​​known continuous-​​valued test problems.”

    learning-​​classifier-​​systems genetic-​​programming fuzzy-​​math dynamical-​​control rules-​​learning nudge-​​targets
  • Omni­scient Gen­tle­men of The Atlantic | | Note­book | The Baffler

    “What mys­ti­fied Grove was the asser­tion, voiced by the econ­o­mist Alan Blinder and oth­ers, “that as long as ‘knowl­edge work’ stays in the U.S., it doesn’t mat­ter what hap­pens to fac­tory jobs.” This was not only inhu­mane, Grove declared; it was idiotic.”

    via:cshalizi cor­po­ratism pub­lish­ing social-​​engineering jour­nal­ism they-​​say-​​the-​​best-​​astroturf-​​has-​​no-​​color-​​at-​​all
  • [1204.3293] Effi­ciently decod­ing strings from their shingles

    “Deter­min­ing whether an unordered col­lec­tion of over­lap­ping sub­strings (called shin­gles) can be uniquely decoded into a con­sis­tent string is a prob­lem that lies within the foun­da­tion of a broad assort­ment of dis­ci­plines rang­ing from net­work­ing and infor­ma­tion the­ory through cryp­tog­ra­phy and even genetic engi­neer­ing and lin­guis­tics. We present three per­spec­tives on this prob­lem: a graph the­o­retic frame­work due to Pevzner, an automata the­o­retic approach from our pre­vi­ous work, and a new insight that yields a time-​​optimal stream­ing algo­rithm for deter­min­ing whether a string of $n$ char­ac­ters over the alpha­bet $Sigma$ can be uniquely decoded from its two-​​character shin­gles. Our algo­rithm achieves an over­all time com­plex­ity $Theta(n)$ and space com­plex­ity $O(|Sigma|)$. As an appli­ca­tion, we demon­strate how this algo­rithm can be extended to larger shin­gles for effi­cient string reconciliation.”

    strings algo­rithms computational-​​complexity nudge-​​targets
  • Script­ing News: It’s def­i­nitely a bubble

    “They’re turn­ing uni­ver­si­ties into incu­ba­tors. It’s hap­pen­ing at NYU and Har­vard, two schools I have some famil­iar­ity with. Prob­a­bly every­where else too, to some extent. But I’d guess these two schools are pretty lead­ing edge. Stan­ford has been there for a few generations.”

    bub­ble entrepreneurship-​​as-​​pathology startup-​​culture-​​must-​​die ayup

  • via:cshalizi love­craft humor also-​​the-​​whole-​​zine-​​blog-​​thing
  • CodeMir­ror

    “CodeMir­ror is a JavaScript library that can be used to cre­ate a rel­a­tively pleas­ant edi­tor inter­face for code-​​like con­tent ― com­puter pro­grams, HTML markup, and sim­i­lar. If a mode has been writ­ten for the lan­guage you are edit­ing, the code will be coloured, and the edi­tor will option­ally help you with indentation.”

    javascript edi­tor library toolkit bookphile

Items of some interest:

These are my recent Pin​board​.in links: