“Strat­egy changes are an essen­tial part of evo­lu­tion­ary games. Here we intro­duce a sim­ple rule that, depend­ing on the value of a sin­gle para­me­ter $w$, influ­ences the selec­tion of play­ers that are con­sid­ered as poten­tial sources of the new strat­egy. For pos­i­tive $w$ play­ers with high pay­offs will be con­sid­ered more likely, while for neg­a­tive $w$ the oppo­site holds. Set­ting $w$ equal to zero returns the fre­quently adopted ran­dom selec­tion of the oppo­nent. We find that increas­ing the prob­a­bil­ity of adopt­ing the strat­egy from the fittest player within reach, i.e. set­ting $w$ pos­i­tive, pro­motes the evo­lu­tion of coop­er­a­tion. The robust­ness of this obser­va­tion is tested against dif­fer­ent lev­els of uncer­tainty in the strat­egy adop­tion process and for dif­fer­ent inter­ac­tion net­work. Since the evo­lu­tion to wide­spread defec­tion is tightly asso­ci­ated with coop­er­a­tors hav­ing a lower fit­ness than defec­tors, the fact that pos­i­tive val­ues of $w$ facil­i­tate coop­er­a­tion is quite surprising. …”

“In this work we study a weak Prisoner’s Dilemma game in which both strate­gies and update rules are sub­jected to evo­lu­tion­ary pres­sure. Inter­ac­tions among agents are spec­i­fied by com­plex topolo­gies, and we con­sider both homo­ge­neous and het­ero­ge­neous sit­u­a­tions. We con­sider deter­min­is­tic and sto­chas­tic update rules for the strate­gies, which in turn may con­sider sin­gle links or full con­text when select­ing agents to copy from. Our results indi­cate that the co-​​evolutionary process pre­serves het­ero­ge­neous net­works as a suit­able frame­work for the emer­gence of coop­er­a­tion. Fur­ther­more, on those net­works, the update rule lead­ing to a larger frac­tion of coop­er­a­tion, repli­ca­tor dynam­ics, is selected dur­ing co-evolution.…We con­clude that for a vari­ety of topolo­gies, the fact that the dynam­ics coe­volves with the strate­gies leads in gen­eral to more coop­er­a­tion in the weak Prisoner’s Dilemma game.”

“Dynam­ics of evo­lu­tion­ary games strongly depend on under­ly­ing net­works. We study the coevo­lu­tion­ary prisoner’s dilemma in which play­ers change their local net­works as well as strate­gies (i.e., coop­er­ate or defect). This topic has been increas­ingly explored by many researchers. On the basis of active link­ing dynam­ics [J. M. Pacheco et al., J. Theor. Biol. 243, 437 (2006), J. M. Pacheco et al., Phys. Rev. Lett. 97, 258103 (2006)], we show that coop­er­a­tion is enhanced fairly robustly. In par­tic­u­lar, coop­er­a­tion evolves when the pay­off of the player is nor­mal­ized by the num­ber of neigh­bors; this is not the case in the evo­lu­tion­ary prisoner’s dilemma on sta­tic networks.”

“Bio­log­i­cal net­works of inter­act­ing agents exhibit sim­i­lar topo­log­i­cal prop­er­ties for a wide range of scales, from cel­lu­lar to eco­log­i­cal lev­els, sug­gest­ing the exis­tence of a com­mon evo­lu­tion­ary ori­gin. A gen­eral evo­lu­tion­ary mech­a­nism based on global sta­bil­ity has been pro­posed recently [J I Per­otti, O V Bil­loni, F A Tamarit, D R Chialvo, S A Can­nas, Phys. Rev. Lett. 103, 108701 (2009)]. This mech­a­nism is incor­po­rated into a model of a grow­ing net­work of inter­act­ing agents in which each new agent’s mem­ber­ship in the net­work is deter­mined by the agent’s effect on the network’s global sta­bil­ity. We show that, out of this sta­bil­ity con­straint, sev­eral topo­log­i­cal prop­er­ties observed in bio­log­i­cal net­works emerge in a self orga­nized man­ner. The influ­ence of the sta­bil­ity selec­tion mech­a­nism on the dynam­ics asso­ci­ated to the result­ing net­work is ana­lyzed as well.”

“How do liv­ing cells achieve suf­fi­cient abun­dances of func­tional pro­tein com­plexes while min­i­miz­ing promis­cu­ous non-​​functional inter­ac­tions between their pro­teins? Here we study this prob­lem using a first-​​principle model of the cell whose phe­no­typic traits are directly deter­mined from its genome through bio­phys­i­cal prop­er­ties of pro­tein struc­tures and bind­ing inter­ac­tions in crowded cel­lu­lar envi­ron­ment. The model cell includes three inde­pen­dent path­ways, whose topolo­gies of PPI sub­net­works are dif­fer­ent, but whose func­tional con­cen­tra­tions equally con­tribute to cell’s fit­ness. The model cells evolve through geno­typic muta­tions and phe­no­typic pro­tein copy num­ber vari­a­tions. We found a strong rela­tion­ship between evolved physical-​​chemical prop­er­ties of pro­tein inter­ac­tions and their abun­dances due to a “frus­tra­tion” effect: strength­en­ing of func­tional inter­ac­tions brings about hydropho­bic sur­faces, which make pro­teins prone to promis­cu­ous binding.…”

“We intro­duce the het­ero­ge­neous voter model (HVM), in which each agent has its own intrin­sic rate to change state, reflec­tive of the het­ero­gene­ity of real peo­ple, and the par­ti­san voter model (PVM), in which each agent has an innate and fixed pref­er­ence for one of two pos­si­ble opin­ion states. For the HVM, the time until con­sen­sus is reached is much longer than in the clas­sic voter model. For the PVM in the mean-​​field limit, a pop­u­la­tion evolves to a “self­ish” state, where each agent tends to be aligned with its inter­nal pref­er­ence. For finite pop­u­la­tions, dis­crete fluc­tu­a­tions ulti­mately lead to con­sen­sus being reached in a time that scales expo­nen­tially with pop­u­la­tion size.”

“In this paper we have con­sid­ered a spher­i­cal enve­lope model (so-​​called squirmer) to inves­ti­gate ener­get­ics in cilia dynam­ics and loco­mo­tion. Allow­ing only tan­gen­tial but time-​​periodic defor­ma­tions, we have used an opti­miza­tion method based on a vari­a­tional approach to derive com­pu­ta­tion­ally the stroke lead­ing to the largest swim­ming effi­ciency. The opti­mal stroke was shown to dis­play weak Lagrangian asym­me­try, but strong Euler­ian asym­me­try, indica­tive of symmetry-​​breaking at the whole-​​organism level, but not at the level of indi­vid­ual cilia.…”

