"… As a departure from such traditional trust models, we propose a generic, machine learning approach based trust framework where an agent uses its own previous transactions (with other agents) to build a knowledge base, and utilize this to assess the trustworthiness of a transaction based on associated features, which are capable of distinguishing successful transactions from unsuccessful ones. These features are harnessed using appropriate machine learning algorithms to extract relationships between the potential transaction and previous transactions.…"

"We study the 2-dimensional vector packing problem, which is a generalization of the classical bin packing problem where each item has 2 distinct weights and each bin has 2 corresponding capacities. The goal is to group items into minimum number of bins, without violating the bin capacity constraints.…"

"Thinning of character images is a big challenge. Removal of strokes or deformities in thinning is a difficult problem.…"

"… We examine here how the algorithm of phyllotaxis could contribute to the analysis of the structure of collagen fibrils. Such an algorithm indeed leads to organizations giving to each element of the assembly the most homogeneous and isotropic dense environment in a situation of cylindrical symmetry. The scattered intensity expected from a phyllotactic distribution of triple helices in collagen fibrils well agrees with the major features observed along the equatorial direction of their X ray patterns. Following this approach, the aggregation of triple helices in fibrils should be considered within the frame of soft condensed matter studies rather than that of molecular crystal studies."

"Even when the numbers of non-zero entries per column/row in the measurement matrices are limited to $O(1)$, numerical experiments indicate that the algorithm can still typically recover the original signal perfectly with an $O(N)$ computational cost per update as well if the density $\rho$ of non-zero entries of the signal is lower than a certain critical value $\rho_{\rm th}(\alpha)$ as $N,M \to \infty$."

"We investigate the evolutionary dynamics of an idealised model for the robust self-assembly of two-dimensional structures called polyominoes. The model includes rules that encode interactions between sets of square tiles that drive the self-assembly process. The relationship between the model's rule set and its resulting self-assembled structure can be viewed as a genotype-phenotype map and incorporated into a genetic algorithm."

"In this work we introduce a new linear time compression algorithm, called "Re-pair for Trees", which compresses ranked ordered trees using linear straight-line context-free tree grammars. Such grammars generalize straight-line context-free string grammars and allow basic tree operations, like traversal along edges, to be executed without prior decompression. Our algorithm can be considered as a generalization of the "Re-pair" algorithm developed by N. Jesper Larsson and Alistair Moffat in 2000. The latter algorithm is a dictionary-based compression algorithm for strings. We also introduce a succinct coding which is specialized in further compressing the grammars generated by our algorithm. This is accomplished without loosing the ability do directly execute queries on this compressed representation of the input tree.…"

"Until I started using Specification Workshops as the name for a collaborative meeting about acceptance tests, it was very hard to convince business users to participate. But a simple change in naming made the problem go away."

"Weather data didn’t come to be because of an Open Government Directive. It wasn’t created because of a White House mandate. Government did not release the data and then enterprising people built companies on top of it. It’s more accurate to make the argument that we have a national weather service because of one man’s deep desire to keep his job and to get promoted to colonel in the Army. It could be a vast network of lobbyists to help that man get promoted, or the vast network of lobbyists from shipping companies trying to get access to data already being created. Or it could be that it was just pretty obvious that access to weather data would save lives."

"While company filings and regulations may not be the most glamorous parts of your startup, they're absolutely critical to the success of your business and safety of your personal savings. Here's a quick rundown of the laws and regulations you need to consider when creating a startup. Of course, depending on your type of business, hiring a tax accountant or good attorney with specific experience in your industry can go a long way to helping you steer clear of trouble."

"We study, using simulated experiments inspired by thin film magnetic domain patterns, the feasibility of phase retrieval in X-ray diffractive imaging in the presence of intrinsic charge scattering given only photon-shot-noise limited diffraction data. We detail a reconstruction algorithm to recover the sample's magnetization distribution under such conditions, and compare its performance with that of Fourier transform holography. Concerning the design of future experiments, we also chart out the reconstruction limits of diffractive imaging when photon- shot-noise and the intensity of charge scattering noise are independently varied. This work is directly relevant to the time-resolved imaging of magnetic dynamics using coherent and ultrafast radiation from X-ray free electron lasers and also to broader classes of diffractive imaging experiments which suffer noisy data, missing data or both."

"We have shown that there exists a large ensemble of minimal Boolean networks that show reliable and robust dynamics. The networks are minimal in the respect that the number of connections of a node is not larger than necessary for obtaining a desired reliable trajectory. A reliable trajectory is an attractor of the dynamics of the network that does not change when the update schedule is changed or randomized. This means that under parallel update, at each time step only one node changes its state. The reliable trajectories were chosen at random, given a fixed average number of flips per node. High robustness was achieved by using an evolutionary algorithm that modifies the update functions and that accepts only those changes that do not decrease robustness.…"

"Our 2.546-approximation is quite simple. The performance guarantee is based on a simple area argument. This gives rise to the following question: what is the smallest square that suffices for packing any set of circles of total area 1? We believe the worst-case may very well be shown in Figure 13, which yields a lower bound of 1.471299… We believe there are relatively easy ways to improve the upper bound."

"In this paper we present a technique for fusion of optical and thermal face images based on image pixel fusion approach. Out of several factors, which affect face recognition performance in case of visual images, illumination changes are a significant factor that needs to be addressed. Thermal images are better in handling illumination conditions but not very consistent in capturing texture details of the faces. Other factors like sunglasses, beard, moustache etc also play active role in adding complicacies to the recognition process. Fusion of thermal and visual images is a solution to overcome the drawbacks present in the individual thermal and visual face images.…"

"OpenCV (Open Source Computer Vision) is a library of programming functions for real time computer vision.

OpenCV is released under a BSD license, it is free for both academic and commercial use.
The library has >500 optimized algorithms (see figure below). It is used around the world, has >2M downloads and >40K people in the user group. Uses range from interactive art, to mine inspection, stitching maps on the web on through advanced robotics."

"We study the dynamics of the Naming Game [Baronchelli et al., (2006) J. Stat. Mech.: Theory Exp. P06014] in empirical social networks. This stylized agent-based model captures essential features of agreement dynamics in a network of autonomous agents, corresponding to the development of shared classification schemes in a network of artificial agents or opinion spreading and social dynamics in social networks. Our study focuses on the impact that communities in the underlying social graphs have on the outcome of the agreement process. We find that networks with strong community structure hinder the system from reaching global agreement; the evolution of the Naming Game in these networks maintains clusters of coexisting opinions indefinitely. Further, we investigate agent-based network strategies to facilitate convergence to global consensus."

"Neuronal activity arises from an interaction between ongoing firing generated spontaneously by neural circuits and responses driven by external stimuli. Using mean-field analysis, we ask how a neural network that intrinsically generates chaotic patterns of activity can remain sensitive to extrinsic input. We find that inputs not only drive network responses, they also actively suppress ongoing activity, ultimately leading to a phase transition in which chaos is completely eliminated. The critical input intensity at the phase transition is a non-monotonic function of stimulus frequency, revealing a "resonant" frequency at which the input is most effective at suppressing chaos even though the power spectrum of the spontaneous activity peaks at zero and falls exponentially. A prediction of our analysis is that the variance of neural responses should be most strongly suppressed at frequencies matching the range over which many sensory systems operate."

"Developing large-scale distributed applications can be a daunting task. object-based environments have attempted to alleviate problems by providing distributed objects that look like local objects. We advocate that this approach has actually only made matters worse, as the developer needs to be aware of many intricate internal details in order to adequately handle partial failures. The result is an increase of application complexity. We present an alternative in which distribution transparency is lessened in favor of clearer semantics. In particular, we argue that a developer should always be offered the unambiguous semantics of local objects, and that distribution comes from copying those objects to where they are needed. We claim that it is often sufficient to provide only small, immutable objects, along with facilities to group objects into clusters."

"The task of image restration is to find the spatial correspondence of two or more given images. In this paper we assume that the correspondence is given either by an Euclidean, or by an affine volume-preserving transformation. Since the registration problem can be seen as an optimization problem on a finite dimensional Lie group, we use a recently developed framework of approximate-Newton methods on manifolds, which leads to locally quadratically convergent algorithms. To reduce numerical costs, we present two strategies: One makes use of the quasi Monte Carlo Method and the other ends up with an algorithm acting on spline function spaces. An extension for multi-modal image registration is given as well."

"l1-minimization refers to finding the minimum l1-norm solution to an underdetermined linear system b=Ax. It has recently received much attention, mainly motivated by the new compressive sensing theory that shows that under quite general conditions the minimum l1-norm solution is also the sparsest solution to the system of linear equations. Although the underlying problem is a linear program, conventional algorithms such as interior-point methods suffer from poor scalability for large-scale real world problems. A number of accelerated algorithms have been recently proposed that take advantage of the special structure of the l1-minimization problem. In this paper, we provide a comprehensive review of five representative approaches, namely, Gradient Projection, Homotopy, Iterative Shrinkage-Thresholding, Proximal Gradient, and Augmented Lagrange Multiplier. …"

"Sparse data models, where data is assumed to be well represented as a linear combination of a few elements from a dictionary, have gained considerable attention in recent years, and their use has led to state-of-the-art results in many signal and image processing tasks. It is now well understood that the choice of the sparsity regularization term is critical in the success of such models. Based on a codelength minimization interpretation of sparse coding, and using tools from universal coding theory, we propose a framework for designing sparsity regularization terms which have theoretical and practical advantages when compared to the more standard l0 or l1 ones. The presentation of the framework and theoretical foundations is complemented with examples that show its practical advantages in image denoising, zooming and classification."

"In the present article we emphasize the importance of modeling time in the context of agent-based models. To this end, we present a (selective) survey of the Cellular Automata-literature on updating and draw parallels to the issue of agent activation in agent-based models. By means of two simple models, Schelling's segregation model and Epstein's demographic prisoner's dilemma we investigate the influence of choosing different regimes of agent activation. Our experiments indicate that timing is not a critical issue for very simple models but bears huge influence on model behavior and results as soon as the degree of complexity increases only so slightly. After a brief review of the way commonly used ABM simulation environments handle the issue of timing, we draw some tentative conclusions about the importance of timing and the need for more research towards that direction, similar to the concerted effort on updating in cellular automata."

"Transient algebra is a multi-valued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are modeled by extensions of boolean functions to transients. Formulas for computing the output transient of a gate from the input transients are known for NOT, AND, OR} and XOR gates and their complements, but, in general, even the problem of deciding whether the length of the output transient exceeds a given bound is NP-complete. We propose a method of evaluating extensions of general boolean functions. We introduce and study a class of functions with the following property: Instead of evaluating an extension of a boolean function on a given set of transients, it is possible to get the same value by using transients derived from the given ones, but having length at most 3. We prove that all functions of three variables, as well as certain other functions, have this property, and can be efficiently evaluated."

"We define a two-step learner for RFSAs based on an observation table by using an algorithm for minimal DFAs to build a table for the reversal of the language in question and showing that we can derive the minimal RFSA from it after some simple modifications. We compare the algorithm to two other table-based ones of which one (by Bollig et al. 2009) infers a RFSA directly, and the other is another two-step learner proposed by the author. We focus on the criterion of query complexity."

"…The model is based on the emergent properties of generic genetic networks, it does not refer to specific control circuits and it can therefore hold for a wide class of lineages. The model points to a peculiar role of cellular noise in differentiation, which has never been hypothesized so far, and leads to non trivial predictions which could be subject to experimental testing."

"This paper presents a novel type-2 Fuzzy logic System to define the Shape of a facial component with the crisp output. This work is the part of our main research effort to design a system (called FASY) which offers a novel face construction approach based on the textual description and also extracts and analyzes the facial components from a face image by an efficient technique. The Fuzzy model, designed in this paper, takes crisp value of width and height of a facial component and produces the crisp value of Shape for different facial components. This method is designed using Matlab 6.5 and Visual Basic 6.0 and tested with the facial components extracted from 200 male and female face images of different ages from different face databases."

"We consider a generalization of the Gabriel graph, the witness Gabriel graph. Given a set of vertices P and a set of witnesses W in the plane, there is an edge ab between two points of P in the witness Gabriel graph GG-(P,W) if and only if the closed disk with diameter ab does not contain any witness point (besides possibly a and/or b). We study several properties of the witness Gabriel graph, both as a proximity graph and as a new tool in graph drawing."

"We use computer simulation to study crystal-forming model proteins equipped with interactions that are both orientationally specific and nonspecific. Distinct dynamical pathways of crystal formation can be selected by tuning the strengths of these interactions. When the nonspecific interaction is strong, liquidlike clustering can precede crystallization; when it is weak, growth can proceed via ordered nuclei. Crystal yields are in certain parameter regimes enhanced by the nonspecific interaction, even though it promotes association without local crystalline order. Our results suggest that equipping nanoscale components with weak nonspecific interactions (such as depletion attractions) can alter both their dynamical pathway of assembly and optimize the yield of the resulting material."

"Many complex systems present an intrinsic bipartite nature and are often described and modeled in terms of networks [1-5]. Examples include movies and actors [1, 2, 4], authors and scientific papers [6-9], email accounts and emails [10], plants and animals that pollinate them [11, 12]. Bipartite networks are often very heterogeneous in the number of relationships that the elements of one set establish with the elements of the other set. … Here we introduce an unsupervised method to statistically validate each link of the projected network against a null hypothesis taking into account the heterogeneity of the system. We apply our method to three different systems…. In all these systems, both different in size and level of heterogeneity, we find that our method is able to detect network structures which are informative about the system…"

"Work out which bits of the system you know least about. Create the scenarios and have conversations around those bits of the system. You don’t have to grow the system from the beginning – you can pick any point you like! Which bits of the system make you most uncomfortable? Which bits make your stakeholders most uncomfortable?"

"So where does this gulf of experiences come from, why is cucumber loved by some and hated by others. At the risk of over-generalisation and mischaracterisation I recently came up with a theory: the cucumber detractors are not using cuke the way it was intended."

"We tried a variant of this program starting in 2002 with a more solid economy and we are still trying to recover from how that movie ended. Einstein defined insanity as doing the same thing over and over again and expecting different results. And since the financial sector profited so handsomely from this exercise the last time around, they have every reason to encourage this insanity."

"In this work we investigate a novel approach to handle the challenges of face recognition, which includes rotation, scale, occlusion, illumination etc. Here, we have used thermal face images as those are capable to minimize the affect of illumination changes and occlusion due to moustache, beards, adornments etc. The proposed approach registers the training and testing thermal face images in polar coordinate, which is capable to handle complicacies introduced by scaling and rotation. Line features are extracted from thermal polar images and feature vectors are constructed using these line. Feature vectors thus obtained passes through principal component analysis (PCA) for the dimensionality reduction of feature vectors.…"