“Linux pack­age man­agers have to deal with depen­den­cies and con­flicts of pack­ages required to be installed by the user. As an NP-​​complete prob­lem, this is a hard task to solve. In this con­text, sev­eral approaches have been pur­sued. Apt-​​pbo is a pack­age man­ager based on the apt project that encodes the depen­dency solv­ing prob­lem as a pseudo-​​Boolean opti­miza­tion (PBO) prob­lem. This paper com­pares dif­fer­ent PBO solvers and their effec­tive­ness on solv­ing the depen­dency solv­ing problem.”

“The prob­lem the pat­tern attempts to solve: iden­tify the URLs in an arbi­trary string of text, where by “arbi­trary” let’s agree we mean some­thing unstruc­tured such as an email mes­sage or a tweet.”

“We have embarked on a research pro­gram designed to develop uni­ver­sal mod­els that can recre­ate empiri– cally observed phe­nom­ena in dynamic com­plex net­works. We have shown that, using a suit­able rein­forced ran­dom walk on a “long-​​term” under­lay net­work, one is able to pro­duce instan­ta­neous net­works which repro­duce qual­i­ta­tively char­ac­ter­is­tic fea­tures of real world dynamic net­works. This includes, in par­tic­u­lar, the con­struc– tion of scale-​​free sub-​​networks of a scale-​​free “under­lay” net­work, whose local hubs sub­stan­tially dif­fer from sub– net­work to sub-​​network and from those of the underlay.…”

“…For cyclic games with two play­ers and three strate­gies, we show that the result­ing deter­min­is­tic dynam­ics cru­cially depends on the ini­tial con­di­tion in a non–trivial way.”

“The tran­si­tion of the flow in a duct of square cross-​​section is stud­ied. Like in the sim­i­lar case of the pipe flow, the motion is lin­early sta­ble for all Reynolds num­bers; this flow is thus a good can­di­date to inves­ti­gate the ‘bypass’ path to tur­bu­lence. Ini­tially the so-​​called ‘lin­ear opti­mal per­tur­ba­tion prob­lem’ is for­mu­lated and solved, yield­ing opti­mal dis­tur­bances in the form of lon­gi­tu­di­nal vor­tices. Such opti­mals, how­ever, fail to elicit a sig­nif­i­cant response from the sys­tem in the non­lin­ear regime. Thus, streamwise-​​inhomogeneous, sub-​​optimal dis­tur­bances are focussed upon; non­lin­ear qua­dratic inter­ac­tions are imme­di­ately evoked by such ini­tial per­tur­ba­tions and an unsta­ble streamwise-​​homogeneous large ampli­tude mode rapidly emerges. The sub­se­quent evo­lu­tion of the flow, at a value of the Reynolds num­ber at the edge between fully devel­oped tur­bu­lence and relam­i­nar­iza­tion, shows the alter­nance of pat­terns with two pairs of large scale vor­tices near oppos­ing par­al­lel walls.…”

“The mod­el­ing of com­plex sys­tems such as eco­log­i­cal or socio-​​economic sys­tems can be very chal­leng­ing. Although var­i­ous mod­el­ing approaches exist, they are gen­er­ally not com­pat­i­ble and mutu­ally con­sis­tent, and empir­i­cal data often do not allow one to decide what model is the right one, the best one, or most appro­pri­ate one. More­over, as the recent finan­cial and eco­nomic cri­sis shows, rely­ing on a sin­gle, ide­al­ized model can be very costly. This con­tri­bu­tion tries to shed new light on prob­lems that arise when com­plex sys­tems are mod­eled. While the argu­ments can be trans­ferred to many dif­fer­ent sys­tems, the related sci­en­tific chal­lenges are illus­trated for social, eco­nomic, and traf­fic sys­tems. The con­tri­bu­tion dis­cusses issues that are some­times over­looked and tries to over­come some fre­quent mis­un­der­stand­ings and con­tro­ver­sies of the past.…”

“We address the prob­lem of esti­mat­ing unknown model para­me­ters and state vari­ables in sto­chas­tic reac­tion processes when only sparse and noisy mea­sure­ments are avail­able. Using an asymp­totic sys­tem size expan­sion for the back­ward equa­tion we derive an effi­cient approx­i­ma­tion for this prob­lem. We demon­strate the valid­ity of our approach on model sys­tems and gen­er­al­ize our method to the case when some state vari­ables are not observed.”

“While the con­cept of clus­ters arises when view­ing qua­sicrys­talline sur­faces at close range, long range qua­si­peri­odic order as seen in dif­frac­tion stud­ies is per­haps more nat­u­rally described in terms of qua­si­peri­odic tilings. These are the analogs of the “Bra­vais lat­tices” for peri­odic sys­tems, and give a good descrip­tion of the ori­en­ta­tional order and posi­tional long range order seen in qua­sicrys­tal dif­frac­tion pat­terns. Tilings are con­structed from a small num– ber of tiles arranged so as to avoid over­lap­ping or holes. Qua­si­peri­odic tilings usu­ally pos­sess a hier­ar­chi­cally organ­ised struc­ture, where tilings can be ”in– flated”(”deflated”) so as to obtain a sim­i­lar tiling on a larger(smaller) length scale.”

“Much recent inter­est has focused on “open” dynam­i­cal sys­tems, in which a clas­si­cal map or flow is con­sid­ered only until the tra­jec­tory reaches a “hole”, at which the dynam­ics is no longer con­sid­ered. Here we con­sider ques­tions per­tain­ing to the sur­vival prob­a­bil­ity as a func­tion of time, given an ini­tial mea­sure on phase space. We focus on the case of bil­liard dynam­ics, namely that of a point par­ti­cle mov­ing with con­stant veloc­ity except for mirror-​​like reflec­tions at the bound­ary, and give a num­ber of recent results, phys­i­cal appli­ca­tions and open problems.”

“Stor­age opti­miza­tion in dis­trib­uted envi­ron­ments is a major con­cern when talk­ing about reli­a­bil­ity in this kind of schemes. Although repli­ca­tion is the most used option, era­sure cod­ing is a more opti­mized one.
How­ever, era­sure cod­ing uses a lot of band­width to replace one node. In a dynamic scheme, where nodes enter and leave the sys­tem fre­quently, band­width use could be an impor­tant draw­back.
Regen­er­at­ing Codes intro­duced by Dimakis et al. min­i­mize the code repair prob­lem by apply­ing Net­work Cod­ing to the dis­trib­uted stor­age scheme. How­ever find­ing the coef­fi­cients for the lin­ear com­bi­na­tions used to replace a node is not easy, spe­cially for the sys­tem­atic case, and must be cal­cu­lated for each new node fail.…”

“In this paper, we per­form a min­i­mal­is­tic quan­ti­za­tion of the clas­si­cal game of tic-​​tac-​​toe, by allow­ing super­po­si­tions of clas­si­cal moves. In order for the quan­tum game to reduce prop­erly to the clas­si­cal game, we require legal quan­tum moves to be orthog­o­nal to all pre­vi­ous moves. We also admit inter­fer­ence effects, by squar­ing the sum of ampli­tudes over all moves by a player to com­pute his or her occu­pa­tion level of a given site. A player wins when the sums of occu­pa­tions along any of the eight straight lines we can draw in the $3 \times 3$ grid is greater than three.…”

“Actual account­ing sys­tems are based on trans­ac­tions. But in the cur­rent, knowledge-​​based econ­omy much of the value cre­ation pre­cedes, some­times by years, the occur­rence of trans­ac­tions. Until then, the account­ing sys­tem does not reg­is­ter any value cre­ated in con­trast to the invest­ments made into R&D, which are fully expensed. This dif­fer­ence, between how the account­ing sys­tem is han­dling value cre­ated and is han­dling invest­ments into value cre­ation, is the major rea­son for the grow­ing dis­con­nect between mar­ket val­ues and finan­cial information.”

Makes me want to write a sim­ple agent-​​based model in which a few peo­ple have almost all the money and most every­body else are allowed to move a bit around, for a fee.

“This is a short com­men­tary piece that dis­cusses how the meth­ods used in the nat­ural sci­ences can apply to eco­nom­ics in gen­eral and finan­cial mar­kets specifically.”

“In real com­mu­ni­ca­tion and trans­porta­tion net­works, the geo­graph­i­cal posi­tions of nodes are very impor­tant for the effi­ciency and the tol­er­ance of con­nec­tiv­ity. Con­sid­er­ing spa­tially inho­mo­ge­neous posi­tions of nodes accord­ing to a pop­u­la­tion, we intro­duce a multi-​​scale quar­tered (MSQ) net­work that is sto­chas­ti­cally con­structed by recur­sive sub­di­vi­sion of polyg­o­nal faces as a self-​​similar tiling. It has sev­eral advan­tages: the robust­ness of con­nec­tiv­ity, the bounded short path lengths, and the short­est dis­tance rout­ing algo­rithm in a dis­trib­u­tive man­ner. Fur­ther­more, we show that the MSQ net­work is more effi­cient with shorter link lengths and more suit­able with lower load for avoid­ing traf­fic con­ges­tion than other geo­graph­i­cal net­works which have var­i­ous topolo­gies rang­ing from river to scale-​​free net­works. These results will be use­ful for pro­vid­ing an insight into the future design of ad hoc net­work infrastructures.”

“We describe com­puter algo­rithms that pro­duce the com­plete set of iso­he­dral tilings by n-​​omino or n-​​iamond tiles in which the tiles are fun­da­men­tal domains and the tilings have 3-​​, 4-​​, or 6-​​fold rota­tional sym­me­try. The sym­me­try groups of such tilings are of types p3, p31m, p4, p4g, and p6. There are no iso­he­dral tilings with sym­me­try groups p3m1, p4m, or p6m that have poly­omi­noes or polyi­a­monds as fun­da­men­tal domains. We dis­play the algo­rithms’ out­put and give enu­mer­a­tion tables for small val­ues of n.…”

I ♡ prag­matic physics. “We pro­pose a sim­ple rub­ber fric­tion law, which can be used, e.g., in mod­els of tire (and vehi­cle) dynamics.”

“It fea­tures generic data abstrac­tion through Col­lec­tions, a Visu­al­iza­tion API allow­ing the cre­ation of plug­gable visu­al­iza­tions, and a Scene Graph imple­men­ta­tion on top of HTML 5 Can­vas. See the GitHub project, the doc­u­men­ta­tion, and an example.”