"In 1961 Herbert Simon and Albert Ando published the theory behind the long-term behavior of a dynamical system that can be described by a nearly completely decomposable matrix. Over the past fifty years this theory has been used in a variety of contexts, including queueing theory, computer performance, and ecology. In all these applications, the structure of the system is known and the point of interest is the various states the system passes through on its way to some long-term equilibrium. This paper looks at this problem from the other direction. That is, we develop a technique for using the evolution of the system to tell us about its initial structure, and we use this technique to develop a new algorithm for data clustering."

"Smoothie Charts is a really small chartling library designed for live streaming data. I built it to reduce the headaches I was getting from watching charts jerkily updating every second. What you're looking up now is pretty much all it does. If you like that, then read on."

"We discuss the complex dynamics of a non-linear random networks model, as a function of the connectivity k between the elements of the network. We show that this class of networks exhibit an order-chaos phase transition for a critical connectivity k = 2. Also, we show that both, pairwise correlation and complexity measures are maximized in dynamically critical networks. These results are in good agreement with the previously reported studies on random Boolean networks and random threshold networks, and show once again that critical networks provide an optimal coordination of diverse behavior."

"The new algorithm by Yadava and his colleagues goes one step further. It uses a more realistic physics model of the x-ray source, the detectors, and the x-ray beam. Each of these three is assumed to have specific diameters instead of being considered a point or a line, Yadava says. Depending on the type of scan, the technique is better than ASIR at cutting image noise, and thus the x-rays can be even less intense. The researchers got high-quality abdomen scans of a human model using an eighth of the radiation dose of a conventional scan."

"Because sharing data resulted in a citation, I wonder how long will it take for Open Data advocates to start using this “open data citation advantage” as an argument for sharing data?"

"As we continue to monitor the markets for evidence of Quote Stuffing and Strange Sequences (Crop Circles), we find that there are dozens if not hundreds of examples to choose from on any given day. As such, this page will be updated often with charts demonstrating this activity.

The common theme with the charts shown on this page is they are obviously all generated in code and are algorithmic. Some demonstrate bizarre price or size cycling, some demonstrate large burst of quotes in extremely short time frames and some will demonstrate both. In most cases these sequences are from a single exchange with no other exchange quoting in the same time frame."

"While analyzing HFT (High Frequency Trading) quote counts, we were shocked to find cases where one exchange was sending an extremely high number of quotes for one stock in a single second: as high as 5,000 quotes in 1 second! During May 6, there were hundreds of times that a single stock had over 1,000 quotes from one exchange in a single second. Even more disturbing, there doesn't seem to be any economic justification for this. In many of the cases, the bid/offer is well outside the National Best Bid/Offer (NBBO). We decided to analyze a handful of these cases in detail and graphed the sequential bid/offers to better understand them. What we discovered was a manipulative device with destabilizing effect."

"…We tested our algorithm on a small benchmark graph and on a network of about 500 papers in information science (weighted with the Salton index of bibliographic coupling). In our tests, this approach results in characteristic ranges of resolution where a large resolution change does not lead to a growth of the natural community. Such stable modules were also obtained by applying the LFK algorithm but since we determine communities for all resolution values in one run, our approach is faster than the LFK reference. And our algorithm reveals the hierarchical structure of the graph more easily."

can I have some of these particles, please?

"The possibility of microscopic swimming by extraction of energy from an external flow is discussed, focusing on the migration of a simple trimer across a linear shear flow. The geometric properties of swimming, together with the possible generalization to the case of a vesicle, are analyzed.The mechanism of energy extraction from the flow appears to be the generalization to a discrete swimmer of the tank-treading regime of a vesicle. The swimmer takes advantage of the external flow by both extracting energy for swimming and "sailing" through it. The migration velocity is found to scale linearly in the stroke amplitude, and not quadratically as in a quiescent fluid. This effect turns out to be connected with the non-applicability of the scallop theorem in the presence of external flow fields."

"A particle that moves along a smooth track in a vertical plane is influenced by two forces: gravity and normal force. The force experienced by roller coaster riders is the normal force, so a natural question to ask is: what shape of the track gives a normal force of constant magnitude? Here we solve this problem. It turns out that the solution is related to the Kepler problem; the trajectories in velocity space are conic sections."

"Recently popularized randomized methods for principal component analysis (PCA) efficiently and reliably produce nearly optimal accuracy – even on parallel processors – unlike the classical (deterministic) alternatives. We adapt one of these randomized methods for use with data sets that are too large to be stored in random-access memory (RAM). (The traditional terminology is that our procedure works efficiently "out-of-core.") We illustrate the performance of the algorithm via several numerical examples. For example, we report on the PCA of a data set stored on disk that is so large that less than a hundredth of it can fit in our computer's RAM."

"A story isn't done until it is being used by real users in production and has been validated to be a useful part of a product."

"Although Laposky, a draftsman by profession, had received a proper recognition as a pioneer of electronic art, at no time his name has emerged in the context of dynamical chaos theory. The circuits he had implemented for generation of “oscillons” on the screen of a cathode ray tube oscilloscope, remain a mystery. It is known that some of his thirty-seven circuits [2] had “as many as 70 different setting of controls”[3] and that ac-voltage has been used for the circuit feeding. Our analysis is based on the vanity press booklet with the still photos of the fifty-six oscillons, which were exhibited at the Sanford Museum (Cherokee, Iowa) in 1953 [2]."

"It wasn’t all that long ago that the media and banking industry commentators would worry about the coming train wreck in commercial real estate. But peculiarly, that topic has more or less receded from view. It appears the public has only so much interest in banking stories, and the frenzied coverage of financial services non-reform plus eurozone sovereign debt woes, which are really eurozone bank woes, took center stage."

"It is my opinion, that anybody should be able to use Couch in Rails or Sinatra or plain Ruby application as easily as using ActiveRecord, or, maybe more importantly, the highly faved MongoDB. Please share your opinion in the comments."

"Is it any wonder that the value of a college education is now being questioned more than it used to be? Perhaps a basic education in personal finance would help more people make informed decisions about college and how to handle the financing of that endeavor."

"… In particular, the fetishization of autonomy, self-reliance, and progress through mechanical engineering — echoing the desire to escape the suffocating social conditions back east by simply running away — utterly undermine the program itself and are incompatible with life in a space colony (which is likely to be at a minimum somewhat more constrained than life in one of the more bureaucratically obsessive-compulsive European social democracies, and at worst will tend towards the state of North Korea in Space)."

"Look no one wants to see violence in the streets, but history shows that it is not only the capitalists that have 2nd amendment remedies. Joe Hill may have more life in him than they like."

"Strategy changes are an essential part of evolutionary games. Here we introduce a simple rule that, depending on the value of a single parameter $w$, influences the selection of players that are considered as potential sources of the new strategy. For positive $w$ players with high payoffs will be considered more likely, while for negative $w$ the opposite holds. Setting $w$ equal to zero returns the frequently adopted random selection of the opponent. We find that increasing the probability of adopting the strategy from the fittest player within reach, i.e. setting $w$ positive, promotes the evolution of cooperation. The robustness of this observation is tested against different levels of uncertainty in the strategy adoption process and for different interaction network. Since the evolution to widespread defection is tightly associated with cooperators having a lower fitness than defectors, the fact that positive values of $w$ facilitate cooperation is quite surprising. …"

"In this work we study a weak Prisoner's Dilemma game in which both strategies and update rules are subjected to evolutionary pressure. Interactions among agents are specified by complex topologies, and we consider both homogeneous and heterogeneous situations. We consider deterministic and stochastic update rules for the strategies, which in turn may consider single links or full context when selecting agents to copy from. Our results indicate that the co-evolutionary process preserves heterogeneous networks as a suitable framework for the emergence of cooperation. Furthermore, on those networks, the update rule leading to a larger fraction of cooperation, replicator dynamics, is selected during co-evolution.…We conclude that for a variety of topologies, the fact that the dynamics coevolves with the strategies leads in general to more cooperation in the weak Prisoner's Dilemma game."

"Dynamics of evolutionary games strongly depend on underlying networks. We study the coevolutionary prisoner's dilemma in which players change their local networks as well as strategies (i.e., cooperate or defect). This topic has been increasingly explored by many researchers. On the basis of active linking dynamics [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 cooperation is enhanced fairly robustly. In particular, cooperation evolves when the payoff of the player is normalized by the number of neighbors; this is not the case in the evolutionary prisoner's dilemma on static networks."

"Biological networks of interacting agents exhibit similar topological properties for a wide range of scales, from cellular to ecological levels, suggesting the existence of a common evolutionary origin. A general evolutionary mechanism based on global stability has been proposed recently [J I Perotti, O V Billoni, F A Tamarit, D R Chialvo, S A Cannas, Phys. Rev. Lett. 103, 108701 (2009)]. This mechanism is incorporated into a model of a growing network of interacting agents in which each new agent's membership in the network is determined by the agent's effect on the network's global stability. We show that, out of this stability constraint, several topological properties observed in biological networks emerge in a self organized manner. The influence of the stability selection mechanism on the dynamics associated to the resulting network is analyzed as well."

"How do living cells achieve sufficient abundances of functional protein complexes while minimizing promiscuous non-functional interactions between their proteins? Here we study this problem using a first-principle model of the cell whose phenotypic traits are directly determined from its genome through biophysical properties of protein structures and binding interactions in crowded cellular environment. The model cell includes three independent pathways, whose topologies of PPI subnetworks are different, but whose functional concentrations equally contribute to cell's fitness. The model cells evolve through genotypic mutations and phenotypic protein copy number variations. We found a strong relationship between evolved physical-chemical properties of protein interactions and their abundances due to a "frustration" effect: strengthening of functional interactions brings about hydrophobic surfaces, which make proteins prone to promiscuous binding.…"

"We introduce the heterogeneous voter model (HVM), in which each agent has its own intrinsic rate to change state, reflective of the heterogeneity of real people, and the partisan voter model (PVM), in which each agent has an innate and fixed preference for one of two possible opinion states. For the HVM, the time until consensus is reached is much longer than in the classic voter model. For the PVM in the mean-field limit, a population evolves to a "selfish" state, where each agent tends to be aligned with its internal preference. For finite populations, discrete fluctuations ultimately lead to consensus being reached in a time that scales exponentially with population size."

"In this paper we have considered a spherical envelope model (so-called squirmer) to investigate energetics in cilia dynamics and locomotion. Allowing only tangential but time-periodic deformations, we have used an optimization method based on a variational approach to derive computationally the stroke leading to the largest swimming efficiency. The optimal stroke was shown to display weak Lagrangian asymmetry, but strong Eulerian asymmetry, indicative of symmetry-breaking at the whole-organism level, but not at the level of individual cilia.…"

"Linux package managers have to deal with dependencies and conflicts of packages required to be installed by the user. As an NP-complete problem, this is a hard task to solve. In this context, several approaches have been pursued. Apt-pbo is a package manager based on the apt project that encodes the dependency solving problem as a pseudo-Boolean optimization (PBO) problem. This paper compares different PBO solvers and their effectiveness on solving the dependency solving problem."

"The problem the pattern attempts to solve: identify the URLs in an arbitrary string of text, where by “arbitrary” let’s agree we mean something unstructured such as an email message or a tweet."

"We have embarked on a research program designed to develop universal models that can recreate empiri- cally observed phenomena in dynamic complex networks. We have shown that, using a suitable reinforced random walk on a “long-term” underlay network, one is able to produce instantaneous networks which reproduce qualitatively characteristic features of real world dynamic networks. This includes, in particular, the construc- tion of scale-free sub-networks of a scale-free “underlay” network, whose local hubs substantially differ from sub- network to sub-network and from those of the underlay.…"

"…For cyclic games with two players and three strategies, we show that the resulting deterministic dynamics crucially depends on the initial condition in a non–trivial way."

"The transition of the flow in a duct of square cross-section is studied. Like in the similar case of the pipe flow, the motion is linearly stable for all Reynolds numbers; this flow is thus a good candidate to investigate the 'bypass' path to turbulence. Initially the so-called 'linear optimal perturbation problem' is formulated and solved, yielding optimal disturbances in the form of longitudinal vortices. Such optimals, however, fail to elicit a significant response from the system in the nonlinear regime. Thus, streamwise-inhomogeneous, sub-optimal disturbances are focussed upon; nonlinear quadratic interactions are immediately evoked by such initial perturbations and an unstable streamwise-homogeneous large amplitude mode rapidly emerges. The subsequent evolution of the flow, at a value of the Reynolds number at the edge between fully developed turbulence and relaminarization, shows the alternance of patterns with two pairs of large scale vortices near opposing parallel walls.…"

"The modeling of complex systems such as ecological or socio-economic systems can be very challenging. Although various modeling approaches exist, they are generally not compatible and mutually consistent, and empirical data often do not allow one to decide what model is the right one, the best one, or most appropriate one. Moreover, as the recent financial and economic crisis shows, relying on a single, idealized model can be very costly. This contribution tries to shed new light on problems that arise when complex systems are modeled. While the arguments can be transferred to many different systems, the related scientific challenges are illustrated for social, economic, and traffic systems. The contribution discusses issues that are sometimes overlooked and tries to overcome some frequent misunderstandings and controversies of the past.…"

"We address the problem of estimating unknown model parameters and state variables in stochastic reaction processes when only sparse and noisy measurements are available. Using an asymptotic system size expansion for the backward equation we derive an efficient approximation for this problem. We demonstrate the validity of our approach on model systems and generalize our method to the case when some state variables are not observed."

"While the concept of clusters arises when viewing quasicrystalline surfaces at close range, long range quasiperiodic order as seen in diffraction studies is perhaps more naturally described in terms of quasiperiodic tilings. These are the analogs of the “Bravais lattices” for periodic systems, and give a good description of the orientational order and positional long range order seen in quasicrystal diffraction patterns. Tilings are constructed from a small num- ber of tiles arranged so as to avoid overlapping or holes. Quasiperiodic tilings usually possess a hierarchically organised structure, where tilings can be ”in- flated”(”deflated”) so as to obtain a similar tiling on a larger(smaller) length scale."

"Much recent interest has focused on "open" dynamical systems, in which a classical map or flow is considered only until the trajectory reaches a "hole", at which the dynamics is no longer considered. Here we consider questions pertaining to the survival probability as a function of time, given an initial measure on phase space. We focus on the case of billiard dynamics, namely that of a point particle moving with constant velocity except for mirror-like reflections at the boundary, and give a number of recent results, physical applications and open problems."

"Storage optimization in distributed environments is a major concern when talking about reliability in this kind of schemes. Although replication is the most used option, erasure coding is a more optimized one.
However, erasure coding uses a lot of bandwidth to replace one node. In a dynamic scheme, where nodes enter and leave the system frequently, bandwidth use could be an important drawback.
Regenerating Codes introduced by Dimakis et al. minimize the code repair problem by applying Network Coding to the distributed storage scheme. However finding the coefficients for the linear combinations used to replace a node is not easy, specially for the systematic case, and must be calculated for each new node fail.…"