“For a set of n points in the plane, we con­sider the axis–aligned (p,k)-Box Cov­er­ing prob­lem: Find p axis-​​aligned, pairwise-​​disjoint boxes that together con­tain n-​​k points. In this paper, we con­sider the boxes to be either squares or rec­tan­gles, and we want to min­i­mize the area of the largest box. For gen­eral p we show that the prob­lem is NP-​​hard for both squares and rec­tan­gles. For a small, fixed num­ber p, we give algo­rithms that find the solu­tion in the fol­low­ing run­ning times:
For squares we have O(n+k log k) time for p=1, and O(n log n+k^p log^p k time for p = 2,3. For rec­tan­gles we get O(n + k^3) for p = 1 and O(n log n+k^{2+p} log^{p-1} k) time for p = 2,3. In all cases, our algo­rithms use O(n) space.”

“We study the prob­lem of recon­struct­ing a sparse sig­nal from a lim­ited num­ber of its lin­ear pro­jec­tions when a part of its sup­port is known, although the known part may con­tain some errors. The “known” part of the sup­port, denoted T, may be avail­able from prior knowl­edge. Alter­na­tively, in a prob­lem of recur­sively recon­struct­ing time sequences of sparse spa­tial sig­nals, one may use the sup­port esti­mate from the pre­vi­ous time instant as the “known” part. The idea of our pro­posed solu­tion (modified-​​CS) is to solve a con­vex relax­ation of the fol­low­ing prob­lem: find the sig­nal that sat­is­fies the data con­straint and is spars­est out­side of T.…”

“We present a form of alge­braic rea­son­ing for com­pu­ta­tional objects which are expressed as graphs. Edges describe the flow of data between prim­i­tive oper­a­tions which are rep­re­sented by ver­tices. These graphs have an inter­face made of half-​​edges (edges which are drawn with an uncon­nected end) and enjoy rich com­po­si­tional prin­ci­ples by con­nect­ing graphs along these half-​​edges. In par­tic­u­lar, this allows equa­tions and rewrite rules to be spec­i­fied between graphs. Par­tic­u­lar com­pu­ta­tional mod­els can then be encoded as an axiomatic set of such rules. Fur­ther rules can be derived graph­i­cally and rewrit­ing can be used to sim­u­late the dynam­ics of a com­pu­ta­tional sys­tem, e.g. eval­u­at­ing a pro­gram on an input. Exam­ples of mod­els which can be for­malised in this way include tra­di­tional elec­tronic cir­cuits as well as recent cat­e­gor­i­cal accounts of quan­tum information.”

“This expos­i­tory review is devoted to fish swim­ming and bird/​insect flight.…”

“We ana­lyze over 500 mil­lion Twit­ter mes­sages from an eight month period and find that track­ing a small num­ber of flu-​​related key­words allows us to fore­cast future influenza rates with high accu­racy, obtain­ing a 95% cor­re­la­tion with national health sta­tis­tics. We then ana­lyze the robust­ness of this approach to spu­ri­ous key­word matches, and we pro­pose a doc­u­ment clas­si­fi­ca­tion com­po­nent to fil­ter these mis­lead­ing mes­sages. We find that this doc­u­ment clas­si­fier can reduce error rates by over half in sim­u­lated false alarm exper­i­ments, though more research is needed to develop meth­ods that are robust in cases of extremely high noise.”

“We pro­pose a degree-​​based coarse grain­ing approach that not just accel­er­ates the eval­u­a­tion of dynam­ics on com­plex net­works, but also sat­is­fies the con­sis­tency con­di­tions for both equi­lib­rium sta­tis­ti­cal dis­tri­b­u­tions and non­equi­lib­rium dynam­i­cal flows. For the Ising model and susceptible-​​infected-​​susceptible epi­demic model, we intro­duce these required con­di­tions explic­itly and fur­ther prove that they are sat­is­fied by our coarse-​​grained net­work con­struc­tion within the annealed net­work approx­i­ma­tion. Finally, we numer­i­cally show that the phase tran­si­tions and fluc­tu­a­tions on the coarse-​​grained net­work are all in good agree­ments with those on the orig­i­nal one.”

“Bac­te­ria are the unseen major­ity on our planet, with mil­lions of species and com­pris­ing most of the liv­ing pro­to­plasm. While cur­rent meth­ods enable in-​​depth study of a small num­ber of com­mu­ni­ties, a sim­ple tool for breadth stud­ies of bac­te­r­ial pop­u­la­tion com­po­si­tion in a large num­ber of sam­ples is lack­ing. We pro­pose a novel approach for recon­struc­tion of the com­po­si­tion of an unknown mix­ture of bac­te­ria using a sin­gle Sanger-​​sequencing reac­tion of the mix­ture. This method is based on com­pres­sive sens­ing the­ory, which deals with recon­struc­tion of a sparse sig­nal using a small num­ber of mea­sure­ments. Uti­liz­ing the fact that in many cases each bac­te­r­ial com­mu­nity is com­prised of a small sub­set of the known bac­te­r­ial species, we show the fea­si­bil­ity of this approach for deter­min­ing the com­po­si­tion of a bac­te­r­ial mixture.…”

“The Fermi Para­dox is the appar­ent con­tra­dic­tion between the high prob­a­bil­ity extrater­res­trial civ­i­liza­tions’ exis­tence and the lack of con­tact with such civ­i­liza­tions. In gen­eral, solu­tions to Fermi’s para­dox come down to either esti­ma­tion of Drake equa­tion para­me­ters i.e. our guesses about the poten­tial num­ber of extrater­res­trial civ­i­liza­tions or sim­u­la­tion of civ­i­liza­tions devel­op­ment in the uni­verse. We con­sider a new type of cel­lu­lar automata, that allows to ana­lyze Fermi para­dox. We intro­duce bonus stim­u­la­tion model (BS-​​model) of devel­op­ment in cel­lu­lar space (Uni­verse) of objects (Civ­i­liza­tions). When civ­i­liza­tions get in touch they stim­u­late devel­op­ment each other, increas­ing their life time. We dis­cov­ered non­lin­ear thresh­old behav­iour of total vol­ume of civ­i­liza­tions in uni­verse and on the basis of our model we built ana­logue of Drake equation.”

“In this paper, we inves­ti­gate a con­jec­ture by von Hae­seler con­cern­ing the Max­i­mum Par­si­mony method for phy­lo­ge­netic esti­ma­tion, which was pub­lished by the New­ton Insti­tute in Cam­bridge on a list of open phy­lo­ge­netic prob­lems in 2007. This con­jec­ture deals with the ques­tion whether Max­i­mum Par­si­mony trees are hered­i­tary. The con­jec­ture sug­gests that a Max­i­mum Par­si­mony tree for a par­tic­u­lar (DNA) align­ment nec­es­sar­ily has sub­trees of all pos­si­ble sizes which are most par­si­mo­nious for the cor­re­spond­ing sub­align­ments. We answer the con­jec­ture affir­ma­tively for binary align­ments on five taxa but also show how to con­struct exam­ples for which Max­i­mum Par­si­mony trees are not hered­i­tary. …we also show that com­pat­i­ble most par­si­mo­nious quar­tets do not have to pro­vide a most par­si­mo­nious supertree. Last, we show that our results can be gen­er­al­ized to Max­i­mum Like­li­hood for cer­tain nucleotide sub­sti­tu­tion models.”

“Lab­o­ra­tory inves­ti­ga­tions have shown that a for­mal the­ory of fault-​​tolerance will be essen­tial to har­ness nanoscale self-​​assembly as a medium of com­pu­ta­tion. Sev­eral researchers have voiced an intu­ition that self-​​assembly phe­nom­ena are related to the field of dis­trib­uted com­put­ing. This paper for­mal­izes some of that intu­ition. We con­struct tile assem­bly sys­tems that are able to sim­u­late the solu­tion of the wait-​​free con­sen­sus prob­lem in some dis­trib­uted sys­tems. (For poten­tial future work, this may allow bind­ing errors in tile assem­bly to be ana­lyzed, and man­aged, with pos­i­tive results in dis­trib­uted com­put­ing, as a “block­age” in our tile assem­bly model is anal­o­gous to a crash fail­ure in a dis­trib­uted com­put­ing model.) …We show that solu­tion of this strength­ened con­sen­sus prob­lem can be sim­u­lated by a two-​​dimensional tile assem­bly model only for two processes, whereas a three-​​dimensional tile assem­bly model can sim­u­late its solu­tion in a dis­trib­uted sys­tem with any num­ber of processes

“Genetic oscil­la­tors are a major theme of inter­est in the emerg­ing field of syn­thetic biol­ogy. Until recently, most work has been car­ried out using intra-​​cellular oscil­la­tors, but this approach restricts the broader applic­a­bil­ity of such sys­tems. Moti­vated by a desire to develop large-​​scale, spatially-​​distributed cell-​​based com­pu­ta­tional sys­tems, we present an ini­tial design for a population-​​level oscil­la­tor which uses three dif­fer­ent bac­te­r­ial strains. Our sys­tem is based on the client-​​server model famil­iar to com­puter sci­ence, and uses quo­rum sens­ing for com­mu­ni­ca­tion between nodes. We present the results of exten­sive in sil­ico sim­u­la­tion tests, which con­firm that our design is both fea­si­ble and robust.”

Frankly, I’ve alway thought this, espe­cially after some early “con­fus­ing” exper­i­ments that never got pub­lished because they were part of my first Ph.D. the­sis research: “…We argue that the pres­ence of only the frozen phase in the work of Kauff­man et al. was due sim­ply to the spe­cific param­e­triza­tion used, and is not an inher­ent fea­ture of this class of func­tions. How­ever, these net­works are sig­nif­i­cantly more sta­ble than the vari­ants where all pos­si­ble Boolean func­tions are allowed.”

“These are not the only com­ments posted to A2Politico that have gone into the ether. I’ve received emails from read­ers who say they’ve posted cor­rec­tions to Lesko’s state­ments, links to sites that dis­prove her claims, and even links to sto­ries she very selec­tively cites from. All have been deleted Soviet-​​style.…”

“Search engines today present results that are often obliv­i­ous to abrupt shifts in intent. For exam­ple, the query ‘inde­pen­dence day’ usu­ally refers to a US hol­i­day, but the intent of this query abruptly changed dur­ing the release of a major film by that name. … This paper shows that the sig­nals a search engine receives can be used to both deter­mine that a shift in intent has hap­pened, as well as find a result that is now more rel­e­vant. We present a meta-​​algorithm that mar­ries a clas­si­fier with a ban­dit algo­rithm to achieve regret that depends log­a­rith­mi­cally on the num­ber of query impres­sions, under cer­tain assump­tions. We pro­vide strong evi­dence that this regret is close to the best achiev­able. Finally, via a series of exper­i­ments, we demon­strate that our algo­rithm out­per­forms prior approaches, par­tic­u­larly as the amount of intent-​​shifting traf­fic increases.”

“We give a space-​​optimal algo­rithm with update time O(log^2(1/eps)loglog(1/eps)) for (1+eps)-approximating the pth fre­quency moment, 0 < p < 2, of a length-​​n vec­tor updated in a data stream. This pro­vides a nearly expo­nen­tial improve­ment in the update time com­plex­ity over the pre­vi­ous space-​​optimal algo­rithm of [Kane-​​Nelson-​​Woodruff, SODA 2010], which had update time Omega(1/eps^2).”

“We intro­duced an effec­tive algo­rithm for k-​​nearest neigh­bor prob­lem which works on mul­ti­ple GPUs. By an exper­i­ment, we have shown that it runs more than 330 times faster than an imple­men­ta­tion on a sin­gle core of an up-​​to-​​date CPU. We have also shown that the algo­rithm is effec­tive from the view­point of par­al­lelism of GPUs. That is because 1) there is no syn­chro­niza­tion between GPUs until the very end of the process and 2) the work­load is well balanced.”

“Many com­put­er­ized meth­ods for RNA-​​RNA inter­ac­tion struc­ture pre­dic­tion have been devel­oped. Recently, $O(N^6)$ time and $O(N^4)$ space dynamic pro­gram­ming algo­rithms have become avail­able that com­pute the par­ti­tion func­tion of RNA-​​RNA inter­ac­tion com­plexes. How­ever, few of these meth­ods incor­po­rate the knowl­edge con­cern­ing related sequences, thus rel­e­vant evo­lu­tion­ary infor­ma­tion is often neglected from the struc­ture deter­mi­na­tion. There­fore, it is of con­sid­er­able prac­ti­cal inter­est to intro­duce a method tak­ing into con­sid­er­a­tion both ther­mo­dy­namic sta­bil­ity and sequence covari­a­tion. We present the \emph{a pri­ori} fold­ing algo­rithm \texttt{ripalign}, whose input con­sists of two (given) mul­ti­ple sequence align­ments (MSA). \texttt{ripalign} out­puts (1) the par­ti­tion func­tion, (2) base-​​pairing prob­a­bil­i­ties, (3) hybrid prob­a­bil­i­ties and (4) a set of Boltzmann-​​sampled sub­op­ti­mal struc­tures con­sist­ing of canon­i­cal joint struc­tures that are com­pat­i­ble to the alignments.…”

“A new floating-​​point arith­metic called pre­ci­sion arith­metic is devel­oped to track pre­ci­sion for arith­metic cal­cu­la­tions. It uses a novel round­ing scheme to avoid exces­sive round­ing error prop­a­ga­tion of con­ven­tional floating-​​point arith­metic. Unlike inter­val arith­metic, its uncer­tainty track­ing is based on sta­tis­tics and its bound­ing range is much tighter. Generic stan­dards and sys­tem­atic meth­ods for val­i­dat­ing uncertainty-​​bearing arith­metics are dis­cussed. The pre­ci­sion arith­metic is found to be bet­ter than inter­val arith­metic in uncertainty-​​tracking for lin­ear algorithms. ”

“We pro­vide sev­eral basic results. We obtain an effi­cient algo­rithm for deter­min­ing the heapa– bil­ity of a sequence, and also prove that the ques­tion of whether a sequence can be arranged in a com­plete binary heap is NP-​​hard. Regard­ing sub­se­quences we show that, with high prob­a­bil­ity, the longest hea­pable sub­se­quence of a ran­dom per­mu­ta­tion of n num­bers has length (1 − o(1))n, and a sub­se­quence of length (1 − o(1))n can in fact be found online with high prob­a­bil­ity. We sim­i­larly show that for a ran­dom per­mu­ta­tion a sub­se­quence that yields a com­plete heap of size αn for a con­stant α can be found with high prob­a­bil­ity. Our work high­lights the inter­est­ing struc­ture under­ly­ing this class of sub­se­quence prob­lems, and we leave many fur­ther inter­est­ing vari­a­tions open for future work.”