"In this paper, we perform a minimalistic quantization of the classical game of tic-tac-toe, by allowing superpositions of classical moves. In order for the quantum game to reduce properly to the classical game, we require legal quantum moves to be orthogonal to all previous moves. We also admit interference effects, by squaring the sum of amplitudes over all moves by a player to compute his or her occupation level of a given site. A player wins when the sums of occupations along any of the eight straight lines we can draw in the $3 \times 3$ grid is greater than three.…"

"Actual accounting systems are based on transactions. But in the current, knowledge-based economy much of the value creation precedes, sometimes by years, the occurrence of transactions. Until then, the accounting system does not register any value created in contrast to the investments made into R&D, which are fully expensed. This difference, between how the accounting system is handling value created and is handling investments into value creation, is the major reason for the growing disconnect between market values and financial information."

Makes me want to write a simple agent-based model in which a few people have almost all the money and most everybody else are allowed to move a bit around, for a fee.

"This is a short commentary piece that discusses how the methods used in the natural sciences can apply to economics in general and financial markets specifically."

"In real communication and transportation networks, the geographical positions of nodes are very important for the efficiency and the tolerance of connectivity. Considering spatially inhomogeneous positions of nodes according to a population, we introduce a multi-scale quartered (MSQ) network that is stochastically constructed by recursive subdivision of polygonal faces as a self-similar tiling. It has several advantages: the robustness of connectivity, the bounded short path lengths, and the shortest distance routing algorithm in a distributive manner. Furthermore, we show that the MSQ network is more efficient with shorter link lengths and more suitable with lower load for avoiding traffic congestion than other geographical networks which have various topologies ranging from river to scale-free networks. These results will be useful for providing an insight into the future design of ad hoc network infrastructures."

"We describe computer algorithms that produce the complete set of isohedral tilings by n-omino or n-iamond tiles in which the tiles are fundamental domains and the tilings have 3-, 4-, or 6-fold rotational symmetry. The symmetry groups of such tilings are of types p3, p31m, p4, p4g, and p6. There are no isohedral tilings with symmetry groups p3m1, p4m, or p6m that have polyominoes or polyiamonds as fundamental domains. We display the algorithms' output and give enumeration tables for small values of n.…"

I ♡ pragmatic physics. "We propose a simple rubber friction law, which can be used, e.g., in models of tire (and vehicle) dynamics."

"It features generic data abstraction through Collections, a Visualization API allowing the creation of pluggable visualizations, and a Scene Graph implementation on top of HTML 5 Canvas. See the GitHub project, the documentation, and an example."

"For a set of n points in the plane, we consider the axis–aligned (p,k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain n-k points. In this paper, we consider the boxes to be either squares or rectangles, and we want to minimize the area of the largest box. For general p we show that the problem is NP-hard for both squares and rectangles. For a small, fixed number p, we give algorithms that find the solution in the following running 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 rectangles 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 algorithms use O(n) space."

"We study the problem of reconstructing a sparse signal from a limited number of its linear projections when a part of its support is known, although the known part may contain some errors. The “known" part of the support, denoted T, may be available from prior knowledge. Alternatively, in a problem of recursively reconstructing time sequences of sparse spatial signals, one may use the support estimate from the previous time instant as the “known" part. The idea of our proposed solution (modified-CS) is to solve a convex relaxation of the following problem: find the signal that satisfies the data constraint and is sparsest outside of T.…"

"We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of half-edges (edges which are drawn with an unconnected end) and enjoy rich compositional principles by connecting graphs along these half-edges. In particular, this allows equations and rewrite rules to be specified between graphs. Particular computational models can then be encoded as an axiomatic set of such rules. Further rules can be derived graphically and rewriting can be used to simulate the dynamics of a computational system, e.g. evaluating a program on an input. Examples of models which can be formalised in this way include traditional electronic circuits as well as recent categorical accounts of quantum information."

"This expository review is devoted to fish swimming and bird/insect flight.…"

"We analyze over 500 million Twitter messages from an eight month period and find that tracking a small number of flu-related keywords allows us to forecast future influenza rates with high accuracy, obtaining a 95% correlation with national health statistics. We then analyze the robustness of this approach to spurious keyword matches, and we propose a document classification component to filter these misleading messages. We find that this document classifier can reduce error rates by over half in simulated false alarm experiments, though more research is needed to develop methods that are robust in cases of extremely high noise."

"We propose a degree-based coarse graining approach that not just accelerates the evaluation of dynamics on complex networks, but also satisfies the consistency conditions for both equilibrium statistical distributions and nonequilibrium dynamical flows. For the Ising model and susceptible-infected-susceptible epidemic model, we introduce these required conditions explicitly and further prove that they are satisfied by our coarse-grained network construction within the annealed network approximation. Finally, we numerically show that the phase transitions and fluctuations on the coarse-grained network are all in good agreements with those on the original one."

"Bacteria are the unseen majority on our planet, with millions of species and comprising most of the living protoplasm. While current methods enable in-depth study of a small number of communities, a simple tool for breadth studies of bacterial population composition in a large number of samples is lacking. We propose a novel approach for reconstruction of the composition of an unknown mixture of bacteria using a single Sanger-sequencing reaction of the mixture. This method is based on compressive sensing theory, which deals with reconstruction of a sparse signal using a small number of measurements. Utilizing the fact that in many cases each bacterial community is comprised of a small subset of the known bacterial species, we show the feasibility of this approach for determining the composition of a bacterial mixture.…"

"The Fermi Paradox is the apparent contradiction between the high probability extraterrestrial civilizations' existence and the lack of contact with such civilizations. In general, solutions to Fermi's paradox come down to either estimation of Drake equation parameters i.e. our guesses about the potential number of extraterrestrial civilizations or simulation of civilizations development in the universe. We consider a new type of cellular automata, that allows to analyze Fermi paradox. We introduce bonus stimulation model (BS-model) of development in cellular space (Universe) of objects (Civilizations). When civilizations get in touch they stimulate development each other, increasing their life time. We discovered nonlinear threshold behaviour of total volume of civilizations in universe and on the basis of our model we built analogue of Drake equation."

"In this paper, we investigate a conjecture by von Haeseler concerning the Maximum Parsimony method for phylogenetic estimation, which was published by the Newton Institute in Cambridge on a list of open phylogenetic problems in 2007. This conjecture deals with the question whether Maximum Parsimony trees are hereditary. The conjecture suggests that a Maximum Parsimony tree for a particular (DNA) alignment necessarily has subtrees of all possible sizes which are most parsimonious for the corresponding subalignments. We answer the conjecture affirmatively for binary alignments on five taxa but also show how to construct examples for which Maximum Parsimony trees are not hereditary. …we also show that compatible most parsimonious quartets do not have to provide a most parsimonious supertree. Last, we show that our results can be generalized to Maximum Likelihood for certain nucleotide substitution models."

"Laboratory investigations have shown that a formal theory of fault-tolerance will be essential to harness nanoscale self-assembly as a medium of computation. Several researchers have voiced an intuition that self-assembly phenomena are related to the field of distributed computing. This paper formalizes some of that intuition. We construct tile assembly systems that are able to simulate the solution of the wait-free consensus problem in some distributed systems. (For potential future work, this may allow binding errors in tile assembly to be analyzed, and managed, with positive results in distributed computing, as a "blockage" in our tile assembly model is analogous to a crash failure in a distributed computing model.) …We show that solution of this strengthened consensus problem can be simulated by a two-dimensional tile assembly model only for two processes, whereas a three-dimensional tile assembly model can simulate its solution in a distributed system with any number of processes

"Genetic oscillators are a major theme of interest in the emerging field of synthetic biology. Until recently, most work has been carried out using intra-cellular oscillators, but this approach restricts the broader applicability of such systems. Motivated by a desire to develop large-scale, spatially-distributed cell-based computational systems, we present an initial design for a population-level oscillator which uses three different bacterial strains. Our system is based on the client-server model familiar to computer science, and uses quorum sensing for communication between nodes. We present the results of extensive in silico simulation tests, which confirm that our design is both feasible and robust."

Frankly, I've alway thought this, especially after some early "confusing" experiments that never got published because they were part of my first Ph.D. thesis research: "…We argue that the presence of only the frozen phase in the work of Kauffman et al. was due simply to the specific parametrization used, and is not an inherent feature of this class of functions. However, these networks are significantly more stable than the variants where all possible Boolean functions are allowed."

"These are not the only comments posted to A2Politico that have gone into the ether. I’ve received emails from readers who say they’ve posted corrections to Lesko’s statements, links to sites that disprove her claims, and even links to stories she very selectively cites from. All have been deleted Soviet-style.…"

"Search engines today present results that are often oblivious to abrupt shifts in intent. For example, the query `independence day' usually refers to a US holiday, but the intent of this query abruptly changed during the release of a major film by that name. … This paper shows that the signals a search engine receives can be used to both determine that a shift in intent has happened, as well as find a result that is now more relevant. We present a meta-algorithm that marries a classifier with a bandit algorithm to achieve regret that depends logarithmically on the number of query impressions, under certain assumptions. We provide strong evidence that this regret is close to the best achievable. Finally, via a series of experiments, we demonstrate that our algorithm outperforms prior approaches, particularly as the amount of intent-shifting traffic increases."

"We give a space-optimal algorithm with update time O(log^2(1/eps)loglog(1/eps)) for (1+eps)-approximating the pth frequency moment, 0 < p < 2, of a length-n vector updated in a data stream. This provides a nearly exponential improvement in the update time complexity over the previous space-optimal algorithm of [Kane-Nelson-Woodruff, SODA 2010], which had update time Omega(1/eps^2)."

"We introduced an effective algorithm for k-nearest neighbor problem which works on multiple GPUs. By an experiment, we have shown that it runs more than 330 times faster than an implementation on a single core of an up-to-date CPU. We have also shown that the algorithm is effective from the viewpoint of parallelism of GPUs. That is because 1) there is no synchronization between GPUs until the very end of the process and 2) the workload is well balanced."

"Many computerized methods for RNA-RNA interaction structure prediction have been developed. Recently, $O(N^6)$ time and $O(N^4)$ space dynamic programming algorithms have become available that compute the partition function of RNA-RNA interaction complexes. However, few of these methods incorporate the knowledge concerning related sequences, thus relevant evolutionary information is often neglected from the structure determination. Therefore, it is of considerable practical interest to introduce a method taking into consideration both thermodynamic stability and sequence covariation. We present the \emph{a priori} folding algorithm \texttt{ripalign}, whose input consists of two (given) multiple sequence alignments (MSA). \texttt{ripalign} outputs (1) the partition function, (2) base-pairing probabilities, (3) hybrid probabilities and (4) a set of Boltzmann-sampled suboptimal structures consisting of canonical joint structures that are compatible to the alignments.…"

"A new floating-point arithmetic called precision arithmetic is developed to track precision for arithmetic calculations. It uses a novel rounding scheme to avoid excessive rounding error propagation of conventional floating-point arithmetic. Unlike interval arithmetic, its uncertainty tracking is based on statistics and its bounding range is much tighter. Generic standards and systematic methods for validating uncertainty-bearing arithmetics are discussed. The precision arithmetic is found to be better than interval arithmetic in uncertainty-tracking for linear algorithms. "

"We provide several basic results. We obtain an efficient algorithm for determining the heapa- bility of a sequence, and also prove that the question of whether a sequence can be arranged in a complete binary heap is NP-hard. Regarding subsequences we show that, with high probability, the longest heapable subsequence of a random permutation of n numbers has length (1 − o(1))n, and a subsequence of length (1 − o(1))n can in fact be found online with high probability. We similarly show that for a random permutation a subsequence that yields a complete heap of size αn for a constant α can be found with high probability. Our work highlights the interesting structure underlying this class of subsequence problems, and we leave many further interesting variations open for future work."

"This paper introduces the theory and practice of formal verification of self-assembling systems. We interpret a well-studied abstraction of nanomolecular self assembly, the Abstract Tile Assembly Model (aTAM), into Computation Tree Logic (CTL), a temporal logic often used in model checking. We then consider the class of "rectilinear" tile assembly systems. This class includes most aTAM systems studied in the theoretical literature, and all (algorithmic) DNA tile self-assembling systems that have been realized in laboratories to date. We present a polynomial-time algorithm that, given a tile assembly system T as input, either provides a counterexample to T's rectilinearity or verifies whether T has a unique terminal assembly. …"

"Here are some thoughts on using existing statistical software for better analytics and/or business intelligence (reporting)…"

"Therefore, the underlying demand curve is different today – so it isn't logical to expect valuation metrics of the market to be reproduced today – sans very extreme market events, which would need to last a considerable period of time."

Book Thing design

Answer Factory design

Answer Factory design

Answer Factory design

"The Dendritic Cell Algorithm (DCA) is inspired by the function of the dendritic cells of the human immune system. In nature, dendritic cells are the intrusion detection agents of the human body, policing the tissue and organs for potential invaders in the form of pathogens. In this research, and abstract model of DC behaviour is developed and subsequently used to form an algorithm, the DCA. The abstraction process was facilitated through close collaboration with laboratory- based immunologists, who performed bespoke experiments, the results of which are used as an integral part of this algorithm. The DCA is a population based algorithm, with each agent in the system represented as an 'artificial DC'. Each DC has the ability to combine multiple data streams and can add context to data suspected as anomalous.…"

"Retrieving images from large and varied repositories using visual contents has been one of major research items, but a challenging task in the image management community. In this paper we present an efficient approach for region-based image classification and retrieval using a fast multi-level neural network model. The advantages of this neural model in image classification and retrieval domain will be highlighted. The proposed approach accomplishes its goal in three main steps. First, with the help of a mean-shift based segmentation algorithm, significant regions of the image are isolated. Secondly, color and texture features of each region are extracted by using color moments and 2D wavelets decomposition technique. Thirdly the multi-level neural classifier is trained in order to classify each region in a given image into one of five predefined categories, i.e., "Sky", "Building", "SandnRock", "Grass" and "Water". …"

"The study of evolution of networks has received increased interest with the recent discovery that many real-world networks possess many things in common, in particular the manner of evolution of such networks. By adding a dimension of time to graph analysis, evolving graphs present opportunities and challenges to extract valuable information. This paper introduces the Evolving Graph Markup Language (EGML), an XML application for representing evolving graphs and related results. Along with EGML, a software tool is provided for the study of evolving graphs. New evolving graph drawing techniques based on the force-directed graph layout algorithm are also explored. Our evolving graph techniques reduce vertex movements between graph instances, so that an evolving graph can be viewed with smooth transitions"

"One of the most visually demonstrable and straightforward uses of filtering is in the field of Computer Vision. In this document we will try to outline the issues encountered while designing and implementing a particle and kalman filter based tracking system."

"The economy has started creating 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 reason: They frequently compete for jobs that require those advanced degrees with older workers who have the advantage of more work experience."