“This paper intro­duces the the­ory and prac­tice of for­mal ver­i­fi­ca­tion of self-​​assembling sys­tems. We inter­pret a well-​​studied abstrac­tion of nanomol­e­c­u­lar self assem­bly, the Abstract Tile Assem­bly Model (aTAM), into Com­pu­ta­tion Tree Logic (CTL), a tem­po­ral logic often used in model check­ing. We then con­sider the class of “rec­ti­lin­ear” tile assem­bly sys­tems. This class includes most aTAM sys­tems stud­ied in the the­o­ret­i­cal lit­er­a­ture, and all (algo­rith­mic) DNA tile self-​​assembling sys­tems that have been real­ized in lab­o­ra­to­ries to date. We present a polynomial-​​time algo­rithm that, given a tile assem­bly sys­tem T as input, either pro­vides a coun­terex­am­ple to T’s rec­ti­lin­ear­ity or ver­i­fies whether T has a unique ter­mi­nal assembly. …”

“Here are some thoughts on using exist­ing sta­tis­ti­cal soft­ware for bet­ter ana­lyt­ics and/​or busi­ness intel­li­gence (reporting)…”

“There­fore, the under­ly­ing demand curve is dif­fer­ent today — so it isn’t log­i­cal to expect val­u­a­tion met­rics of the mar­ket to be repro­duced today — sans very extreme mar­ket events, which would need to last a con­sid­er­able period of time.”

Book Thing design

Answer Fac­tory design

Answer Fac­tory design

Answer Fac­tory design

“The Den­dritic Cell Algo­rithm (DCA) is inspired by the func­tion of the den­dritic cells of the human immune sys­tem. In nature, den­dritic cells are the intru­sion detec­tion agents of the human body, polic­ing the tis­sue and organs for poten­tial invaders in the form of pathogens. In this research, and abstract model of DC behav­iour is devel­oped and sub­se­quently used to form an algo­rithm, the DCA. The abstrac­tion process was facil­i­tated through close col­lab­o­ra­tion with lab­o­ra­tory– based immu­nol­o­gists, who per­formed bespoke exper­i­ments, the results of which are used as an inte­gral part of this algo­rithm. The DCA is a pop­u­la­tion based algo­rithm, with each agent in the sys­tem rep­re­sented as an ‘arti­fi­cial DC’. Each DC has the abil­ity to com­bine mul­ti­ple data streams and can add con­text to data sus­pected as anomalous.…”

“Retriev­ing images from large and var­ied repos­i­to­ries using visual con­tents has been one of major research items, but a chal­leng­ing task in the image man­age­ment com­mu­nity. In this paper we present an effi­cient approach for region-​​based image clas­si­fi­ca­tion and retrieval using a fast multi-​​level neural net­work model. The advan­tages of this neural model in image clas­si­fi­ca­tion and retrieval domain will be high­lighted. The pro­posed approach accom­plishes its goal in three main steps. First, with the help of a mean-​​shift based seg­men­ta­tion algo­rithm, sig­nif­i­cant regions of the image are iso­lated. Sec­ondly, color and tex­ture fea­tures of each region are extracted by using color moments and 2D wavelets decom­po­si­tion tech­nique. Thirdly the multi-​​level neural clas­si­fier is trained in order to clas­sify each region in a given image into one of five pre­de­fined cat­e­gories, i.e., “Sky”, “Build­ing”, “Sand­nRock”, “Grass” and “Water”. …”

“The study of evo­lu­tion of net­works has received increased inter­est with the recent dis­cov­ery that many real-​​world net­works pos­sess many things in com­mon, in par­tic­u­lar the man­ner of evo­lu­tion of such net­works. By adding a dimen­sion of time to graph analy­sis, evolv­ing graphs present oppor­tu­ni­ties and chal­lenges to extract valu­able infor­ma­tion. This paper intro­duces the Evolv­ing Graph Markup Lan­guage (EGML), an XML appli­ca­tion for rep­re­sent­ing evolv­ing graphs and related results. Along with EGML, a soft­ware tool is pro­vided for the study of evolv­ing graphs. New evolv­ing graph draw­ing tech­niques based on the force-​​directed graph lay­out algo­rithm are also explored. Our evolv­ing graph tech­niques reduce ver­tex move­ments between graph instances, so that an evolv­ing graph can be viewed with smooth transitions”

“One of the most visu­ally demon­stra­ble and straight­for­ward uses of fil­ter­ing is in the field of Com­puter Vision. In this doc­u­ment we will try to out­line the issues encoun­tered while design­ing and imple­ment­ing a par­ti­cle and kalman fil­ter based track­ing system.”

“The econ­omy has started cre­at­ing jobs—albeit at a slow rate—in recent months. But those with new master’s degrees often aren’t at the front of the line to get them, say experts. One rea­son: They fre­quently com­pete for jobs that require those advanced degrees with older work­ers who have the advan­tage of more work experience.”

“In this paper, a sim­ple Neural con­troller has been used to achieve sta­ble walk­ing in a NAO biped robot, with 22 degrees of free­dom that imple­mented in a vir­tual physics-​​based sim­u­la­tion envi­ron­ment of Robocup soc­cer sim­u­la­tion envi­ron­ment. The algo­rithm uses a Mat­suoka base neural oscil­la­tor to gen­er­ate con­trol sig­nal for the biped robot. To find the best angu­lar tra­jec­tory and opti­mize net­work para­me­ters, a new population-​​based search algo­rithm, called the Har­mony Search (HS) algo­rithm, has been used. The algo­rithm con­cep­tu­al­ized a group of musi­cians together try­ing to search for bet­ter state of har­mony. Sim­u­la­tion results demon­strate that the mod­i­fi­ca­tion of the step period and the walk­ing motion due to the sen­sory feed­back sig­nals improves the sta­bil­ity of the walk­ing motion.”

“Want to kill your firm quickly? Then study the cur­rent issue of Har­vard Busi­ness Review. Imbibe its phi­los­o­phy, its atti­tudes and its val­ues. Imple­ment every­thing it says. In so doing, you will be well on the way to turn­ing your orga­ni­za­tion into a fully-​​fledged 20^th Cen­tury orga­ni­za­tion, with a life expectancy of around 5–10 years.”

seems like some­thing to look at

“We have described three types of geo­met­ric object that have nat­ural encod­ings as reg­u­lar label­ings of a max­i­mal or near-​​maximal pla­nar graph. Although much about these label­ings is known, there are still many ques­tions remaining:…”

“We study the phase behav­ior of bowl-​​shaped par­ti­cles using com­puter sim­u­la­tions. These par­ti­cles were found exper­i­men­tally to form a meta-​​stable worm-​​like fluid phase in which the bowl-​​shaped par­ti­cles have a strong ten­dency to stack on top of each other [M.Marechal et al, Nano Let­ters 10, 1907 (2010)]. In this work, we show that the tran­si­tion from the low-​​density fluid to the worm-​​like phase has an inter­est­ing effect on the equa­tion of state. The sim­u­la­tion results also show that the worm-​​like fluid phase trans­forms spon­ta­neously into a colum­nar phase for bowls that are suf­fi­ciently deep. Fur­ther­more, we describe the phase behav­ior as obtained from free energy cal­cu­la­tions employ­ing Monte Carlo sim­u­la­tions. The colum­nar phase is sta­ble for bowl shapes rang­ing from infi­nitely thin bowls to sur­pris­ingly shal­low bowls. … the phase dia­gram fea­tures four novel crys­tal phases and a region where the sta­ble fluid con­tains worm-​​like stacks.”

“… We have devel­oped a novel method of study­ing the melt­ing of RNAs with tem­per­a­ture by com­pu­ta­tion­ally sam­pling the dis­tri­b­u­tion of the RNA struc­tures at var­i­ous tem­per­a­tures using the RNA fold­ing soft­ware Vienna. In this study, we com­pared the ther­mosens­ing prop­erty of 100 ran­domly selected mRNAs and three well known thermometers…”

“We study sev­eral prob­lems related to find­ing reset words in deter­min­is­tic finite automata. In par­tic­u­lar, we estab­lish that the prob­lem of decid­ing whether a short­est reset word has length k is com­plete for the com­plex­ity class DP. This result answers a ques­tion posed by Volkov. For the search prob­lems of find­ing a short­est reset word and the length of a short­est reset word, we estab­lish mem­ber­ship in the com­plex­ity classes FP^NP and FP^NP[log], respec­tively. More­over, we show that both these prob­lems are hard for FP^NP[log]. Finally, we observe that com­put­ing a reset word of a given length is FNP-​​complete.”

“Here we pro­pose a generic mech­a­nism — net­worked buffer­ing — for gen­er­at­ing robust traits in com­plex sys­tems that requires two basic con­di­tions to be sat­is­fied: 1) agents are ver­sa­tile enough to per­form more than one sin­gle func­tional role within a sys­tem and 2) agents are degen­er­ate, i.e. there exists par­tial over­lap in the func­tional capa­bil­i­ties of agents. Given these pre­req­ui­sites, degen­er­ate sys­tems can read­ily pro­duce a dis­trib­uted sys­temic response to local per­tur­ba­tions. Rec­i­p­ro­cally, excess resources related to a sin­gle func­tion can indi­rectly sup­port mul­ti­ple unre­lated func­tions within a degen­er­ate system.…”

“This paper presents a com­plex sys­tems overview of a power grid net­work. In recent years, con­cerns about the robust­ness of the power grid have grown because of sev­eral cas­cad­ing out­ages in dif­fer­ent parts of the world. In this paper, cas­cad­ing effect has been sim­u­lated on three dif­fer­ent net­works, the IEEE 300 bus test sys­tem, the IEEE 118 bus test sys­tem, and the WSCC 179 bus equiv­a­lent model, using the DC Power Flow Model. Power Degra­da­tion has been dis­cussed as a mea­sure to esti­mate the dam­age to the net­work, in terms of load loss and node loss. A net­work gen­er­a­tor has been devel­oped to gen­er­ate graphs with char­ac­ter­is­tics sim­i­lar to the IEEE stan­dard net­works and the gen­er­ated graphs are then … have been suggested.”

“We apply mul­ti­ple test­ing pro­ce­dures to the val­i­da­tion of esti­mated default prob­a­bil­i­ties in credit rat­ing sys­tems. The goal is to iden­tify rat­ing classes for which the prob­a­bil­ity of default is esti­mated inac­cu­rately, while still main­tain­ing a pre­de­fined level of com­mit­ting type I errors as mea­sured by the fam­i­ly­wise error rate (FWER) and the false dis­cov­ery rate (FDR). For FWER, we also con­sider pro­ce­dures that take pos­si­ble dis­crete­ness of the data resp. test sta­tis­tics into account. The per­for­mance of these meth­ods is illus­trated in a sim­u­la­tion set­ting and for empir­i­cal default data.”

“The major chal­lenge in design­ing a dis­crim­i­na­tive learn­ing algo­rithm for pre­dict­ing struc­tured data is to address the com­pu­ta­tional issues aris­ing from the expo­nen­tial size of the out­put space. Exist­ing algo­rithms make dif­fer­ent assump­tions to ensure effi­cient, poly­no­mial time esti­ma­tion of model para­me­ters. For sev­eral com­bi­na­to­r­ial struc­tures, includ­ing cycles, par­tially ordered sets, per­mu­ta­tions and other graph classes, these assump­tions do not hold. In this the­sis, we address the prob­lem of design­ing learn­ing algo­rithms for pre­dict­ing com­bi­na­to­r­ial struc­tures by intro­duc­ing two new assump­tions: (i) The first assump­tion is that a par­tic­u­lar count­ing prob­lem can be solved effi­ciently. The con­se­quence is a gen­er­al­i­sa­tion of the clas­si­cal ridge regres­sion for struc­tured pre­dic­tion. (ii) The sec­ond assump­tion is that a par­tic­u­lar sam­pling prob­lem can be solved efficiently. …”

“I’m not an econ­o­mist, but we’ve got five appli­cants for every sin­gle job open­ing. If you tell me that the best response to that sit­u­a­tion is to lay off hun­dreds of thou­sands of teach­ers, I will not accept that this means that you’re smarter and more expert than I am. I will instead con­clude — regard­less of your pres­tige or posi­tion or years of study — that you’re a moral imbe­cile. And know­ing what I know about your inabil­ity to make moral judg­ments I will have no rea­son to trust you to make com­pli­cated macro­eco­nomic ones.”

“The Lin-​​Kernighan heuris­tic is known to be one of the most suc­cess­ful heuris­tics for the Trav­el­ing Sales­man Prob­lem (TSP). It has also proven its effi­ciency in appli­ca­tion to some other prob­lems. In this paper we dis­cuss pos­si­ble adap­ta­tions of TSP heuris­tics for the Gen­er­al­ized Trav­el­ing Sales­man Prob­lem (GTSP) and focus on the case of the Lin-​​Kernighan algo­rithm. At first, we pro­vide an easy-​​to-​​understand descrip­tion of the orig­i­nal Lin-​​Kernighan heuris­tic. Then we pro­pose sev­eral adap­ta­tions, both triv­ial and com­pli­cated. Finally, we con­duct a fair com­pe­ti­tion between all the vari­a­tions of the Lin-​​Kernighan adap­ta­tion and some other GTSP heuris­tics. It appears that our adap­ta­tion of the Lin-​​Kernighan algo­rithm for the GTSP repro­duces the suc­cess of the orig­i­nal heuris­tic. Dif­fer­ent vari­a­tions of our adap­ta­tion out­per­form all other heuris­tics in a wide range of trade-​​offs between solu­tion qual­ity and run­ning time, mak­ing Lin-​​Kernighan the state-​​of-​​the-​​art GTSP local search.”