"In this paper, a simple Neural controller has been used to achieve stable walking in a NAO biped robot, with 22 degrees of freedom that implemented in a virtual physics-based simulation environment of Robocup soccer simulation environment. The algorithm uses a Matsuoka base neural oscillator to generate control signal for the biped robot. To find the best angular trajectory and optimize network parameters, a new population-based search algorithm, called the Harmony Search (HS) algorithm, has been used. The algorithm conceptualized a group of musicians together trying to search for better state of harmony. Simulation results demonstrate that the modification of the step period and the walking motion due to the sensory feedback signals improves the stability of the walking motion."

"Want to kill your firm quickly? Then study the current issue of Harvard Business Review. Imbibe its philosophy, its attitudes and its values. Implement everything it says. In so doing, you will be well on the way to turning your organization into a fully-fledged 20th Century organization, with a life expectancy of around 5-10 years."

seems like something to look at

"We have described three types of geometric object that have natural encodings as regular labelings of a maximal or near-maximal planar graph. Although much about these labelings is known, there are still many questions remaining:…"

"We study the phase behavior of bowl-shaped particles using computer simulations. These particles were found experimentally to form a meta-stable worm-like fluid phase in which the bowl-shaped particles have a strong tendency to stack on top of each other [M.Marechal et al, Nano Letters 10, 1907 (2010)]. In this work, we show that the transition from the low-density fluid to the worm-like phase has an interesting effect on the equation of state. The simulation results also show that the worm-like fluid phase transforms spontaneously into a columnar phase for bowls that are sufficiently deep. Furthermore, we describe the phase behavior as obtained from free energy calculations employing Monte Carlo simulations. The columnar phase is stable for bowl shapes ranging from infinitely thin bowls to surprisingly shallow bowls. … the phase diagram features four novel crystal phases and a region where the stable fluid contains worm-like stacks."

"… We have developed a novel method of studying the melting of RNAs with temperature by computationally sampling the distribution of the RNA structures at various temperatures using the RNA folding software Vienna. In this study, we compared the thermosensing property of 100 randomly selected mRNAs and three well known thermometers…"

"We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word has length k is complete for the complexity class DP. This result answers a question posed by Volkov. For the search problems of finding a shortest reset word and the length of a shortest reset word, we establish membership in the complexity classes FP^NP and FP^NP[log], respectively. Moreover, we show that both these problems are hard for FP^NP[log]. Finally, we observe that computing a reset word of a given length is FNP-complete."

"Here we propose a generic mechanism – networked buffering – for generating robust traits in complex systems that requires two basic conditions to be satisfied: 1) agents are versatile enough to perform more than one single functional role within a system and 2) agents are degenerate, i.e. there exists partial overlap in the functional capabilities of agents. Given these prerequisites, degenerate systems can readily produce a distributed systemic response to local perturbations. Reciprocally, excess resources related to a single function can indirectly support multiple unrelated functions within a degenerate system.…"

"This paper presents a complex systems overview of a power grid network. In recent years, concerns about the robustness of the power grid have grown because of several cascading outages in different parts of the world. In this paper, cascading effect has been simulated on three different networks, the IEEE 300 bus test system, the IEEE 118 bus test system, and the WSCC 179 bus equivalent model, using the DC Power Flow Model. Power Degradation has been discussed as a measure to estimate the damage to the network, in terms of load loss and node loss. A network generator has been developed to generate graphs with characteristics similar to the IEEE standard networks and the generated graphs are then … have been suggested."

"We apply multiple testing procedures to the validation of estimated default probabilities in credit rating systems. The goal is to identify rating classes for which the probability of default is estimated inaccurately, while still maintaining a predefined level of committing type I errors as measured by the familywise error rate (FWER) and the false discovery rate (FDR). For FWER, we also consider procedures that take possible discreteness of the data resp. test statistics into account. The performance of these methods is illustrated in a simulation setting and for empirical default data."

"The major challenge in designing a discriminative learning algorithm for predicting structured data is to address the computational issues arising from the exponential size of the output space. Existing algorithms make different assumptions to ensure efficient, polynomial time estimation of model parameters. For several combinatorial structures, including cycles, partially ordered sets, permutations and other graph classes, these assumptions do not hold. In this thesis, we address the problem of designing learning algorithms for predicting combinatorial structures by introducing two new assumptions: (i) The first assumption is that a particular counting problem can be solved efficiently. The consequence is a generalisation of the classical ridge regression for structured prediction. (ii) The second assumption is that a particular sampling problem can be solved efficiently. …"

"I'm not an economist, but we've got five applicants for every single job opening. If you tell me that the best response to that situation is to lay off hundreds of thousands of teachers, I will not accept that this means that you're smarter and more expert than I am. I will instead conclude — regardless of your prestige or position or years of study — that you're a moral imbecile. And knowing what I know about your inability to make moral judgments I will have no reason to trust you to make complicated macroeconomic ones."

"The Lin-Kernighan heuristic is known to be one of the most successful heuristics for the Traveling Salesman Problem (TSP). It has also proven its efficiency in application to some other problems. In this paper we discuss possible adaptations of TSP heuristics for the Generalized Traveling Salesman Problem (GTSP) and focus on the case of the Lin-Kernighan algorithm. At first, we provide an easy-to-understand description of the original Lin-Kernighan heuristic. Then we propose several adaptations, both trivial and complicated. Finally, we conduct a fair competition between all the variations of the Lin-Kernighan adaptation and some other GTSP heuristics. It appears that our adaptation of the Lin-Kernighan algorithm for the GTSP reproduces the success of the original heuristic. Different variations of our adaptation outperform all other heuristics in a wide range of trade-offs between solution quality and running time, making Lin-Kernighan the state-of-the-art GTSP local search."

"Each time-series has its own linear trend, the directionality of a timeseries, and removing the linear trend is crucial to get the more intuitive matching results. Supporting the linear detrending in subsequence matching is a challenging problem due to a huge number of possible subsequences. In this paper we define this problem the linear detrending subsequence matching and propose its efficient index-based solution. To this end, we first present a notion of LD-windows (LD means linear detrending), which is obtained as follows: we eliminate the linear trend from a subsequence rather than each window itself and obtain LD-windows by dividing the subsequence into windows. Using the LD-windows we then present a lower bounding theorem for the index-based matching solution and formally prove its correctness.…"

"In the social sciences, it is useful to understand the relative similarities of concepts that are embedded in a particular text (from a particular group or a particular person). For example, in trying to estimate conservative bias in FoxNews, one might estimate its tendency to associate conservative concepts (conservative, republican) and good concepts (good, positive, etc.), compared to conservative and bad concepts. The output would indicate conservative favoritism. This comparison could be further refined by taking into account important "baseline" information about the valences associated with liberal, namely liberal and good in comparison to liberal and bad.…"

Sometimes physics is just pretty.

"The Open Enterprise is a new organizational design. Unlike organizations using traditional management structures, Open Enterprises replace the command and control hierarchy with a meritocracy based on collaboration and open participation.

Organizations that adopt this new organizational structure can make decisions faster and respond quicker to their markets. They look more like living dynamic networks, and less like pyramids. People working in these organizations will have (and feel) more ownership. They’re more engaged in their work, and have the freedom to work on what they want, when they want to. Most importantly this model enables people to once again bring their full humanity – values, beliefs and passions – to the workplace, removing disconnect between organizational and personal values"

Specifically: "Genome-wide association study of hair length in dogs"

"The human immune system has numerous properties that make it ripe for exploitation in the computational domain, such as robustness and fault tolerance, and many different algorithms, collectively termed Artificial Immune Systems (AIS), have been inspired by it. Two generations of AIS are currently in use, with the first generation relying on simplified immune models and the second generation utilising interdisciplinary collaboration to develop a deeper understanding of the immune system and hence produce more complex models. Both generations of algorithms have been successfully applied to a variety of problems, including anomaly detection, pattern recognition, optimisation and robotics.…"

"This paper is concerned with designing self-driven fitness functions for Embedded Evolutionary Robotics. The proposed approach considers the entropy of the sensori-motor stream generated by the robot controller. This entropy is computed using unsupervised learning; its maximization, achieved by an on-board evolutionary algorithm, implements a "curiosity instinct", favouring controllers visiting many diverse sensori-motor states (sms). Further, the set of sms discovered by an individual can be transmitted to its offspring, making a cultural evolution mode possible. Cumulative entropy (computed from ancestors and current individual visits to the sms) defines another self-driven fitness; its optimization implements a "discovery instinct", as it favours controllers visiting new or rare sensori-motor states. Empirical results on the benchmark problems proposed by Lehman and Stanley (2008) comparatively demonstrate the merits of the approach."

"Music composition used to be a pen and paper activity. These these days music is often composed with the aid of computer software, even to the point where the computer compose parts of the score autonomously. The composition of most styles of music is governed by rules. We show that by approaching the automation, analysis and verification of composition as a knowledge representation task and formalising these rules in a suitable logical language, powerful and expressive intelligent composition tools can be easily built. …"

"… Using wireless sensor network technology, we obtained high-resolution data of CPIs during a typical day at an American high school, permitting the reconstruction of the social network relevant for infectious disease transmission. At a 94% coverage, we collected 762,868 CPIs at a maximal distance of 3 meters among 788 individuals. The data revealed a high density network with typical small world properties and a relatively homogenous distribution of both interaction time and interaction partners among subjects.…"

"The goal of this work is to provide an empirical basis for research on image segmentation and boundary detection. To this end, we have collected 12,000 hand-labeled segmentations of 1,000 Corel dataset images from 30 human subjects. Half of the segmentations were obtained from presenting the subject with a color image; the other half from presenting a grayscale image. The public benchmark based on this data consists of all of the grayscale and color segmentations for 300 images. The images are divided into a training set of 200 images, and a test set of 100 images."

"We present a novel algorithm for segmentation of natural images that harnesses the principle of minimum description length (MDL). Our method is based on observations that a homogeneously textured region of a natural image can be well modeled by a Gaussian distribution and the region boundary can be effectively coded by an adaptive chain code. The optimal segmentation of an image is the one that gives the shortest coding length for encoding all textures and boundaries in the image, and is obtained via an agglomerative clustering process applied to a hierarchy of decreasing window sizes as multi-scale texture features. The optimal segmentation also provides an accurate estimate of the overall coding length and hence the true entropy of the image. We test our algorithm on the publicly available Berkeley Segmentation Dataset. It achieves state-of-the-art segmentation results compared to other existing methods."

I wonder to what extent this sort of thing might be useful in heuristics for Pareto-ranking

"In this paper, we briefly review the concept of memory circuit elements, namely memristors, memcapacitors and meminductors, and then discuss some applications by focusing mainly on the first class. We present several examples, their modeling and applications ranging from analog programming to biological systems. Since the phenomena associated with memory are ubiquitous at the nanoscale, we expect the interest in these circuit elements to increase in coming years."

"…The intrinsic underlying structure of the system is modeled by an epsilon-machine and its causal states. The decisional states are the emerging patterns corresponding to the utility function. In a complex systems perspective, these patterns thus form a partition of the lower-level system states that is defined according to the higher-level user's knowledge. The transitions between these decisional states correspond to events that lead to a change of decision. An algorithm is provided so as to estimate the states and their transitions from data. Application examples are given for hidden model reconstruction, cellular automata filtering, and edge detection in images."

"A still more realistic and subtle, but much more troublesome scenario: Financial Undetectable Journalistic Engineering (FUJE). Financial news journalists could word the reports differently and send very different signals to the robot army. Here're two actual news headlines re. the May NFP number (incidentally, both are from the same outlet, same day, different reporter — just a random google search):

US adds 431,000 jobs in May, unemployment down to 9.7 pct
vs.

Despite Adding 431K Jobs, May Non-Farm Payroll Figures Disappoint
The first is factual; the second contains more in-depth analysis. It takes an experienced human to parse and reconcile the two. You can see how robot readers may assign opposite signs to each."

"Sparse modeling is a powerful framework for data analysis and processing. Traditionally, encoding in this framework is performed by solving an L1-regularized linear regression problem, commonly referred to as Lasso or Basis Pursuit. In this work we combine the sparsity-inducing property of the Lasso model at the individual feature level, with the block-sparsity property of the Group Lasso model, where sparse groups of features are jointly encoded, obtaining a sparsity pattern hierarchically structured. This results in the Hierarchical Lasso (HiLasso), which shows important practical modeling advantages.…"

"… In this paper, we provide a formal introduction to riffled independence and present algorithms for using riffled independence within Fourier-theoretic frameworks which have been explored by a number of recent papers. Additionally, we propose an automated method for discovering sets of items which are riffle independent from a training set of rankings. We show that our clustering-like algorithms can be used to discover meaningful latent coalitions from real preference ranking datasets and to learn the structure of hierarchically decomposable models based on riffled independence."

"Inferential summaries of tree estimates are useful in the setting of evolutionary biology, where phylogenetic trees have been built from DNA data since the 1960's. In bioinformatics, psychometrics and data mining, hierarchical clustering techniques output the same mathematical objects, and practitioners have similar questions about the stability and `generalizability' of these summaries. This paper provides an implementation of the geometric distance between trees developed by Billera, Holmes and Vogtmann (2001) [BHV] equally applicable to phylogenetic trees and hieirarchical clustering trees, and shows some of the applications in statistical inference for which this distance can be useful.…Our method gives a new way of evaluating the influence both of certain columns (positions, variables or genes) and of certain rows (whether species, observations or arrays)."

"It is now clear that cladistics can be applied and be useful to the study of galaxy diversification. Many difficulties, conceptual and practical, have been solved,. Significant astrophysical results have been obtained and will be extended to larger samples of galaxies and globular clusters. However, many paths remain in the exploration of this new and large field of research."

will I ever understand all the effort statisticians put into what I consider a solved problem? Pareto-GP is apparently utterly unknown, still

"A widely used tool in the study of risk, insurance and extreme values is the mean excess plot. One use is for validating a generalized Pareto model for the excess distribution. This paper investigates some theoretical and practical aspects of the use of the mean excess plot."

"Monte Carlo methods play an important role in scientific computation, especially when problems have a vast phase space. In this chapter an introduction to the Monte Carlo method is given. Concepts such as Markov chains, detailed balance, critical slowing down, and ergodicity, as well as the Metropolis algorithm are explained. The Monte Carlo method is illustrated by numerically studying the critical behavior of the two-dimensional Ising ferromagnet using finite-size scaling methods. Furthermore, advanced Monte Carlo methods are described (parallel tempering Monte Carlo) and illustrated with nontrivial models from the physics of glassy systems."

"The beam-splitting method for fine-heterogeneity cor- rection will inevitably multiply beams to transport and thus will slow down dose calculation. With the GDS al- gorithm, the dose convolution is made only once after all the beams have been transported, which minimizes the impact of the beam multiplication on computing time. In fact, for the beams individually split into several tens, the calculation time increased only by several times with the GDS. This algorithmic framework will thus enable fast and accurate treatment planning of heavy charged particle ra- diotherapy in the presence of density heterogeneity finer than the size of intrinsic beam blurring."

"Many fixed-parameter tractable algorithms using a bounded search tree have been repeatedly improved, often by describing a larger number of branching rules involving an increasingly complex case analysis. We introduce a novel and general branching strategy that branches on the forbidden subgraphs of a relaxed class of graphs. By using the class of P4-sparse graphs as the relaxed graph class, we obtain efficient bounded-search tree algorithms for several parameterized deletion problems. For the cograph edge-deletion problem and the trivially perfect edge-deletion problem, the branching strategy yields the first non-trivial bounded-search tree algorithms. For the cograph vertex deletion problem, the running time of our simple bounded search algorithm matches those previously designed with the help of complicated case distinctions and non-trivial running time analysis [16] and computer-aided branching rules [7]"

"Ron Doerfler has created a truly gorgeous 2010 calendar titled The Age of Graphical Computing. Ron has transformed nomography into a form of art."

"Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even trivial. A natural step, outstanding thus far, was to provide a broad classification of graphs that make for polynomial or NP-complete instances. We provide such a classification based on the set of allowed vertex degrees in the input graphs, yielding a full dichotomy on the complexity of the problem. As byproducts, the previous NP-completeness result for binary trees was strengthened to strictly binary trees, and the three-dimensional version of the problem was for the first time proven to be NP-complete. Our results were made possible by introducing the concepts of consistent orientations and robust gadgets, and by showing how the former allows NP-completeness proofs by local replacement even in the absence of the latter."

"We consider the problem of choosing between several models in least-squares regression with heteroscedastic data. We prove that any penalization procedure is suboptimal when the penalty is a function of the dimension of the model, at least for some typical heteroscedastic model selection problems. In particular, Mallows' Cp is suboptimal in this framework. On the contrary, optimal model selection is possible with data-driven penalties such as resampling or $V$-fold penalties. Therefore, it is worth estimating the shape of the penalty from data, even at the price of a higher computational cost. Simulation experiments illustrate the existence of a trade-off between statistical accuracy and computational complexity. As a conclusion, we sketch some rules for choosing a penalty in least-squares regression, depending on what is known about possible variations of the noise-level."

"…This idea arises from previous works in which computational models of self-assembly were subject to evolutionary design in order to perform the automatic construction of user-defined structures. Then, the aim of this paper is to present a novel methodology for the automated design of heuristics by means of self-assembly."

"The rigorous theoretical analyses of algorithms for #SAT have been proposed in the literature. As we know, previous algorithms for solving #SAT have been analyzed only regarding the number of variables as the parameter. However, the time complexity for solving #SAT instances depends not only on the number of variables, but also on the number of clauses. Therefore, it is significant to exploit the time complexity from the other point of view, i.e. the number of clauses. In this paper, we present algorithms for solving #2-SAT and #3-SAT with rigorous complexity analyses using the number of clauses as the parameter. By analyzing the algorithms, we obtain the new worst-case upper bounds O(1.1892m) for #2-SAT and O(1.4142m) for #3-SAT, where m is the number of clauses."

"Phylogenetic trees and networks are leaf-labelled graphs that are used to describe evolutionary histories of species. The Tree Containment problem asks whether a given phylogenetic tree is embedded in a given phylogenetic network. Given a phylogenetic network and a cluster of species, the Cluster Containment problem asks whether the given cluster is a cluster of some phylogenetic tree embedded in the network. Both problems are known to be NP-complete in general.…"

"… Kanso claims there is no efficient attack against the ASG(r,s) since r and s are kept secret. In this paper, we present an Alternating Step Generator, ASG, model for the ASG(r,s) and also we present a new and efficient algebraic attack on ASG(r,s) using 3(m+n) bits of the output sequence to find the secret key with O((m^2+n^2)*2^{l+1}+ (2^{m-1})*m^3 + (2^{n-1})*n^3) computational complexity. We show that this system is no more secure than the original ASG, in contrast to the claim of the ASG(r,s)'s constructor."

seems like one could search for heuristics (and full algorithms) which can tell you whether two configuration matrices might describe the same skew configuration, &c

"The paper is written in the form of introduction to the subject, with much of the material accessible to advanced high school students. However, in the part of the survey concerning configurations of lines in general position in the three-dimensional space the exposition is free from any background restrictions. We have added few new results, fixed few misprints and terminological inaccuracies and expanded the reference list. Notice that some of the results presented in the paper appeared in other papers without appropriate references."

"Evolutionary adaptation is the process that increases the fit of a population to the fitness landscape it inhabits. As a consequence, evolutionary dynamics is shaped, constrained, and channeled, by that fitness landscape. Much work has been expended to understand the evolutionary dynamics of adapting populations, but much less is known about the structure of the landscapes. Here, we study the global and local structure of complex fitness landscapes of interacting loci that describe protein folds or sets of interacting genes forming pathways or modules. We find that in these landscapes, high peaks are more likely to be found near other high peaks, corroborating Kauffman's "Massif Central" hypothesis. We study the clusters of peaks as a function of the ruggedness of the landscape and find that this clustering allows peaks to form interconnected networks.…"

"The feed-forward relationship naturally observed in time-dependent processes and in a diverse number of real systems -such as some food-webs and electronic and neural wiring- can be described in terms of so-called directed acyclic graphs (DAGs). An important ingredient of the analysis of such networks is a proper comparison of their observed architecture against an ensemble of randomized graphs, thereby quantifying the {\em randomness} of the real systems with respect to suitable null models. This approximation is particularly relevant when the finite size and/or large connectivity of real systems make inadequate a comparison with the predictions obtained from the so-called {\em configuration model}. In this paper we analyze four methods of DAG randomization as defined by the desired combination of topological invariants (directed and undirected degree sequence and component distributions) aimed to be preserved.…"

"In this paper, we consider the problem of blocking malicious traffic on the Internet, via source-based filtering. In particular, we consider filtering via access control lists (ACLs): these are already available at the routers today but are a scarce resource because they are stored in the expensive ternary content addressable memory (TCAM). Aggregation (by filtering source prefixes instead of individual IP addresses) helps reduce the number of filters, but comes also at the cost of blocking legitimate traffic originating from the filtered prefixes. We show how to optimally choose which source prefixes to filter, for a variety of realistic attack scenarios and operators' policies. In each scenario, we design optimal, yet computationally efficient, algorithms. Using logs from Dshield.org, we evaluate the algorithms and demonstrate that they bring significant benefit in practice."

"We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a "least action principle" which characterizes the odometer function of the growth process. Starting from an educated guess for the odometer, we successively correct under- and overestimates and provably arrive at the correct final state. The degree of speedup depends on the accuracy of the initial guess.
Determining the size of the boundary fluctuations in internal diffusion-limited aggregation is a long-standing open problem in statistical physics. As an application of our method, we calculate the size of fluctuations over two orders of magnitude beyond previous simulations. Our data strongly support the conjecture that the fluctuations are logarithmic in the radius."

"This would seem to argue that some old patterns endure, and that’s true. But think of the twists suggested by this new premium on human basics. Suppose you decided that you could get all the face-to-face you needed two days a week. Would that influence where you lived? Would the mountains or the shore start looking good to you? Suppose you decided that you could get all the face-to-face you needed three days a month. Would the Caribbean start looking good to you?"

"If the government can take over giant global insurer AIG and the auto giant General Motors and replace their CEOs, in order to keep them financially solvent, it should be able to put BP’s north American operations into temporary receivership in order to stop one of the worst environmental disasters in U.S. history."

I want to make this sort of thing less newsworthy.

"Object orientation provides a flexible framework for the implementation of the convolution of arbitrary distributions of real-valued random variables.
We discuss an algorithm which is based on the Discrete Fourier Transformation and its fast computability via the Fast Fourier Transformation. It directly applies to lattice-supported distributions. In the case of continuous distributions an additional discretization to a linear lattice is necessary and the resulting lattice-supported distributions are suitably smoothed after convolution."

"No matter who is technically in control of the company, i.e. receivership or not, the one thing that is needed is for the government to have the authority it needs to force the company to fully disclose all the information it has about the leak, and about how to stop it. It also needs to be able to force the company to take particular actions to stop the leak even if the actions demand so many resources it results in the company going bankrupt.…"

"Ardmore's experiment with its own local currency will be more than just a summer fling.

Four community banks have agreed to contribute a total of $10,000 to fund a return of Ardmore's Downtown Dollars for the holiday shopping season."

"The most recent version of Protovis, the open-source visualization library that uses JavaScript and SVG, was just released not too long ago – this time with more layout and examples. This is especially helpful since Protovis was "designed to be learned by example." Among the new stuff is the ever popular streamgraphs, along with the force-directed layout. With only 10 to 20 lines of code, you'll have your viz, so lots of bang for the buck."

"For instance, there is the Rogue Factory unit producing "custom high-tech goods"—but "what would the black market of 'special orders' look like?" Benque asks. This "black market of 'special orders'" for things like 3D-printed human organs would also be something quite extraordinary to see, given another two decades' time and cheap-enough bio-ink."

awesome

"SEI accuses FASB of acting like a monopoly. “Because FASB is a monopolist in the market for establishing financial accounting standards, their reliance on these terms constitutes a monopolistic position and restraint of trade,” said Narancic. “Relying on these terms, they’re effectively taking out a competitor, doing so unlawfully and based on unconscionable contract terms.”

The complaint acknowledges that FASB has been working with the International Accounting Standards Board on converging accounting standards and forming a global standard-setter, and that there are other groups involved in setting standards."

"Are "willful and flagrant violation" of safety and "intentional disregard" of safety criminal acts? Can they be criminal only if someone is injured or dies? These are questions that need to be addressed."

"Riff is a a recent spin-off project from Jesse Sielaff’s work to bring a Ruby-like language interpreter to the browser. Riff is a plugin for Racc (a LARL(1) parser generator for Ruby). Riff extends the output generation portions of Racc and writes javascript instead of Ruby. If you’re familiar with LALR grammars this should add a handy tool to your javascript arsenal."

"In addition to placing effective checks on the power of the captain, pirate government also provided harmony amongst the crewmembers. Harmony was essential to the business of piracy; pirates who got along with one another stood a better chance of success in their ventures. The author writes that, "Contrary to popular wisdom, pirate life was orderly and honest" (45). In order to maintain order and ensure honesty, pirates drew up "Codes," which outlined shipboard rules and regulations, and provided incentives to maximize individual effort. Each crew drew up its own constitution and ratified it by unanimous consent. …"

"Everything we create should aspire to this, should leave us – as programmers – wondering if that’s all and if we shouldn’t perhaps add a bit more. Scott Berkun (a genius and a craftsman) said all of this more than ten years ago and I’ve known about it for at least half that time, but it hasn’t really changed the way I write software because it’s too hard to just know when something’s simple enough."

"During the century separating the 1830s from the 1930s, proponents of laissez-faire were so successful in advocating an economy that purportedly operated independent of the political system that New Deal supporters had to convince voters that the government could (and should) intervene economically on behalf of suffering Americans. In the 1930s, Dorothea Lange used a technology unavailable in 1837 to photograph the plight of economic victims in her composition "Migrant Mother." Shot in a California pea picker's camp during the Great Depression for the government's Farm Security Administration, the photograph is strikingly similar to "Specie Claws." The posture of the central characters is nearly identical. Both pictures appeal to emotion to make an argument about the effects of economic events on families.…"

"… This was not because they doubted whether there was a moral imperative to pay one's debts. Rather, they were shocked to see the idea of bank credit, based as it was on getting something for nothing, vying for the moral high ground. Credit of this sort was a speculation. Allowing it to flourish was one thing; granting it not only legitimacy, but moral status was horrific. If people were taught to consider their relationship with their banker as analogous to their obligations toward family, community, and state, the multitudes would indeed have come to ruin."

"… The Panic of 1837 launched America's biggest and most consequential economic depression before the Civil War. And it was the decisions and behavior of thousands of actors like Bieller that created a perfect financial storm: bringing an end to one kind of capitalist boom; destroying the confidence of the slaveholding class, impoverishing millions of workers and farmers who were linked to the global economy; demolishing the already disrupted lives of hundreds of thousands of people like Harry and Roberson.…"

"What, then, is the status of the crisis/knowledge nexus today, especially in light of an ascendant neo-liberalism that criticizes the earlier notions of social justice and obligation? Crisis continues to be capitalism's mode of operation. According to Naomi Klein's recent "disaster capitalism" argument, emergencies around the globe, including natural catastrophes, are now used to impose radical free-market policies. As for knowledge, government- and business-produced information is omnipresent and effortlessly accessible. Expert culture is thriving.…"

'An experienced investment manager said it well: “The best time to buy stocks is when you hear the term, ‘stock market,’ and you want to throw up.”'

"The folks at CreditSuisse have created a new figure making this point by re-ranking sovereigns according to credit risk based on this multifactor model. The upshot is that China, Germany, Switzerland, the U.S., Australia, Japan, and Canada lead the way in terms of least sovereign credit risk. Agree or disagree with the absolute levels from the model, the point stands that naive models of sovereign risk are mostly fodder for idiotic headline writers, not helpful standalone measures for assessing real risk."

"We overview our recently introduced theory of n-fold integer programming which enables the polynomial time solution of fundamental linear and nonlinear integer programming problems in variable dimension. We demonstrate its power by obtaining the first polynomial time algorithms in several application areas including multicommodity flows and privacy in statistical databases."

"Where does this all leave us? The rest of the world is intent on pursuing a begger thy neighbor strategy, with the US being the neighbor. I suspect US policymakers will eventually relent; it will be the only choice left. All we can do now is sit back and wait for the inevitable explosion in the US trade deficit, waiting idly by for the next crisis and the "chance" to bring some sanity to the global financial architecture."

"We've all heard it: according to Hal Varian, statistics is the next sexy job. Five years ago, in What is Web 2.0, Tim O'Reilly said that "data is the next Intel Inside." But what does that statement mean? Why do we suddenly care about statistics and about data?

In this post, I examine the many sides of data science — the technologies, the companies and the unique skill sets."

"This memo considers three radical ideas applying to the Web, not necessarily as serious proposals (although given support they could be turned into such) but as thought experiments or fantasies meant to sharpen the discussion of the "meaning" of URIs and other current issues of web architecture. The first fantasy is the idea that a URI's meaning is in how it is used, not what it "identifies". The second is the prospect of second sourcing for URI behavior. The third is the idea of encyclopedia-style documentation for URIs."

"The population annealing algorithm introduced by Hukushima and Iba is described. Population annealing combines simulated annealing and Boltzmann weighted differential reproduction within a population of replicas to sample equilibrium states. Population annealing gives direct access to the free energy. It is shown that unbiased measurements of observables can be obtained by weighted averages over many runs with weight factors related to the free energy estimate from the run. Population annealing is well suited to parallelization and may be a useful alternative to parallel tempering for systems with rough free energy landscapes such as spin glasses. The method is demonstrated for spin glasses."