“Each time-​​series has its own lin­ear trend, the direc­tion­al­ity of a time­series, and remov­ing the lin­ear trend is cru­cial to get the more intu­itive match­ing results. Sup­port­ing the lin­ear detrend­ing in sub­se­quence match­ing is a chal­leng­ing prob­lem due to a huge num­ber of pos­si­ble sub­se­quences. In this paper we define this prob­lem the lin­ear detrend­ing sub­se­quence match­ing and pro­pose its effi­cient index-​​based solu­tion. To this end, we first present a notion of LD-​​windows (LD means lin­ear detrend­ing), which is obtained as fol­lows: we elim­i­nate the lin­ear trend from a sub­se­quence rather than each win­dow itself and obtain LD-​​windows by divid­ing the sub­se­quence into win­dows. Using the LD-​​windows we then present a lower bound­ing the­o­rem for the index-​​based match­ing solu­tion and for­mally prove its correctness.…”

“In the social sci­ences, it is use­ful to under­stand the rel­a­tive sim­i­lar­i­ties of con­cepts that are embed­ded in a par­tic­u­lar text (from a par­tic­u­lar group or a par­tic­u­lar per­son). For exam­ple, in try­ing to esti­mate con­ser­v­a­tive bias in FoxNews, one might esti­mate its ten­dency to asso­ciate con­ser­v­a­tive con­cepts (con­ser­v­a­tive, repub­li­can) and good con­cepts (good, pos­i­tive, etc.), com­pared to con­ser­v­a­tive and bad con­cepts. The out­put would indi­cate con­ser­v­a­tive favoritism. This com­par­i­son could be fur­ther refined by tak­ing into account impor­tant “base­line” infor­ma­tion about the valences asso­ci­ated with lib­eral, namely lib­eral and good in com­par­i­son to lib­eral and bad.…”

Some­times physics is just pretty.

“The Open Enter­prise is a new orga­ni­za­tional design. Unlike orga­ni­za­tions using tra­di­tional man­age­ment struc­tures, Open Enter­prises replace the com­mand and con­trol hier­ar­chy with a mer­i­toc­racy based on col­lab­o­ra­tion and open participation.

Orga­ni­za­tions that adopt this new orga­ni­za­tional struc­ture can make deci­sions faster and respond quicker to their mar­kets. They look more like liv­ing dynamic net­works, and less like pyra­mids. Peo­ple work­ing in these orga­ni­za­tions will have (and feel) more own­er­ship. They’re more engaged in their work, and have the free­dom to work on what they want, when they want to. Most impor­tantly this model enables peo­ple to once again bring their full human­ity – val­ues, beliefs and pas­sions – to the work­place, remov­ing dis­con­nect between orga­ni­za­tional and per­sonal values”

Specif­i­cally: “Genome-​​wide asso­ci­a­tion study of hair length in dogs”

“The human immune sys­tem has numer­ous prop­er­ties that make it ripe for exploita­tion in the com­pu­ta­tional domain, such as robust­ness and fault tol­er­ance, and many dif­fer­ent algo­rithms, col­lec­tively termed Arti­fi­cial Immune Sys­tems (AIS), have been inspired by it. Two gen­er­a­tions of AIS are cur­rently in use, with the first gen­er­a­tion rely­ing on sim­pli­fied immune mod­els and the sec­ond gen­er­a­tion util­is­ing inter­dis­ci­pli­nary col­lab­o­ra­tion to develop a deeper under­stand­ing of the immune sys­tem and hence pro­duce more com­plex mod­els. Both gen­er­a­tions of algo­rithms have been suc­cess­fully applied to a vari­ety of prob­lems, includ­ing anom­aly detec­tion, pat­tern recog­ni­tion, opti­mi­sa­tion and robotics.…”

“This paper is con­cerned with design­ing self-​​driven fit­ness func­tions for Embed­ded Evo­lu­tion­ary Robot­ics. The pro­posed approach con­sid­ers the entropy of the sensori-​​motor stream gen­er­ated by the robot con­troller. This entropy is com­puted using unsu­per­vised learn­ing; its max­i­miza­tion, achieved by an on-​​board evo­lu­tion­ary algo­rithm, imple­ments a “curios­ity instinct”, favour­ing con­trollers vis­it­ing many diverse sensori-​​motor states (sms). Fur­ther, the set of sms dis­cov­ered by an indi­vid­ual can be trans­mit­ted to its off­spring, mak­ing a cul­tural evo­lu­tion mode pos­si­ble. Cumu­la­tive entropy (com­puted from ances­tors and cur­rent indi­vid­ual vis­its to the sms) defines another self-​​driven fit­ness; its opti­miza­tion imple­ments a “dis­cov­ery instinct”, as it favours con­trollers vis­it­ing new or rare sensori-​​motor states. Empir­i­cal results on the bench­mark prob­lems pro­posed by Lehman and Stan­ley (2008) com­par­a­tively demon­strate the mer­its of the approach.”

“Music com­po­si­tion used to be a pen and paper activ­ity. These these days music is often com­posed with the aid of com­puter soft­ware, even to the point where the com­puter com­pose parts of the score autonomously. The com­po­si­tion of most styles of music is gov­erned by rules. We show that by approach­ing the automa­tion, analy­sis and ver­i­fi­ca­tion of com­po­si­tion as a knowl­edge rep­re­sen­ta­tion task and for­mal­is­ing these rules in a suit­able log­i­cal lan­guage, pow­er­ful and expres­sive intel­li­gent com­po­si­tion tools can be eas­ily built. …”

“… Using wire­less sen­sor net­work tech­nol­ogy, we obtained high-​​resolution data of CPIs dur­ing a typ­i­cal day at an Amer­i­can high school, per­mit­ting the recon­struc­tion of the social net­work rel­e­vant for infec­tious dis­ease trans­mis­sion. At a 94% cov­er­age, we col­lected 762,868 CPIs at a max­i­mal dis­tance of 3 meters among 788 indi­vid­u­als. The data revealed a high den­sity net­work with typ­i­cal small world prop­er­ties and a rel­a­tively homoge­nous dis­tri­b­u­tion of both inter­ac­tion time and inter­ac­tion part­ners among subjects.…”