"This article presents a generic method to solve 2D multi-objective placement problem for free-form components. The proposed method is a relaxed placement technique combined with an hybrid algorithm based on a genetic algorithm and a separation algorithm. The genetic algorithm is used as a global optimizer and is in charge of efficiently exploring the search space. The separation algorithm is used to legalize solutions proposed by the global optimizer, so that placement constraints are satisfied. A test case illustrates the application of the proposed method. Extensions for solving the 3D problem are given at the end of the article."

"Central Force Optimization is a global search and optimization algorithm that searches a decision space be flying "probes" whose trajectories are deterministically computed using two equations of motion. Because it is possible for a probe to fly outside the domain of feasible solutions, a simple errant probe retrieval method has been used previously that does not include the directional information contained in a probe's acceleration vector. This note investigates the effect of adding directionality to the "repositioning factor" approach. As a general proposition, it appears that doing so does not improve convergence speed or accuracy. In fact, adding directionality to the original errant probe retrieval scheme appears to be highly inadvisable. Nevertheless, there may be alternative probe retrieval schemes that do benefit from directional information, and the results reported here may assist in or encourage their development."

"Schoening presents a simple randomized algorithm for (d,k)-CSP problems with running time (d(k-1)/k)^n poly(n). Here, d is the number of colors, k is the size of the constraints, and n is the number of variables. A derandomized version of this, given by Dantsin et al., achieves a running time of (dk/(k+1))^n poly(n), inferior to Schoening's. We come up with a simple modification of the deterministic algorithm, achieving a running time of (d(k-1)/k * k^d/(k^d-1))^n \poly(n). Though not completely eleminating the gap, this comes very close to the randomized bound for all but very small values of d. Our main idea is to define a graph structure on the set of d colors to speed up local search."

"One of the most important issues in Information Retrieval is inferring the intents underlying users' queries. Thus, any tool to enrich or to better contextualized queries can proof extremely valuable. Entity extraction, provided it is done fast, can be one of such tools. Such techniques usually rely on a prior training phase involving large datasets. That training is costly, specially in environments which are increasingly moving towards real time scenarios where latency to retrieve fresh informacion should be minimal. In this paper an `on-the-fly' query decomposition method is proposed. It uses snippets which are mined by means of a na\"ive statistical algorithm. An initial evaluation of such a method is provided, in addition to a discussion on its applicability to different scenarios."

"This paper introduces the FLOSS Free Libre Open Source Software [VEMSA3D], a contraction of "Visual Electromagnetic Simulator for 3D Antennas", which are geometrically modeled, either exactly or approximately, as thin wire polygonal structures; presents its GUI Graphical User Interface capabilities, in interactive mode and/or in handling suitable formed antenna data files; demonstrates the effectiveness of its use in a number of practical antenna applications, with direct comparison to experimental measurements and other freeware results; and provides the inexperienced user with a specific list of instructions to successfully build the given source code by using only freely available IDE Integrated Development Environment tools-including a cross-platform one.…"

"Actually, the snarXiv only gen er ates tan ta liz ing titles and abstracts at the moment, while the arXiv deliv ers match ing papers as well. Details of the implemen ta tion are below.[2] I’m the author, and I don’t remem ber exactly why I decided to do this. I did already have the frame work lying around from a pre vi ous project, and I swear I spent more time doing research last week end than imple ment ing snarXiv.org."

"This paper proposes a new probabilistic classification algorithm using a Markov random field approach. The joint distribution of class labels is explicitly modelled using the distances between feature vectors. Intuitively, a class label should depend more on class labels which are closer in the feature space, than those which are further away.…"

"We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems include submodular load balancing, which generalizes load balancing or minimum-makespan scheduling, submodular sparsest cut and submodular balanced cut, which generalize their respective graph cut problems, as well as submodular function minimization with a cardinality lower bound.…"

"We prove that it is NP-hard to decide whether two points in a polygonal domain with holes can be connected by a wire. This implies that finding any approximation to the shortest path for a long snake amidst polygonal obstacles is NP-hard. On the positive side, we show that snake’s problem is ”length-tractable”: if the snake is ”fat”, i.e., its length/width ratio is small, the shortest path can be computed in polynomial time."

'*Platforms that crowdsource the creation of ideas. The idea here is to organize groups of people to innovate, develop new ideas, and solve problems that have eluded organizations that have attempted these things on their own. There are lots of examples of this, from the famed InnoCentive site (most recent challenge: clever solutions for responding to recent oil spill in the Gulf of Mexico); to the $1 million Netflix competition (which enabled the company to develop a superior recommendations system); to the very recent $1 million Edmunds Toyota Prius challenge (“re-create unintended acceleration in a car and then solve that problem and prove the whole thing to us”), to the many experiments that are being conducted at Ideascale, a platform that “empowers communities to drive innovation” by enabling them to collect ideas from “customers, give them a platform to vote, the most important ideas bubble to the top.”'

"Motivated by a broad range of potential applications, we address the quantile prediction problem of real-valued time series. We present a sequential quantile forecasting model based on the combination of a set of elementary nearest neighbor-type predictors called "experts" and show its consistency under a minimum of conditions. Our approach builds on the methodology developed in recent years for prediction of individual sequences and exploits the quantile structure as a minimizer of the so-called pinball loss function. We perform an in-depth analysis of real-world data sets and show that this nonparametric strategy generally outperforms standard quantile prediction methods"

"The extremal index parameter theta characterizes the degree of local dependence in the extremes of a stationary time series and has important applications in a number of areas, such as hydrology, telecommunications, finance and environmental studies.…Further, a procedure for the automatic selection of its tuning parameter is developed and different types of confidence intervals that prove useful in practice proposed. The performance of the estimator is examined through simulations, which show its highly competitive behavior. Finally, the estimator is applied to three real data sets of daily crude oil prices, daily returns of the S&P 500 stock index, and high-frequency, intra-day traded volumes of a stock. These applications demonstrate additional diagnostic features of statistical plots based on the new estimator."

"I am listening to a presentation at the Homer Hoyt meetings on the condo meltdown in South Florida. Developers planned on building 95,000 units in the city of Miami between 2002 and 2007. In the 2000 census, the whole city had 163,000 units."

"Research into properties of heterogeneous artificial materials, consisting of arrangements of rigid scatterers embedded in a medium with different elastic properties, has been intense throughout last two decades. The capability to prevent the transmission of waves in predetermined bands of frequencies -called bandgaps- becomes one of the most interesting properties of these systems, and leads to the possibility of designing devices to control wave propagation. The underlying physical mechanism is destructive Bragg interference. Here we show a technique that enables the creation of a wide bandgap in these materials, based on fractal geometries. We have focused our work in the acoustic case where these materials are called Phononic/Sonic Crystals (SC) but, the technique could be applied any types of crystals and wave types in ranges of frequencies where the physics of the process is linear."

"The optimization formulation considered in this paper uses a penalized negative Poisson log-likelihood objective function with nonnegativity constraints (since Poisson intensities are naturally nonnegative). In particular, the proposed approach incorporates key ideas of using separable quadratic approximations to the objective function at each iteration and penalization terms related to l1 norms of coefficient vectors, total variation seminorms, and partition-based multiscale estimation methods."

"The obtained results and trends suggest a number of further investigations. For instance, it would be interest- ing to consider other network models and measurements, as well as to assess the effect of different types of hard- ware, compilers and operating systems."

"Random numbers play a crucial role in science and industry. Many numerical methods require the use of random numbers, in particular the Monte Carlo method. Therefore it is of paramount importance to have efficient random number generators. The differences, advantages and disadvantages of true and pseudo random number generators are discussed with an emphasis on the intrinsic details of modern and fast pseudo random number generators. Furthermore, standard tests to verify the quality of the random numbers produced by a given generator are outlined. Finally, standard scientific libraries with built-in generators are presented, as well as different approaches to generate nonuniform random numbers. Potential problems that one might encounter when using large parallel machines are discussed."

"In many networks, vertices have hidden attributes, or types, that are correlated with the networks topology. If the topology is known but these attributes are not, and if learning the attributes is costly, we need a method for choosing which vertex to query in order to learn as much as possible about the attributes of the other vertices. We assume the network is generated by a stochastic block model, but we make no assumptions about its assortativity or disassortativity. We choose which vertex to query using two methods: 1) maximizing the mutual information between its attributes and those of the others (a well-known approach in active learning) and 2) maximizing the average agreement between two independent samples of the conditional Gibbs distribution. Experimental results show that both these methods do much better than simple heuristics. They also consistently identify certain vertices as important by querying them early on."

"We propose a fluctuation analysis to quantify spatial correlations in complex networks. The approach considers the sequences of degrees along shortest paths in the networks and quantifies the fluctuations in analogy to time series. In this work, the Barabasi-Albert (BA) model, the Cayley tree at the percolation transition, a fractal network model, and examples of real-world networks are studied. While the fluctuation functions for the BA model show exponential decay, in the case of the Cayley tree and the fractal network model the fluctuation functions display a power-law behavior. The fractal network model comprises long-range anti-correlations. The results suggest that the fluctuation exponent provides complementary information to the fractal dimension."

"Wealth is no proof of moral character; nor poverty of the want of it.

On the contrary, wealth is often the presumptive evidence of dishonesty; and poverty the negative evidence of innocence. If therefore property, whether little or much, be made a criterion, the means by which that property has been acquired ought to be made a criterion also."

"This means that each time the document is updated, the client will also store the previous version as an attachment to the latest version. At any time, a user can load any of the old versions."

"Community structure is one of the key properties of complex networks and plays a crucial role in their topology and function. While an impressive amount of work has been done on the issue of community detection, very little attention has been so far devoted to the investigation of communities in real networks. We present a systematic empirical analysis of the statistical properties of communities in large information, communication, technological, biological, and social networks. We find that the mesoscopic organization of networks of the same category is remarkably similar. This is reflected in several characteristics of community structure, which can be used as “fingerprints'' of specific network categories.…"

"… We find that SF networks generate oscillations much more easily than ER networks do, and this may explain why SF networks are more evolvable than ER networks are for oscillatory phenotypes. In spite of their greater evolvability, we find that networks with SFout topologies are also more robust to mutations than ER networks. Furthermore, the SFout topologies are more robust to changes in initial conditions (environmental robustness). For both topologies, we find that once a population of networks has reached the target state, further neutral evolution can lead to an increase in both the mutational robustness and the environmental robustness to changes in initial conditions."

"The Prediction API allows you to get more from your data and makes its patterns more accessible. Specifically, the Prediction API leverages Google's machine learning infrastructure to give you the tools to better analyze your data and reveal patterns that are often difficult to manually discover. The API also enables you to use those patterns to predict new outcomes, which facilitates the development of all types of software, from textual analysis systems to recommendation systems. Because the Prediction API is a RESTful HTTP service, you can easily access it from Google App Engine, Apps Script, and other Internet-connected desktop applications."

"Heterogeneity in the degree distribution is known to suppress global synchronization in complex networks of symmetrically coupled oscillators. Scale-free networks present strong heterogeneity, there are a few highly connected nodes, termed hubs, while the majority of nodes has only a few connections. We show that a stable partially synchronized state may take place in scale-free networks: hubs undergo a transition to synchronization while the remaining nodes are unsynchronized. This phenomenon may occur in any large heterogeneous network, regardless of the network global synchronization properties. We provide theory and numerical evidence to establish this phenomenon."

"… In this paper we present BRACE (Big Red Agent-based Computation Engine), which extends the MapReduce framework to process these simulations efficiently across a cluster. We can leverage spatial locality to treat behavioral simulations as iterated spatial joins and greatly reduce the communication between nodes. In our experiments we achieve nearly linear scale-up on several realistic simulations.…"

"A wide family of nonlinear sequence generators, the so-called clock-controlled shrinking generators, has been analyzed and identified with a subset of linear cellular automata. The algorithm that converts the given generator into a linear model based on automata is very simple and can be applied in a range of practical interest. Due to the linearity of these automata as well as the characteristics of this class of generators, a cryptanalytic approach can be proposed. Linear cellular structures easily model keystream generators with application in stream cipher cryptography."

"Connections in complex networks are inherently fluctuating over time and exhibit more dimensionality than analysis based on standard static graph measures can capture. Here, we introduce the concepts of temporal paths and distance in time-varying graphs. We define as temporal small world a time-varying graph in which the links are highly clustered in time, yet the nodes are at small average temporal distances. We explore the small-world behavior in synthetic time-varying networks of mobile agents, and in real social and biological time-varying systems."

"The inverse Ising problem is a difficult combinatorial optimization problem in the class known as “NP-hard”. In theory, only approximate schemes, or methods that take more than polynomial time to find the answer are possible. Boltzmann Learning [1] is an iterative method where in one step the correlation functions are computed given an Ising model, and in another step the Ising model couplings are modified to adjust to data. In principle, Boltzmann learning can be employed to find the couplings with arbi- trary accuracy given accurate data and sufficient time, but the slow convergence of the Boltzmann learning makes it a very inefficient algorithm for most practical purposes."

"Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions reliably. Large and rich sets of features can cause existing algorithms to overfit because of a limited number of samples. We address this shortcoming using $L_1$ regularization in approximate linear programming. Because the proposed method can automatically select the appropriate richness of features, its performance does not degrade with an increasing number of features. These results rely on new and stronger sampling bounds for regularized approximate linear programs. We also propose a computationally efficient homotopy method. The empirical evaluation of the approach shows that the proposed method performs well on simple MDPs and standard benchmark problems."

"There seems to be a brief recognition period for Bdellovibrio to identify its prey after a collision with another cell (Shilo, 1969). Initially, the attachment to a cell surface is reversible. Bdellovibrio is still able to swim away a few seconds after recognizing that the cell is not a right target (gram- positive bacteria). When a gram-negative bacterium is encountered, Bdellovibrio cell becomes committed to invasion. The whole process usually takes around 5 – 10 minutes. Bdellovibrio drops its flagellum. It has been hypothesized that Bdellovibrio may adhere to the cell surface using pilus-like fibre structure expressed on its penetration pole."

"Small world networks interpolate between fully regular and fully random topologies and simultaneously exhibit large local clustering as well as short average path length. Small world topology has therefore been suggested to support network synchronization. Here we study the asymptotic speed of synchronization of coupled oscillators in dependence on the degree of randomness of their interaction topology in generalized Watts-Strogatz ensembles. We find that networks with fixed in-degree synchronize faster the more random they are, with small worlds just appearing as an intermediate case. For any generic network ensemble, if synchronization speed is at all extremal at intermediate randomness, it is slowest in the small world regime. This phenomenon occurs for various types of oscillators, intrinsic dynamics and coupling schemes."

"Empirical studies show that real world networks often exhibit multiple scales of topological descriptions. However, it is still an open problem how to identify the intrinsic multiple scales of networks. In this article, we consider detecting the multi-scale community structure of networks from the perspective of dimension reduction. …Theoretical analysis indicates that all these three transformations are crucial to identify the multi-scale community structure of networks. Extensive tests on real world and artificial networks demonstrate that the correlation matrix significantly outperforms the modularity matrix as regards identifying the multi-scale community structure of networks."

"Now, to return to the news article. If the eigenvalue distribution is an attractor, this means that a lot of physical and social phenomena which can be modeled by eigenvalues (including, apparently, quantum energy levels and some properties of statistical tests) might have a common structure. Just as, at a similar level, we see the normal distribution and related functions in all sorts of unusual places."

"…Through several nu- merical experiments, we demonstrate that both matrix- and tensor-based techniques are effective for temporal link prediction despite the inherent difficulty of the problem. Additionally, we show that tensor-based techniques are particularly effective for temporal data with varying periodic patterns."

"I envision a future in which programmers are the conscious repositories of a body of knowledge. A future in which they regain their craft, instead of tweaking frameworks they don't understand. A future, eventually, in which programmers say "no" to demands at odds with their ethics.

It is crucial to create ways, spaces and formats for programmers to share their knowledge with other programmers. It is vital we keep this knowledge (especially verbalized knowledge) among programmers and out of salespeople's hands. And it is urgent the IT crowd recognize software making as a craft, instead of a commodity."

"We consider scheduling weighted packets in a capacity-bounded buffer. In this model, there is a buffer with a limited capacity B such that at any time, the buffer cannot accommodate more than B packets. Packets arrive over time. Each packet has a non-negative real value. Packets do not expire and they leave the buffer only because either we send them or we drop them. The packets that have left the buffer will not be reconsidered for delivery any more. In each time step, at most one packet in the buffer can be sent. The order in which the packets are sent should comply with the order of their arriving time. The objective is to maximize the total value of the packets sent in an online manner.…"

"Each combination of values was then fed into a simulator to give an idea of the grid's performance and its expected lifetime. If the performance was promising, the "genetic material" was subjected to further random changes, or mutation, and this process was repeated until no more improvements were forthcoming.

After 100 generations, the GA spawned a geometry/voltage set that boosted the ion engine grid's lifetime to 5.1 years – at least in the simulator (Journal of Propulsion and Power, DOI: 10.2514/1.44358). Factors optimised included grid hole diameter, hole spacing and the thickness of the grids. The engine could be improved further, says Farnell, by evolving the other parts too.…"

"Results on a commodities basket"

"In this paper we consider spatial networks that realize a balance between an infrastructure cost (the cost of wire needed to connect the network in space) and communication efficiency, measured by average shortest pathlength. A global optimization procedure yields network topologies in which this balance is optimized. These are compared with network topologies generated by a competitive process in which each node strives to optimize its own cost-communication balance. Three phases are observed in globally optimal configurations for different cost-communication trade-offs: (i) regular small worlds, (ii) star-like networks and (iii) trees with a centre of interconnected hubs. In the latter regime, i.e. for very expensive wire, power laws in the link length distributions $P(w)\propto w^{-\alpha}$ are found, which can be explained by a hierarchical organization of the networks…"

"We present a near-linear time algorithm that approximates the edit distance between two strings within a polylogarithmic factor; specifically, for strings of length n and every fixed epsilon>0, it can compute a (log n)^O(1/epsilon) approximation in n^(1+epsilon) time. This is an exponential improvement over the previously known factor, 2^(O (sqrt(log n))), with a comparable running time (Ostrovsky and Rabani J.ACM 2007; Andoni and Onak STOC 2009). Previously, no efficient polylogarithmic approximation algorithm was known for any computational task involving edit distance (e.g., nearest neighbor search or sketching). "

"In many dynamical systems there is a large separation of time scales between typical events and "rare" events which can be the cases of interest. Rare-event rates are quite difficult to compute numerically, but they are of considerable practical importance in many fields: for example transition times in chemical physics and extinction times in epidemiology can be very long, but are quite important. We present a very fast numerical technique that can be used to find long transition times (very small rates) in low-dimensional systems, even if they lack detailed balance. We illustrate the method for a bistable non-equilibrium system introduced by Maier and Stein and a two-dimensional (in parameter space) epidemiology model."

"Image Effects With Cellular Automata (PDF) Abstract:This paper presents some techniques for creating various artistic effects on digital photography using the concept of cellular automata. All examples in this paper are created by “Image Infector” program, which is a plugin for Pixopedia 24 image editor and painter (www.sigmapi-design.com)."

"I'll start by highlighting that while all the software in this post is indeed free (true to FOSS), an account with Interactive Brokers is needed to make use of it. For those not familiar with IB, they offer a trading platform that excels on numerous fronts but is most appealing to those of us who trade algorithmically. IB makes available a rather comprehensive API that makes data access and trade execution entirely possible programmatically via a handful of "supported" languages. These include Java (the language of the platform), C#, VBA and even Excel. The also have a POSIX compliant C++ version for those who enjoy C++ but dislike Windows.

For those who dislike Windows and C++, the community of IB users have a few "non-official" options. They include some nice implementations in C, Python (2), Matlab, and something even more abstracted in the trading-shim. While all well and good, there was one missing: R.…"

"This paper aims at generating a new face based on the human like description using a new concept. The FASY (FAce SYnthesis) System is a Face Database Retrieval and new Face generation System that is under development. One of its main features is the generation of the requested face when it is not found in the existing database, which allows a continuous growing of the database also."

"The performance assessment of algorithms for multiobjective optimization problems is far from being a trivial issue. Recent results indicate that unary performance measures, i.e. performance measures which assign a single value to each non-dominated point set, are inherently limited in their inferential power. Despite these limitations, the hypervolume indicator (also known as Lebesgue measure or S metric) is still considered to possess some reasonable properties, having also been proposed as a guidance criterion for accepting solutions in Multiobjective Evolutionary Algorithms. Therefore, the computational time taken for computing the hypervolume indicator is a crucial factor for the performance of such algorithms.…"

"Unfortunately, our political leaders don't give a damn about mundane issues such as unemployment and economic growth. It is far easier for them to bandy about silly cliches about fiscal responsibility and generational equity, even though the policies they are pushing are 180 degrees at odds with anything that will help our children or grandchildren. Their main concern is pushing policies that keep the financial industry happy. And 10 million unemployed never bothered anyone at Goldman Sachs, just as Fabulous Fabio."

"We believe that our result could shed the light on the relation between the distribution of motifs and the struc- ture of the adjacency matrix of a hierarchical network. However to make this relation more profound the “in- verse” problem should be considered as well. Namely, it would be desirable to check if the stable distribution of motifs is uniquely related to any kind of hierarchical organization of the network."

"Think of it this way: if having your development team work this way through sprints, why not board notes? Meeting every 6-8 weeks with no interim communication is like the waterfall software development process!"

"The paper is structured as follows. Methods of cultivating and experimenting with plasmodium of Physarum polycephalum are described in Sect. 2. In Sect. 3 we provide experimental evidence of ‘ballistic’ behavior of traveling plasmod- ium localizations. Experimental Physarum gates are discussed in Sect. 4. In Sect. 5 experimental results are supported by numerical simulation of propa- gating localizations. The gates are cascaded in one-bit half-adder in Sect. 6. Importance of non-nutrient substrate for gate implementation is highlighted in Sect. 7."

"There is no huge constituency worried about the estate tax–just the wealthy few whose estates might be subject to some taxation. But apparently Sens. Kyl, Baucus, Grassley and Lincoln are working to include a "bipartisan" proposal in the small business tax bill that they hope to put through Congress. Odds are it will cut the estate tax rate and increase the exemption amount, making the wealthy even less likely to pay any estate tax. …"

"We describe a variation of a technique by Chiba and Nishizeki [3], leading to a data structure for graph algorithmic problems, called the h-graph data structure. It supports operations of insertion and removal of vertices, as well as insertion and removal of edges. Although the data structure can be used for general purpose, it is particularly suitable for applications in dynamic graph algorithms."

I want this for Ruby, and not in Eclipse.

"The problem of finding small sets that block every line passing through a unit square was first considered by Mazurkiewicz in 1916 [23]; see also [25], [2]. Let C be a convex body in the plane. Following Bagemihl [2], we call a set B an opaque set or a barrier for C, if it meets all lines that intersect C. A barrier may consist of one or more rectifiable arcs. It does not need to be connected and its portions may lie anywhere in the plane, including the exterior of C; see [2], [4].

What is the length of the shortest barrier for a given convex body C? In spite of considerable efforts, the answer to this question is not known even for the simplest instances of C, such as a square, a disk, or an equilateral triangle…"

"Our numerical studies suggest that the proposed CP-WOPT approach is accurate and scalable. CP-WOPT can recover the underlying factors successfully with large amounts of missing data, e.g., 90% missing entries for tensors of size 50 × 40 × 30. We have also studied how CP-WOPT can scale to problems of larger sizes, e.g., 1000 × 1000 × 1000, and recover CP factors from large, sparse tensors with 99.5% missing data.…"

"Although care needs to be taken in the implementation of normal random number generators like fastnorm, and the end-user should be aware of the small but unavoidable defects discussed in §§5.6-5.7, these generators have such a performance advantage over more conventional generators that they can not be ignored in applications where the speed of generation of pseudo- random numbers is critical."

"The argument and the answers clearly revolve around how we define (or operationalize) “individualism.” In any case, the comparative data does put the U.S. into perspective and Fischer’s discussion leaves a lot to unpack."

"The results from the computational approximation of Physarum support the findings of [15] that the organism can be used to construct simple logic gates, and also the computing schemes within this paper which explored the creation of more complex combined gates and half adder circuitry. The findings suggest that, although such circuits can indeed be built, the presence of both timing errors and junctional (search) errors would severely limit the effectiveness and practicality with even more complex circuits."

"… In contrast, we show that temperature 1 self-assembly in 3 dimensions, even when growth is restricted to at most 1 step into the third dimension, is capable of simulating a large class of temperature 2 systems, in turn permitting the simulation of arbitrary Turing machines and the assembly of $n\times n$ squares in near optimal $O(\log n)$ tile complexity. Further, we consider temperature 1 probabilistic assembly in 2D, and show that with a logarithmic scale up of tile complexity and shape scale, the same general class of temperature $\tau=2$ systems can be simulated with high probability, yielding Turing machine simulation and $O(\log^2 n)$ assembly of $n\times n$ squares with high probability. Our results show a sharp contrast in achievable tile complexity at temperature 1 if either growth into the third dimension or a small probability of error are permitted. …"

"Quickly build web application mockups using technology you use every day."

"In February 2008, the New York Times published an unusual chart of box office revenues for 7500 movies over 21 years. The chart was based on a similar visualization, developed by the first author, that displayed trends in music listening. This paper describes the design decisions and algorithms behind these graphics, and discusses the reaction on the Web. We suggest that this type of complex layered graph is effective for displaying large data sets to a mass audience. We provide a mathematical analysis of how this layered graph relates to traditional stacked graphs and to techniques such as ThemeRiver, showing how each method is optimizing a different “energy function”. Finally, we discuss techniques for coloring and ordering the layers of such graphs. Throughout the paper, we emphasize the interplay between considerations of aesthetics and legibility."

"Lee Byron open-sourced his streamgraph code in Processing about a month ago. Jason Sundram has taken that and ported it to JavaScript, using Processing.js.
The algorithms are the same as that in the original, but of course the natural benefit is that people don't need Java to run it their browsers. Jason has also added a few features including dynamic sizing, more straightforward settings, and some interaction with zoom and hover control. Really nice work."

"…Generally speaking, modules are islands of highly connected nodes separated by a relatively small number of links. Every module can have contributions of links from any node in the network. The challenge is to disentangle these contributions to understand how the modular structure is built. The main problem is that the analysis of a certain partition into modules involves, in principle, as many data as number of modules times number of nodes. To confront this challenge, here we first define the contribution matrix, the mathematical object containing all the information about the partition of interest, and after, we use a Truncated Singular Value Decomposition to extract the best representation of this matrix in a plane. The analysis of this projection allow us to scrutinize the skeleton of the modular structure, revealing the structure of individual modules and their interrelations."

"Quantitative properties of stochastic systems are usually specified in logics that allow one to compare the measure of executions satisfying certain temporal properties with thresholds. The model checking problem for stochastic systems with respect to such logics is typically solved by a numerical approach that iteratively computes (or approximates) the exact measure of paths satisfying relevant subformulas; the algorithms themselves depend on the class of systems being analyzed as well as the logic used for specifying the properties. Another approach to solve the model checking problem is to \emph{simulate} the system for finitely many runs, and use \emph{hypothesis testing} to infer whether the samples provide a \emph{statistical} evidence for the satisfaction or violation of the specification. In this short paper, we survey the statistical approach, and outline its main advantages in terms of efficiency, uniformity, and simplicity."

"For understanding the origin of life, it is essential to explain the development of a compartmentalized structure, which undergoes growth and division, from a set of chemical reactions. In this study, a hypercycle with two chemicals that mutually catalyze each other is considered in order to show that the reproduction of a protocell with a growth-division process naturally occurs when the replication speed of one chemical is considerably slower than that of the other chemical. It is observed that the protocell divides after a minority molecule is replicated at a slow synthesis rate, and thus, a synchrony between the reproduction of a cell and molecule replication is achieved. The robustness of such protocells against the invasion of parasitic molecules is also demonstrated."

"Ecological communities exhibit pervasive patterns and inter-relationships between size, abundance, and the availability of resources. We use scaling ideas to develop a unified, model-independent framework for understanding the distribution of tree sizes, their energy use and spatial distribution in tropical forests. We demonstrate that the scaling of the tree crown at the individual level drives the forest structure when resources are fully used. Our predictions match perfectly with the scaling behaviour of an exactly solvable self-similar model of a forest and are in good accord with empirical data. The range, over which pure power law behaviour is observed, depends on the available amount of resources. The scaling framework can be used for assessing the effects of natural and anthropogenic disturbances on ecosystem structure and functionality."

"An exact, one-to-one transform is presented that not only allows digital circular convolutions, but is free from multiplications and quantisation errors for transform lengths of arbitrary powers of two. The transform is analogous to the Discrete Fourier Transform, with the canonical harmonics replaced by a set of cyclic integers computed using only bit-shifts and additions modulo a prime number. The prime number may be selected to occupy contemporary word sizes or to be very large for cryptographic or data hiding applications. The transform is an extension of the Rader Transforms via Carmichael's Theorem. These properties allow for exact convolutions that are impervious to numerical overflow and to utilise Fast Fourier Transform algorithms."

"… Under such QoS constraints and limitations on the interference caused to the primary users, the maximum throughput is identified by finding the effective capacity of the cognitive radio channel. Optimal power allocation strategies are obtained and the optimal channel selection criterion is identified. The intricate interplay between effective capacity, interference and QoS constraints, channel sensing parameters and reliability, fading, and the number of available frequency bands is investigated through numerical results."

"In communication networks, cognitive network (CN) is a new type of data network that makes use of cutting edge technology from several research areas (i.e. machine learning, knowledge representation, computer network, network management) to solve some problems current networks are faced with. Cognitive network is different from cognitive radio as it covers all the layers of the OSI model (not only layers 1 and 2 as with cognitive radio).…"

"…We analyze the Lyapunov spectrum, determine the probability to find stationary oscillating solutions, demonstrate the effect of the nonlinearity on the effective in- and out-degree of the active interaction network and study how the frequency distributions of oscillatory modes of such system depend on the average connectivity."

"…Lightning electromagnetic pulse induced transcranial magnetic stimulation of phosphenes in the visual cortex is concluded to be a plausible interpretation of a large class of reports on luminous perceptions during thunderstorms."

"…This approach to analyze functions is hence more suitable for computers (in order to save computation time), and the simplicity of the definition allows further research in other areas of Classical Analysis."

"… The present work introduces new heuristic segmentation algorithms for the following optimization problem: Find a segmentation of an approximated matrix using only allowed fields and minimize the approximation error. Finally, the decomposition algorithms were implemented into an optimization programme in order to examine the assumptions of the algorithms for a clinical example. As a result, identical dose distributions with much fewer segments and a significantly smaller number of monitor units could be achieved using dosimetric constraints. Consequently, the dose delivery is more efficient and less time consuming."

"Unless we get better legislators, and a couple of hundred years of history says not to count on that, enhancing the automatic stabilizers may be our best bet going forward. There's considerable empirical evidence showing that they work, including this new evidence that automatic stabilizers work "always and everywhere"…"

"We report on experiments of many small motors — cell phone vibrators — glued to and interacting through a resonant plate. We find that individual motors interacting with the plate demonstrate hysteresis in their steady-state frequency due to interactions with plate resonances. For multiple motors running simultaneously, the degree of synchronization between motors increases when the motors' frequencies are near a resonance of the plate, and the frequency at which the motors synchronize shows a history dependence."

"We describe von Neumann's elegant idea for sampling from the exponential distribution, Forsythe's generalization for sampling from a probability distribution whose density has the form exp(-G(x)), where G(x) is easy to compute (e.g. a polynomial), and my refinement of these ideas to give an efficient algorithm for generating pseudo-random numbers with a normal distribution. Later developments are also mentioned."

"It clearly looks as if the NASDAQ was trying to protect the interests of some institutions which lost large sums of money during Thursday’s collapse. These institutions likely did not have safeguards in place to deal with a lack of bidders. When their automated market orders hit the market in the absence of bidders, transactions were done at ridiculously low prices. But as NASDAQ has noted, there was no failure of their systems."

"So when France and Germany make sure that Greece can pay its debt, they are also rescuing, well, France and Germany. Also makes it clear exactly how contagion could work in practice."

"The aim of this chapter is twofold. In the first part we will provide a brief overview of the mathematical and statistical foundations of graphical models, along with their fundamental properties, estimation and basic inference procedures. In particular we will develop Markov networks (also known as Markov random fields) and Bayesian networks, which comprise most past and current literature on graphical models. In the second part we will review some applications of graphical models in systems biology."

"Project Euler is a series of challenging mathematical/computer programming problems that will require more than just mathematical insights to solve. Although mathematics will help you arrive at elegant and efficient methods, the use of a computer and programming skills will be required to solve most problems.

The motivation for starting Project Euler, and its continuation, is to provide a platform for the inquiring mind to delve into unfamiliar areas and learn new concepts in a fun and recreational context."

"It is a mantra of the deficit hawks that they are working to ensure their children and grandchildren will one day have the same opportunities that they have had. But right now, in real time, those same children and grandchildren are having those opportunities taken away. …"

"Building a repository of proof-checked mathematical knowledge is without any doubt a lot of work, and besides the actual formalization process there also is the task of maintaining the repository. Thus it seems obvious to keep a repsoitory as small as possible, in particular each piece of mathematical knowledge should be formalized only once. In this paper, however, we claim that it might be reasonable or even necessary to duplicate knowledge in a mathematical repository. We analyze different situations and reasons for doing so and provide a number of examples supporting our thesis."

"In this work, decision tree learning algorithms and fuzzy inferencing systems are applied for galaxy morphology classification. In particular, the CART, the C4.5, the Random Forest and fuzzy logic algorithms are studied and reliable classifiers are developed to distinguish between spiral galaxies, elliptical galaxies or star/unknown galactic objects. Morphology information for the training and testing datasets is obtained from the Galaxy Zoo project while the corresponding photometric and spectra parameters are downloaded from the SDSS DR7 catalogue."

"The properties of polymer liquids on hard and soft substrates are investigated by molecular dynamics simulation of a coarse-grained bead-spring model and dynamic single-chain-in-mean-field (SCMF) simulations of a soft, coarse-grained polymer model. Hard, corrugated substrates are modelled by an FCC Lennard-Jones solid while polymer brushes are investigated as a prototypical example of a soft, deformable surface. From the molecular simulation we extract the coarse-grained parameters that characterise the equilibrium and flow properties of the liquid in contact with the substrate: the surface and interface tensions, and the parameters of the hydrodynamic boundary condition. The so-determined parameters enter a continuum description like the Stokes equation or the lubrication approximation."

"… Due to the tremendous growth of network-based services, intrusion detection has emerged as an important technique for network security. Recently data mining algorithms are applied on network-based traffic data and host-based program behaviors to detect intrusions or misuse patterns, but there exist some issues in current intrusion detection algorithms such as unbalanced detection rates, large numbers of false positives, and redundant attributes that will lead to the complexity of detection model and degradation of detection accuracy. The purpose of this study is to identify important input attributes for building an intrusion detection system (IDS) that is computationally efficient and effective.…"

"We present an efficient solution to the following problem, of relevance in a numerical optimization scheme: calculation of integrals of the type \[\iint_{T \cap \{f\ge0\}} \phi_1\phi_2 \, dx\,dy\] for quadratic polynomials $f,\phi_1,\phi_2$ on a plane triangle $T$. The naive approach would involve consideration of the many possible shapes of $T\cap\{f\geq0\}$ (possibly after a convenient transformation) and parameterizing its border, in order to integrate the variables separately. Our solution involves partitioning the triangle into smaller triangles on which integration is much simpler."

"This paper presents an efficient human recognition system based on vein pattern from the palma dorsa. A new absorption based technique has been proposed to collect good quality images with the help of a low cost camera and light source. The system automatically detects the region of interest from the image and does the necessary preprocessing to extract features. A Euclidean Distance based matching technique has been used for making the decision. It has been tested on a data set of 1750 image samples collected from 341 individuals. The accuracy of the verification system is found to be 99.26% with false rejection rate (FRR) of 0.03%."

'It turns out that people’s stated preferences have a weak relationship to who they actually like. Stated preferences, one study found, “seemed to vanish when it came time to choose a partner in physical space.”'

"Every algorithm which can be executed on a computer can at least in principle be realized in hardware, i.e. by a discrete physical system. The problem is that up to now there is no programming language by which physical systems can constructively be described. Such tool, however, is essential for the compact description and automatic production of complex systems. This paper introduces a programming language, called Akton-Algebra, which provides the foundation for the complete description of discrete physical systems.…"

"Performance tuning of Database Management Systems(DBMS) is both complex and challenging as it involves identifying and altering several key performance tuning parameters. The quality of tuning and the extent of performance enhancement achieved greatly depends on the skill and experience of the Database Administrator (DBA). As neural networks have the ability to adapt to dynamically changing inputs and also their ability to learn makes them ideal candidates for employing them for tuning purpose. In this paper, a novel tuning algorithm based on neural network estimated tuning parameters is presented. The key performance indicators are proactively monitored….The tuner alters these tuning parameters using the estimated values using a rate change computing algorithm. The preliminary results show that the proposed method is effective in improving the query response time for a variety of workload types."

"In this case, the computers kicked in their sell programs and there were no buy programs engaged – and so there was no market – and stocks wound up selling for a penny a share.

Now already known as the “flash crash,” this remarkable event will almost surely put a whole generation of young math whizzes out of business as Congress and the SEC crawl all over these operations and limit this kind of insane action.

I’m all for it because, and you can call me old fashioned, I don’t think the global equities markets should be an online gambling casino which is what they’ve become with the rise of the “quants” and their hyperactive supercomputers."

"… It avoids most of the shortcomings encountered with the now classic Black-Scholes-Merton framework. Several convincing computer simulations are presented. Some of them are dealing with abrupt changes, i.e., jumps."

"During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs) have been shown to work well in practice and to possess theoretical guarantees such as probabilistic completeness. However, no theoretical bounds on the quality of the solution obtained by these algorithms have been established so far. The first contribution of this paper is a negative result: it is proven that, under mild technical conditions, the cost of the best path in the RRT converges almost surely to a non-optimal value. Second, a new algorithm is considered, called the Rapidly-exploring Random Graph (RRG), and it is shown that the cost of the best path in the RRG converges to the optimum almost surely. Third, a tree version of RRG is introduced, called the RRT$^*$ algorithm, which preserves the asymptotic optimality of RRG while maintaining a tree structure like RRT.…"

"Recent research on multiple kernel learning has lead to a number of approaches for combining kernels in regularized risk minimization. The proposed approaches include different formulations of objectives and varying regularization strategies. In this paper we present a unifying general optimization criterion for multiple kernel learning and show how existing formulations are subsumed as special cases. We also derive the criterion's dual representation, which is suitable for general smooth optimization algorithms. Finally, we evaluate multiple kernel learning in this framework analytically using a Rademacher complexity bound on the generalization error and empirically in a set of experiments."

"If a fund/institution/High Frequency Trader generates 100mm shares or contracts a day/week/month, market observers will tell you that's a great thing because it creates a liquidity premium. In other words, because there is always someone on the other side of a trade, it is easier to match buyers and sellers and that ease creates smaller spreads and often lower pricing. On the surface that's a great thing.

It is a great thing until the market becomes completely dependent on that liquidity. If every model expects X volume, what happens when that volume falls?"

"One of the most effective techniques of experimental mathematics is to compute mathematical entities such as integrals, series or limits to high precision, then attempt to recognize the resulting numerical values. Recently these techniques have been applied with great success to problems in math- ematical physics. Notable among these applications are the identification of some key multi-dimensional integrals that arise in Ising theory, quantum field theory and in magnetic spin theory."

"…A version of the method independent of the contrast of the image is considered and is found to be useful for finding the most unusual part (and the most similar part) of the image conditioned on given image. The results can be used to scan large image databases, as for example medical databases.…"

"…A version of the method independent of the contrast of the image is considered and is found to be useful for finding the most unusual part (and the most similar part) of the image conditioned on given image. The results can be used to scan large image databases, as for example medical databases."

"ECG Feature Extraction plays a significant role in diagnosing most of the cardiac diseases. One cardiac cycle in an ECG signal consists of the P-QRS-T waves. This feature extraction scheme determines the amplitudes and intervals in the ECG signal for subsequent analysis. The amplitudes and intervals value of P-QRS-T segment determines the functioning of heart of every human. Recently, numerous research and techniques have been developed for analyzing the ECG signal. The proposed schemes were mostly based on Fuzzy Logic Methods, Artificial Neural Networks (ANN), Genetic Algorithm (GA), Support Vector Machines (SVM), and other Signal Analysis techniques. All these techniques and algorithms have their advantages and limitations.…

[search results]

"The three-dimensional solar structure could, at least in principle, absorb a lot more light and generate more power than a flat panel containing the same area footprint. The hope is that all unused light which has been reflected off one panel would be captured by other panels. Panels of this type would be most ideal in circumstances with limited space."

"I am going to take a different perspective on the relation between young firms and job creation, however. I want to explain its mathematical inevitability, and I’m going to do that using the probabilistic idea of the drunkard’s walk."

"GAP is a system for computational discrete algebra, with particular emphasis on Computational Group Theory. GAP provides a programming language, a library of thousands of functions implementing algebraic algorithms written in the GAP language as well as large data libraries of algebraic objects. See also the overview and the description of the mathematical capabilities. GAP is used in research and teaching for studying groups and their representations, rings, vector spaces, algebras, combinatorial structures, and more. The system, including source, is distributed freely. You can study and easily modify or extend it for your special use."

"However, 2010 is not like 1994. Apple has money, mindshare and the hottest platform to no longer having to beg. Today, Apple is more concerned about having to re-live its recent history — getting jerked around by Microsoft or held hostage by Adobe — than what it thinks would be manageable damage by a few developers that may leave its platform. Some may regard that as being arrogant. For Apple it’s the price of being in charge of its own destiny. To capitulate at the height of its newly found vigor would be suicidal. Suicidal Apple is no longer."

"This allows you to build a replication infrastructure that fits your application and deployment needs best: two offices with an ocean in between, no problem; large server cluster in one or more data centres, no problem. And anything in between really.

Replication is not new, it has been baked into CouchDB from the beginning. Today, I’ll show you some of the nifty features we added to the 0.11 replicator to make your life a little easier."

"Since then, though, CouchDB gained a few new features to tackle the same problem: fetch related data. These aren’t new in 0.11, but they did get refined, so it makes sense to revisit them here. Since 0.10, you could query a view with the query parameter include_docs=true. When specified, CouchDB would fetch, for each row in the view result, the corresponding document from the database. This allows users to make a trade-off between smaller view indexes (and hence shorter view index times) and slower view index (for each row, CouchDB makes a single request to the database)."

"CouchDB 0.11 lets you create nicer URLs. The path to nicer URLs includes two separate steps: URL Rewriting and Virtual Hosts."

"Nonetheless, the anti-poverty organization of 400,000 low- and middle-income member families in 75 cities was successfully targeted and put out of business by Republicans; the long, concerted smear campaigns intended to do little more than undercut ACORN's successful voter registration drives. Those drives had succeeded in legally registering hundreds of thousands of low- and middle-income voters, many of whom tend to vote Democratic. For that, for enfranchising Americans to participate in their own democracy, the GOP had to put them out of business.

Mission accomplished."

"The big change appears to be that those in school have become increasingly less attached to the labor market. The percentage of school enrollees aged between 16 and 24 who are also participating in the labor market was relatively stable between 1989 and 1998 at around 51 percent. However, labor market participation by those in school declined between 1999 and 2008 from 50 percent to 42 percent. In contrast, labor force participation by those aged between 16 and 24 not enrolled in school has declined only modestly—from 82 percent to 80 percent between 1989 and 2008."

"Noticing the pain as soon as possible and then fixing the problem – whether it is a rigid design, fragile tests or something else – requires skill. Not everybody is alert to the pain, but instead they keep on writing bad code until making changes becomes too expensive and a rewrite is needed. Not everybody fixes the problem when they feel the pain, but instead they implement a quick hack and leave an even bigger mess for the next developer. But for those who have the necessary skills and discipline, TDD can be a powerful tool and they can use it to write better code."