text:
These are my recent Pinboard.in links:
Publishing Has Perished: Long Live the Personal Cloud | Cloudline | Wired.com
"Even that arrangement wouldn't be ideal, though. When a publisher abandons an article of mine, it also abandons links to it from any page that referred to the article. In the scientific and academic realms, digital object identifiers (DOIs) are used to mint namespaces that can transcend the lifetimes (or attention spans) of individual publishers. That technology hasn't yet trickled down to the rest of us, but I'd love to have my personal cloud implement such a scheme and be the resolver of last resort for my published work."
via:vielmetti publishing archives extended-mind memory make-it-so- "In this paper, we study optimal radar deployment for intrusion detection, with focus on network coverage. In contrast to the disk-based sensing model in a traditional sensor network, the detection range of a bistatic radar depends on the locations of both the radar transmitter and radar receiver, and is characterized by Cassini ovals. Furthermore, in a network with multiple radar transmitters and receivers, since any pair of transmitter and receiver can potentially form a bistatic radar, the detection ranges of different bistatic radars are coupled and the corresponding network coverage is intimately related to the locations of all transmitters and receivers, making the optimal deployment design highly non-trivial. Clearly, the detectability of an intruder depends on the highest SNR received by all possible bistatic radars. We focus on the worst-case intrusion detectability, i.e., the minimum possible detectability along all possible intrusion paths. Although it is plausible to deploy radars on a shortest line segment across the field, it is not always optimal in general, which we illustrate via counter-examples. We then present a sufficient condition on the field geometry for the optimality of shortest line deployment to hold. Further, we quantify the local structure of detectability corresponding to a given deployment order and spacings of radar transmitters and receivers, building on which we characterize the optimal deployment to maximize the worst-case intrusion detectability. Our results show that the optimal deployment locations exhibit a balanced structure. We also develop a polynomial-time approximation algorithm for characterizing the worse-case intrusion path for any given locations of radars under random deployment."
optimization simulation nudge-targets coevolution minimax-problems - "Cooperative vehicle safety (CVS) systems operate based on broadcast of vehicle position and safety information to neighboring cars. The communication medium of CVS is a vehicular ad-hoc network. One of the main challenges in large scale deployment of CVS systems is the issue of scalability. To address the scalability problem, several congestion control methods have been proposed and are currently under field study. These algorithms adapt transmission rate and power based on network measures such as channel busy ratio. We examine two such algorithms and study their dynamic behavior in time and space to evaluate stability (in time) and fairness (in space) properties of these algorithms. We present stability conditions and evaluate stability and fairness of the algorithms through simulation experiments. Results show that there is a trade-off between fast convergence, temporal stability and spatial fairness. The proper ranges of parameters for achieving stability are presented for the discussed algorithms. Stability is verified for all typical road density cases. Fairness is shown to be naturally achieved for some algorithms, while under the same conditions other algorithms may suffer from unfairness issues. A method for resolving unfairness is introduced and evaluated through simulations."
robotics complexology emergent-design traffic-models collective-behavior performance-measure nudge-targets simulation [1205.6147] A curvature-driven effective attraction in multicomponent membranes
"We study closed liquid membranes that segregate into three phases due to differences in the chemical and physical properties of its components. The shape and in-plane membrane arrangement of the phases are coupled through phase-specific bending energies and line tensions. We use simulated annealing Monte Carlo simulations to find low-energy structures, allowing both phase arrangement and membrane shape to relax. The three-phase system is the simplest one in which there are multiple interface pairs, allowing us to analyze interfacial preferences and pairwise distinct line tensions. We observe the system's preference for interface pairs that maximize differences in spontaneous curvature. From a pattern selection perspective, this acts as an effective attraction between phases of most disparate spontaneous curvature. We show that this effective attraction is robust enough to persist even when the interface between these phases is the most penalized by line tension. This effect is driven by geometry and not by any explicit component-component interaction."
simulation membrane-physics classification phase-diagrams nudge-targets[1205.2170] Collaborative Search on the Plane without Communication
"We use distributed computing tools to provide a new perspective on the behavior of cooperative biological ensembles. We introduce the Ants Nearby Treasure Search (ANTS) problem, a generalization of the classical cow-path problem, which is relevant for collective foraging in animal groups. In the ANTS problem, k identical (probabilistic) agents, initially placed at some central location, collectively search for a treasure in the two-dimensional plane. The treasure is placed at a target location by an adversary and the goal is to find it as fast as possible as a function of both k and D, where D is the distance between the central location and the target.…"
low-hanging-fruit nudge-targets agent-based autonomous-agents[1206.1571] Steady-state fluctuations of a genetic feedback loop: an exact solution
"…For the case where the degradation rate of bound and free protein is the same, our solution is at variance with a previous claim of an exact solution (Hornos et al, Phys. Rev. E {bf 72}, 051907 (2005) and subsequent studies). We show explicitly that this is due to an unphysical formulation of the underlying master equation in those studies."
unphysical biochemistry models analytical-models-of-messy-old-life- Something interesting but very difficult in here about representation theory for metaheuristics, and practical (contextual) landscape reconfiguration. "In this paper we consider the problem of locating a nonzero entry in a high-dimensional vector from possibly adaptive linear measurements. We consider a recursive bisection method which we dub the compressive binary search and show that it improves on what any nonadaptive method can achieve. We also establish a non-asymptotic lower bound that applies to all methods, regardless of their computational complexity. Combined, these results show that the compressive binary search is within a double logarithmic factor of the optimal performance."
needle-in-a-haystack algorithms computational-complexity [1107.0500] Factorization of Matrices of Quaternions
"We review known factorization results in quaternion matrices. Specifically, we derive the Jordan canonical form, polar decomposition, singular value decomposition, the QR factorization. We prove there is a Schur factorization for commuting matrices, and from this derive the spectral theorem. We do not consider algorithms, but do point to some of the numerical literature. Rather than work directly with matrices of quaternions, we work with complex matrices with a specific symmetry based on the dual operation. We discuss related results regarding complex matrices that are self-dual or symmetric, but perhaps not Hermitian."
quantums algorithms matrices open-questions nudge-targets amusing[1204.0163] Coordination and Emergence in the Cellular Automated Fashion Game
"Fashion plays such a crucial rule in the evolution of culture and society that it is regarded as a second nature to the human being. Also, its impact on economy is quite nontrivial. On what is fashionable, interestingly, there are two viewpoints that are both extremely widespread but almost opposite: conformists think that what is popular is fashionable, while rebels believe that being different is the essence. Fashion color is fashionable in the first sense, and Lady Gaga in the second. We investigate a model where the population consists of the afore-mentioned two groups of people that are located on a spatial structure. Theoretically, this model is equivalent to the matching pennies game on the corresponding network, and has its own interest to game theory: it is a hybrid model of pure competition and pure cooperation. This is true because when a conformist meets a rebel, they play the zero sum matching pennies game, which is pure competition. When two conformists (rebels) meet, they play the (anti-) coordination game, which is pure cooperation. Simulation shows that in most cases people can reach an extraordinarily high degree of cooperation, through selfish, myopic, naive, and local interactions. Phase transition, as well as emergence of many interesting patterns, is also observed."
cellular-automata agent-based social-dynamics complexology- "We extend the formalism of Random Boolean Networks with canalizing rules to multilevel complex networks. The formalism allows to model genetic networks in which each gene might take part in more than one signaling pathway. We use a semi-annealed approach to study the stability of this class of models when coupled in a multiplex network and show that the analytical results are in good agreement with numerical simulations. Our main finding is that the multiplex structure provides a mechanism for the stabilization of the system and of chaotic regimes of individual layers. Our results help understanding why some genetic networks that are theoretically expected to operate in the chaotic regime can actually display dynamical stability."
boolean-networks complexology kauffmania interesting [1109.1488] Are Opinions Based on Science: Modelling Social Response to Scientific Facts
Oh how I laughed and laughed. "As scientists we like to think that modern societies and their members base their views, opinions and behaviour on scientific facts.…"
science! cultural-assumptions agent-based simulation social-networks- I hadn't heard of matrix sketching before; warrants a look someday.
algorithms operations-research data-cleaning summarization-algorithms nudge-targets [1205.0537] A greedy-navigator approach to navigable city plans
"We use a set of four theoretical navigability indices for street maps to investigate the shape of the resulting street networks, if they are grown by optimizing these indices. The indices compare the performance of simulated navigators (having a partial information about the surroundings, like humans in many real situations) to the performance of optimally navigating individuals. We show that our simple greedy shortcut construction strategy generates the emerging structures that are different from real road network, but not inconceivable. The resulting city plans, for all navigation indices, share common qualitative properties such as the tendency for triangular blocks to appear, while the more quantitative features, such as degree distributions and clustering, are characteristically different depending on the type of metrics and routing strategies. We show that it is the type of metrics used which determines the overall shapes characterized by structural heterogeneity, but the routing schemes contribute to more subtle details of locality, which is more emphasized in case of unrestricted connections when the edge crossing is allowed."
city-planning emergence emergent-design agent-based nudge-targets- "…Then, we propose a new and effective algorithm to generate parity inequalities derived from certain additional redundant parity check (RPC) constraints that can eliminate pseudocodewords produced by the LP decoder, often significantly improving the decoder error-rate performance. The cut-generating algorithm is based upon a specific transformation of an initial parity-check matrix of the linear block code. We also design two variations of the proposed decoder to make it more efficient when it is combined with the new cut-generating algorithm. Simulation results for several low-density parity-check (LDPC) codes demonstrate that the proposed decoding algorithms significantly narrow the performance gap between LP decoding and ML decoding."
linear-programming information-theory algorithms nudge-targets searching-under-the-streetlight - "Deep shotgun sequencing and analysis of genomes, transcriptomes, amplified single-cell genomes, and metagenomes has enabled investigation of a wide range of organisms and ecosystems. However, sampling variation in short-read data sets and high sequencing error rates of modern sequencers present many new computational challenges in data interpretation. These challenges have led to the development of new classes of mapping tools and {em de novo} assemblers. These algorithms are challenged by the continued improvement in sequencing throughput. We here describe digital normalization, a single-pass computational algorithm that systematizes coverage in shotgun sequencing data sets, thereby decreasing sampling variation, discarding redundant data, and removing the majority of errors. Digital normalization substantially reduces the size of shotgun data sets and decreases the memory and time requirements for {em de novo} sequence assembly, all without significantly impacting content of the generated contigs. We apply digital normalization to the assembly of microbial genomic data, amplified single-cell genomic data, and transcriptomic data. Our implementation is freely available for use and modification."
genomics bioinformatics algorithms statistics data-cleaning - "In this paper B-Rank, an efficient ranking algorithm for recommender systems, is proposed. B-Rank is based on a random walk model on hypergraphs. Depending on the setup, B-Rank outperforms other state of the art algorithms in terms of precision, recall (19% — 50%), and inter list diversity (20% — 60%). B-Rank captures well the difference between popular and niche objects. The proposed algorithm produces very promising results for sparse and dense voting matrices. Furthermore, a recommendation list update algorithm is introduced,to cope with new votes. This technique significantly reduces computational complexity. The implementation of the algorithm is simple, since B-Rank needs no parameter tuning."
algorithms peer-production benchmarking amusing [1205.2777] Modelling slowly changing dynamic gene-regulatory networks
"Dynamic gene-regulatory networks are complex since the number of potential components involved in the system is very large. Estimating dynamic networks is an important task because they compromise valuable information about interactions among genes. Graphical models are a powerful class of models to estimate conditional independence among random variables, e.g. interactions in dynamic systems. Indeed, these interactions tend to vary over time. However, the literature has been focused on static networks, which can only reveal overall structures. Time-course experiments are performed in order to tease out significant changes in networks. It is typically reasonable to assume that changes in genomic networks are few because systems in biology tend to be stable. We introduce a new model for estimating slowly changes in dynamic gene-regulatory networks which is suitable for a high-dimensional dataset, e.g. time-course genomic data. Our method is based on i) the penalized likelihood with $ell_1$-norm, ii) the penalized differences between conditional independence elements across time points and iii) the heuristic search strategy to find optimal smoothing parameters. We implement a set of linear constraints necessary to estimate sparse graphs and penalized changing in dynamic networks. These constraints are not in the linear form. For this reason, we introduce slack variables to re-write our problem into a standard convex optimization problem subject to equality linear constraints. We show that GL$_Delta$ performs well in a simulation study. Finally, we apply the proposed model to a time-course genetic dataset T-cell."
gene-regulatory-networks modeling systems-biology operations-research linear-programming nudge-targets[1205.3532] New Algorithms on Rooted Triplet Consistency
"An evolutionary tree (phylogenetic tree) is a binary, rooted, unordered tree that models the evolutionary history of currently living species in which leaves are labeled by species. In this paper, we investigate the problem of finding the maximum consensus evolutionary tree from a set of given rooted triplets. A rooted triplet is a phylogenetic tree on three leaves and shows the evolutionary relationship of the corresponding three species. The mentioned problem is known to be APX-hard. We present two new heuristic algorithms. For a given set of m triplets on n species, the FastTree algorithm runs in O(mn^2) which is faster than any other previously known algorithms, although, the outcome is less satisfactory. The BPMTR algorithm runs in O(mn^3) and in average performs better than any other previously known approximation algorithms for this problem."
cladistics algorithms open-questions nudge-targets[1205.3720] A k-shell decomposition method for weighted networks
"One major limitation of most centrality measures, including the k-core decomposition method, is their design to work on unweighted graphs. However, in practice, real networks are weighted, and their weights describe important and well defined properties of the underlying systems. In order to overcome this limitation two main approaches were followed, but, both having drawbacks of their own. Under the first approach one would completely neglect the weights and perform the analysis on the unweighted network, but then one chooses to neglect an important property of the network. The second approach would be to consider only links with weights above some — (usually) arbitrary chosen — threshold value. However, this approach has a drawback since it has to deal with the selection of a proper cut-off value, and as we will discuss later, this could have significant impact on the results. Additionally, by neglecting links bellow a threshold, the network becomes sparser with some nodes getting disconnected and not considered by the applied method afterwards."
network-theory social-networks algorithms graph-theory[1109.2341] Guaranteed successful strategies for a square achievement game on an n by n grid
"At some places (see the references) Martin Erickson describes a certain game: "Two players alternately write O's (first player) and X's (second player) in the unoccupied cells of an n x n grid. The first player (if any) to occupy four cells at the vertices of a square with horizontal and vertical sides is the winner." Then he asks "What is the outcome of the game given optimal play?" or "What is the smallest n such that the first player has a winning strategy?" "
nudge-targets game-theory mathematical-recreations[1206.0217] Efficient techniques for mining spatial databases
"Clustering is one of the major tasks in data mining. In the last few years, Clustering of spatial data has received a lot of research attention. Spatial databases are components of many advanced information systems like geographic information systems VLSI design systems. In this thesis, we introduce several efficient algorithms for clustering spatial data. First, we present a grid-based clustering algorithm that has several advantages and comparable performance to the well known efficient clustering algorithm. The algorithm has several advantages. The algorithm does not require many input parameters. It requires only three parameters, the number of the points in the data space, the number of the cells in the grid and a percentage. The number of the cells in the grid reflects the accuracy that should be achieved by the algorithm. The algorithm is capable of discovering clusters of arbitrary shapes. The computational complexity of the algorithm is comparable to the complexity of the most efficient clustering algorithm. The algorithm has been implemented and tested against different ranges of database sizes. The performance results show that the running time of the algorithm is superior to the most well known algorithms (CLARANS [23]). The results show also that the performance of the algorithm do not degrade as the number of the data points increases."
GIS statistics clustering context-sensitive-data nudge-targets data-mining- "Lexical substitutes have found use in the context of word sense disambiguation, unsupervised part-of-speech induction, paraphrasing, machine translation, and text simplification. Using a statistical language model to find the most likely substitutes in a given context is a successful approach, but the cost of a naive algorithm is proportional to the vocabulary size. This paper presents the Fastsubs algorithm which can efficiently and correctly identify the most likely lexical substitutes for a given context based on a statistical language model without going through most of the vocabulary. The efficiency of Fastsubs makes large scale experiments based on lexical substitutes feasible. For example, it is possible to compute the top 10 substitutes for each one of the 1,173,766 tokens in Penn Treebank in about 6 hours on a typical workstation. The same task would take about 6 days with the naive algorithm. An implementation of the algorithm and a dataset with the top 100 substitutes of each token in the WSJ section of the Penn Treebank are available from the author's website at this http URL"
linguistics data-cleaning algorithms nudge-targets classification [1204.1002] Fast Multi-Scale Detection of Relevant Communities
"Nowadays, networks are almost ubiquitous. In the past decade, community detection received an increasing interest as a way to uncover the structure of networks by grouping nodes into communities more densely connected internally than externally. Yet most of the effective methods available do not consider the potential levels of organisation, or scales, a network may encompass and are therefore limited. In this paper we present a method compatible with global and local criteria that enables fast multi-scale community detection. The method is derived in two algorithms, one for each type of criterion, and implemented with 6 known criteria. Uncovering communities at various scales is a computationally expensive task. Therefore this work puts a strong emphasis on the reduction of computational complexity. Some heuristics are introduced for speed-up purposes. Experiments demonstrate the efficiency and accuracy of our method with respect to each algorithm and criterion by testing them against large generated multi-scale networks. This study also offers a comparison between criteria and between the global and local approaches."
social-networks network-theory algorithms community-detection- Now this one is cool.
statistics inverse-problems biochemistry signal-processing algorithms machine-learning nudge-targets inference-of-things-that-aren't-toys - "…What exactly are we talking about when we say 'using data'? Steven Johnson wrote an interesting piece in Wired two years ago using New York City 311 call data. Those city subway/train/bus route apps on your smartphone? Possible thanks to city governments opening up their data. The recently released Kauffman Foundation health care report contains plenty of discussion and ideas for both the public and private sector."
social-entrepreneurship public-policy startups business-development-sortof shadow-economies open-science [1205.4422] 3D-Algorithms of Composed Pursuit Navigation
"The problem of pursuing a moving target is always one of the main topics in navigation. In the literatures, there are two well-known algorithms called Pure Pursuit and Pure Rendezvous navigation in the 3-dimensional space $mathbb{R}^3$. In this paper, these two methods are combined to introduce a novel family of pursuing algorithms called Composed Pursuit Navigation. The Kinematic and geometric properties of this navigation is studied. The trajectories of this new family of algorithms benefit the advantages of two known methods and its prominence is demonstrated in two real examples. Moreover, it is shown that the metric related to the algorithms are given by Matsumoto metrics."
operations-research algorithms nudge-targets[1205.5975] A Domain-Specific Compiler for Linear Algebra Operations
"We present a prototypical linear algebra compiler that automatically exploits domain-specific knowledge to generate high-performance algorithms. The input to the compiler is a target equation together with knowledge of both the structure of the problem and the properties of the operands. The output is a variety of high-performance algorithms, and the corresponding source code, to solve the target equation. Our approach consists in the decomposition of the input equation into a sequence of library-supported kernels. Since in general such a decomposition is not unique, our compiler returns not one but a number of algorithms. The potential of the compiler is shown by means of its application to a challenging equation arising within the genome-wide association study. As a result, the compiler produces multiple "best" algorithms that outperform the best existing libraries."
domain-specific-language linear-algebra software-engineering compiler nudge-targets[1206.1098] The interplay of intrinsic and extrinsic bounded noises in genetic networks
"After being considered as a nuisance to be filtered out, it became recently clear that biochemical noise plays a complex role, often fully functional, for a genetic network. The influence of intrinsic and extrinsic noises on genetic networks has intensively been investigated in last ten years, though contributions on the co-presence of both are sparse. Extrinsic noise is usually modeled as an unbounded white or colored gaussian stochastic process, even though realistic stochastic perturbations are clearly bounded. In this paper we consider Gillespie-like stochastic models of nonlinear networks, i.e. the intrinsic noise, where the model jump rates are affected by colored bounded extrinsic noises synthesized by a suitable biochemical state-dependent Langevin system. These systems are described by a master equation, and a simulation algorithm to analyze them is derived. This new modeling paradigm should enlarge the class of systems amenable at modeling. We investigated the influence of both amplitude and autocorrelation time of a extrinsic Sine-Wiener noise on: $(i)$ the Michaelis-Menten approximation of noisy enzymatic reactions, which we show to be applicable also in co-presence of both intrinsic and extrinsic noise, $(ii)$ a model of enzymatic futile cycle and $(iii)$ a genetic toggle switch. In $(ii)$ and $(iii)$ we show that the presence of a bounded extrinsic noise induces qualitative modifications in the probability densities of the involved chemicals, where new modes emerge, thus suggesting the possibile functional role of bounded noises."
biochemistry structural-biology reaction-networks biological-engineering noise its-complicated-inside-a-cell simulation nudge-targets[1205.3058] A Tight Lower Bound on the Controllability of Networks with Multiple Leaders
"In this paper we study the controllability of networked systems with static network topologies using tools from algebraic graph theory. Each agent in the network acts in a decentralized fashion by updating its state in accordance with a nearest-neighbor averaging rule, known as the consensus dynamics. In order to control the system, external control inputs are injected into the so called leader nodes, and the influence is propagated throughout the network. Our main result is a tight topological lower bound on the rank of the controllability matrix for such systems with arbitrary network topologies and possibly multiple leaders."
network-theory algorithms emergent-design nudge-targets- "However, when the game has no clear objectives, no met– ric exists to measure player contribution quality. Indeed, each player may have a different personal motivation to achieve dif– ferent self-imposed goals [4], and player actions can be con– sidered fair or disruptive towards the community depending on whether they respect or damage other player contributions. In these cases, there is a very abstract and subjective shared implicit objective that could be described as building a fair and not disruptive player community. It should be noted that fair players benefit from their behavior, as it is more likely that other players act fair towards them. Furthermore, a com– munity of disruptive players seems to repel fair players and the community quality has an intuitive tendency to gradually drop off. Contrarily, a community of fair players lures new fair players, which lead, in turn, to an increase of the commu– nity quality."
social-dynamics game-theory collaboration performance-measure teams ranking-schemes agile-management to-explore [1205.3648] 6-Body Central Configurations Formed by Two Isosceles Triangles
"In this paper,we show the existence of a class of 6-body central configurations with two isosceles triangles; which are congruent to each other and keep some distance.We also study the necessary conditions about masses for the bodies which can form a central configuration."
N-body-problems simulation mathematical-recreations nudge-targets special-cases inverse-problems-done-backwards[1206.1074] Memetic Artificial Bee Colony Algorithm for Large-Scale Global Optimization
People who misunderstand the difference between a "program", a "design pattern" and an "algorithm", I'm thinking. That said, an interesting camel's nose for getting more contextual narrative and less ridiculous overgeneralization (even accidentally) in an engineering paper.…
algorithms programming subjective-objective-decontextualization-bias rather-interesting[1205.2200] A Greedy Double Swap Heuristic for Nurse Scheduling
"One of the key challenges of nurse scheduling problem (NSP) is the number of constraints placed on preparing the timetable, both from the regulatory requirements as well as the patients' demand for the appropriate nursing care specialists. In addition, the preferences of the nursing staffs related to their work schedules add another dimension of complexity. Most solutions proposed for solving nurse scheduling involve the use of mathematical programming and generally considers only the hard constraints. However, the psychological needs of the nurses are ignored and this resulted in subsequent interventions by the nursing staffs to remedy any deficiency and often results in last minute changes to the schedule. In this paper, we present a staff preference optimization framework which is solved with a greedy double swap heuristic. The heuristic yields good performance in speed at solving the problem. The heuristic is simple and we will demonstrate its performance by implementing it on open source spreadsheet software."
scheduling operations-research heuristics performance-measure nudge-targets- "Max gives you the parts to create unique sounds, stunning visuals, and engaging interactive media. These parts are called 'objects' – visual boxes that contain tiny programs to do something specific. Each object does something different. Some make noises, some make video effects, others just do simple calculations or make decisions. In Max you add objects to a visual canvas and connect them together with patchcords. You can use as many as you like. By combining objects, you create interactive and unique software without ever writing any code (you can do that too if you really want to). Just connect."
visual-programming genetic-programming-target generative-art software languages [1205.3397] 1.85 Approximation for Min-Power Strong Connectivity
"Given a directed simple graph G=(V,E) and a nonnegative-valued cost function the power of a vertex u in a directed spanning subgraph H is given by the maximum cost of an arcs of H exiting u. The power of H is the sum of the power of its vertices. Power Assignment seeks to minimize the power of H while H satisfies some connectivity constraint. In this paper, we assume E is bidirected (for every directed edge e in E, the opposite edge exists and has the same cost), while H is required to be strongly connected. This is the original power assignment problem introduced by Chen and Huang in 1989, who proved that bidirected minimum spanning tree has approximation ratio at most 2 (this is tight). In Approx 2010, we introduced a Greedy approximation algorithm and claimed a ratio of 1.992. Here we improve the analysis to 1.85."
algorithms computational-complexity operations-research nudge-targets[1206.1106] No More Pesky Learning Rates
"The performance of stochastic gradient descent (SGD) depends critically on how learning rates are tuned and decreased over time. We propose a method to automatically adjust multiple learning rates so as to minimize the expected error at any one time. The method relies on local gradient variations across samples. Using a number of convex and non-convex learning tasks, we show that the resulting algorithm matches the performance of the best settings obtained through systematic search, and effectively removes the need for learning rate tuning."
optimization algorithms gradient-descent adaptive-control silos-in-action- "Getting better at software development can be hard work. There is an endless sea of learning materials out there, but just figuring out what topics you should focus on could take up all of your time if you let it. Don't fall into that trap, instead, let me do the legwork for you! As a subscriber to Practicing Ruby, you'll get access to well-polished weekly brain dumps about topics that will help you become a better Ruby developer. You'll also be able to join a dedicated group of Practicing Rubyists in lively conversations about the eclectic mix of topics I'm writing about."
Ruby programming tutorial subscriptions to-read [1206.1103] Periodizing quasicrystals: Anomalous diffusion in quasiperiodic systems
"We introduce a construction to embed a quasiperiodic lattice of obstacles into a single unit cell of a higher-dimensional space, with periodic boundary conditions. This construction transparently shows the existence of channels in these systems,in which particles may travel without colliding, up to a critical obstacle radius. It provides a simple and efficient algorithm for numerical simulation of dynamics in quasiperiodic structures, as well as giving a natural notion of uniform distribution (measure) and averages. As an application, we simulate diffusion in a two-dimensional quasicrystal, finding three different regimes, in particular atypical weak super-diffusion in the presence of channels, and sub-diffusion when obstacles overlap."
quasicrystals tiling algorithms topology simulation computational-geometry[1205.3193] A Comparative Study of Collaborative Filtering Algorithms
"Collaborative filtering is a rapidly advancing research area. Every year several new techniques are proposed and yet it is not clear which of the techniques work best and under what conditions. In this paper we conduct a study comparing several collaborative filtering techniques — both classic and recent state-of-the-art — in a variety of experimental contexts. Specifically, we report conclusions controlling for number of items, number of users, sparsity level, performance criteria, and computational complexity. Our conclusions identify what algorithms work well and in what conditions, and contribute to both industrial deployment collaborative filtering algorithms and to the research community."
overview collaborative-filtering performance-space prediction algorithms swarms- Genetic Programming explained. [according to most folks]
genetic-programming Lost self-definition you-keep-using-that-word [1204.6170] A distributed resource allocation algorithm for many processes
"Resource allocation is the problem that a process may enter a critical section CS of its code only when its resource requirements are not in conflict with those of other processes in their critical sections. For each execution of CS, these requirements are given anew. In the resource requirements, levels can be distinguished, such as e.g. read access or write access. We allow infinitely many processes that communicate by reliable asynchronous messages and have finite memory. A simple starvation-free solution is presented. Processes only wait for one another when they have conflicting resource requirements. The correctness of the solution is argued with invariants and temporal logic. It has been verified with the proof assistant PVS."
distributed-processing concurrency nudge-targets algorithms modeling[1205.5911] A Hough Transform Approach to Solving Linear Min-Max Problems
"Several ways to accelerate the solution of 2D/3D linear min-max problems in $n$ constraints are discussed. We also present an algorithm for solving such problems in the 2D case, which is superior to CGAL's linear programming solver, both in performance and in stability."
algorithms computational-geometry nudge-targets convex-hulls linear-programming[1205.2664] A Bayesian Sampling Approach to Exploration in Reinforcement Learning
"We present a modular approach to reinforcement learning that uses a Bayesian representation of the uncertainty over models. The approach, BOSS (Best of Sampled Set), drives exploration by sampling multiple models from the posterior and selecting actions optimistically. It extends previous work by providing a rule for deciding when to resample and how to combine the models. We show that our algorithm achieves nearoptimal reward with high probability with a sample complexity that is low relative to the speed at which the posterior distribution converges during learning. We demonstrate that BOSS performs quite favorably compared to state-of-the-art reinforcement-learning approaches and illustrate its flexibility by pairing it with a non-parametric model that generalizes across states."
exploration-and-exploitation algorithms machine-learning reinforcement-learning integrate-method-into-GP- "The new media folks desperately want to write for some hypothetical audience, one they can find the center of. They are like border collies, wired to herd sheep and frantic if they can't find any."
disintermediation-in-action journalism public-policy pollsters cultural-assumptions - "This paper studies parallelization schemes for stochastic Vector Quantization algorithms in order to obtain time speed-ups using distributed resources. We show that the most intuitive parallelization scheme does not lead to better performances than the sequential algorithm. Another distributed scheme is therefore introduced which obtains the expected speed-ups. Then, it is improved to fit implementation on distributed architectures where communications are slow and inter-machines synchronization too costly. The schemes are tested with simulated distributed architectures and, for the last one, with Microsoft Windows Azure platform obtaining speed-ups up to 32 Virtual Machines."
algorithms distributed-processing parallelization nudge-targets Crypto breakthrough shows Flame was designed by world-class scientists | Ars Technica
"More interestingly, the results have shown that not our published chosen-prefix collision attack was used, but an entirely new and unknown variant," Stevens wrote in a statement distributed on Thursday. "This has led to our conclusion that the design of Flame is partly based on world-class cryptanalysis. Further research will be conducted to reconstruct the entire chosen-prefix collision attack devised for Flame." The analysis reinforces theories that researchers from Kaspersky Lab, CrySyS Lab, and Symantec published almost two weeks ago. Namely, Flame could only have been developed with the backing of a wealthy nation-state. Stevens' and de Weger's conclusion means that, in addition to a team of engineers who developed a global malware platform that escaped detection for at least two years, Flame also required world-class cryptographers who have broken new ground in their field. "It's not a garden-variety collision attack, or just an implementation of previous MD5 collisions papers—which would be difficult enough," Matthew Green, a professor specializing in cryptography in the computer science department at Johns Hopkins University, told Ars. "There were mathematicians doing new science to make Flame work."
cryptography MD5-woops algorithms nudge-targetsOn Outreach: something's got to give | Neurotic Physiology
"A change in the way academia views outreach is going to take a while, and it may take even longer for science communication to become a really respected "alternative" career. In the meantime, many scientists DO do outreach. They go into schools, they give talks at bars, they talk to their friends and family. Some of them send me and other science bloggers articles (THANK YOU!! And you know, never hesitate to send me an article!) to cover, or speak out proudly in support of their work. There IS science outreach out there, and a lot of it is GREAT."
science! academic-culture disintermediation-targets-who-have-noticed- "Many open problems remain. Some are of a fundamental nature. What does nature allow us to compute efficiently? What does nature allow us to make secure? Others are of a more practical nature. How will we build scalable quantum computers? For what problems are there effective quantum algorithms? How broad an impact will quantum information processing have? At the very least, quantum computation, and quantum information processing more generally, has changed forever how humanity thinks about and works with physics, computation, and information."
quantums quantum-computing overview [1205.6867] Minimizing the average distance to a closest leaf in a phylogenetic tree
"In this paper we described a simple new criterion, minimizing the Average Dis– tance to the Closest Leaf (ADCL), for finding a subset of sequences that either represent the diversity of the sequences in a sample, or are close on average to a set of query sequences. In doing so, abundance information is taken into account and attempt to strike a balance between optimality and centrality in the tree. In particular, this criterion is the only way in which we are aware to pick sequences that are phylogenetically close on average to a set of query sequences. We have also investigated means of minimizing the ADCL, including a heuristic that performs well in practice and an exact dynamic program. ADCL minimization appears to avoid picking chimeric sequences in simulation."
algorithms phylogenetics cladistics performance-measure nudge-targets bioinformatics- "How do I run a command from history? Type some part of the command, and then hit the up or down arrow keys to navigate through history matches."
want unix shell - "Many models for sparse regression typically assume that the covariates are known completely, and without noise. Particularly in high-dimensional applications, this is often not the case. This paper develops efficient OMP-like algorithms to deal with precisely this setting. Our algorithms are as efficient as OMP, and improve on the best-known results for missing and noisy data in regression, both in the high-dimensional setting where we seek to recover a sparse vector from only a few measurements, and in the classical low-dimensional setting where we recover an unstructured regressor. In the high-dimensional setting, our support-recovery algorithm requires no knowledge of even the statistics of the noise. Along the way, we also obtain improved performance guarantees for OMP for the standard sparse regression problem with Gaussian noise."
statistics algorithms nudge-targets performance-measure cultural-assumptions-of-statistics - "We study the inverse power index problem for weighted voting games: the problem of finding a weighted voting game in which the power of the players is as close as possible to a certain target distribution. Our goal is to find algorithms that solve this problem exactly. Thereto, we study various subclasses of simple games, and their associated representation methods. We survey algorithms and impossibility results for the synthesis problem, i.e., converting a representation of a simple game into another representation. We contribute to the synthesis problem by showing that it is impossible to compute in polynomial time the list of ceiling coalitions (also known as shift-maximal losing coalitions) of a game from its list of roof coalitions (also known as shift-minimal winning coalitions), and vice versa. "
inverse-problems algorithms game-theory voting nudge-targets [1206.0937] Detecting Activations over Graphs using Spanning Tree Wavelet Bases
"This paper focuses on the problem of detecting activations over a graph when observations are corrupted by noise. The problem of detecting graph-structured activations is relevant to many applications including identifying congestion in router and road networks, eliciting preferences in social networks, and detecting viruses in human and computer networks. Furthermore, these applications require that the method is scalable to large graphs. Luckily, computer science boasts a plethora of efficient graph based algorithms that we can adapt to the detection framework."
statistics network-theory algorithms pattern-discovery inverse-problems nudge-targets[1206.1270] Factoring nonnegative matrices with linear programs
"This paper describes a new approach for computing nonnegative matrix factorizations (NMFs) with linear programming. The key idea is a data-driven model for the factorization, in which the most salient features in the data are used to express the remaining features. More precisely, given a data matrix X, the algorithm identifies a matrix C that satisfies X is approximately equal to CX and some linear constraints. The matrix C selects features, which are then used to compute a low-rank NMF of X. A theoretical analysis demonstrates that this approach has the same type of guarantees as the recent NMF algorithm of Arora et al. (2012). In contrast with this earlier work, the proposed method (1) has better noise tolerance, (2) extends to more general noise models, and (3) leads to efficient, scalable algorithms. Experiments with synthetic and real datasets provide evidence that the new approach is also superior in practice. An optimized C++ implementation of the new algorithm can factor a multi-Gigabyte matrix in a matter of minutes."
via:cshalizi algorithms linear-programming nudge-targets[1206.1032] Frequent Patterns mining in time-sensitive Data Stream
"Mining frequent itemsets through static Databases has been extensively studied and used and is always considered a highly challenging task. For this reason it is interesting to extend it to data streams field. In the streaming case, the frequent patterns' mining has much more information to track and much greater complexity to manage. Infrequent items can become frequent later on and hence cannot be ignored. The output structure needs to be dynamically incremented to reflect the evolution of itemset frequencies over time. In this paper, we study this problem and specifically the methodology of mining time-sensitive data streams. We tried to improve an existing algorithm by increasing the temporal accuracy and discarding the out-of-date data by adding a new concept called the "Shaking Point". We presented as well some experiments illustrating the time and space required."
pattern-discovery time-series data-mining algorithms trading nudge-targets[1206.0580] O(1) Delta Component Computation Technique for the Quadratic Assignment Problem
"The paper describes a novel technique that allows to reduce by half the number of delta values that were required to be computed with complexity O(N) in most of the heuristics for the quadratic assignment problem. Using the correlation between the old and new delta values, obtained in this work, a new formula of complexity O(1) is proposed. Found result leads up to 25% performance increase in such well-known algorithms as Robust Tabu Search and others based on it."
algorithms combinatorics operations-research quadratic-assignment nudge-targets- "Dynamical modelling lies at the heart of our understanding of physical systems. Its role in science is deeper than mere operational forecasting, in that it allows us to evaluate the adequacy of the mathematical structure of our models. Despite the importance of model parameters, there is no general method of parameter estimation outside linear systems. A new relatively simple method of parameter estimation for nonlinear systems is presented, based on variations in the accuracy of probability forecasts. It is illustrated on the Logistic Map, the Henon Map and the 12-D Lorenz96 flow, and its ability to outperform linear least squares in these systems is explored at various noise levels and sampling rates. As expected, it is more effective when the forecast error distributions are non-Gaussian. The new method selects parameter values by minimizing a proper, local skill score for continuous probability forecasts as a function of the parameter values. This new approach is easier to implement in practice than alternative nonlinear methods based on the geometry of attractors or the ability of the model to shadow the observations. New direct measures of inadequacy in the model, the "Implied Ignorance" and the information deficit are introduced."
statistics symbolic-regression parameter-estimation algorithms nudge-targets - "…And listen, trust me, even if you do not feel that way at the end of these years, even if you are feeling burned out and done with the vagaries of social user design interaction universal community-driven agile information experience, even if you are ready to close your laptop screen forever, you are beloved on the earth. You are skilled and talented and young and bright and accredited. The world wishes it were you."
advice speech [1206.0629] DEMON: a Local-First Discovery Method for Overlapping Communities
"Community discovery in complex networks is an interesting problem with a number of applications, especially in the knowledge extraction task in social and information networks. However, many large networks often lack a particular community organization at a global level. In these cases, traditional graph partitioning algorithms fail to let the latent knowledge embedded in modular structure emerge, because they impose a top-down global view of a network. We propose here a simple local-first approach to community discovery, able to unveil the modular organization of real complex networks. This is achieved by democratically letting each node vote for the communities it sees surrounding it in its limited view of the global system, i.e. its ego neighborhood, using a label propagation algorithm; finally, the local communities are merged into a global collection. We tested this intuition against the state-of-the-art overlapping and non-overlapping community discovery methods, and found that our new method clearly outperforms the others in the quality of the obtained communities, evaluated by using the extracted communities to predict the metadata about the nodes of several real world networks. We also show how our method is deterministic, fully incremental, and has a limited time complexity, so that it can be used on web-scale real networks."
network-theory algorithms community-discovery statistics explanation referral-networks[1206.0430] Congestion Games on Weighted Directed Graphs, with Applications to Spectrum Sharing
"With the advance of complex large-scale networks, it is becoming increasingly important to understand how selfish and spatially distributed individuals will share network resources without centralized coordinations. In this paper, we introduce the graphical congestion game with weighted edges (GCGWE) as a general theoretical model to study this problem. In GCGWE, we view the players as vertices in a weighted graph. The amount of negative impact (e.g. congestion) caused by two close-by players to each other is determined by the weight of the edge linking them. The GCGWE unifies and significantly generalizes several simpler models considered in the previous literature, and is well suited for modeling a wide range of networking scenarios. One good example is to use the GCGWE to model spectrum sharing in wireless networks, where we can properly define the edge weights and payoff functions to capture the rather complicated interference relationship between wireless nodes. By identifying which GCGWEs possess pure Nash equilibria and the very desirable finite improvement property, we gain insight into when spatially distributed wireless nodes will be able to self-organize into a mutually acceptable resource allocation. We also consider the efficiency of the pure Nash equilibria, and the computational complexity of finding them."
network-theory algorithms agent-based nudge-targets complexology[1206.0855] A Mixed Observability Markov Decision Process Model for Musical Pitch
"Partially observable Markov decision processes have been widely used to provide models for real-world decision making problems. In this paper, we will provide a method in which a slightly different version of them called Mixed observability Markov decision process, MOMDP, is going to join with our problem. Basically, we aim at offering a behavioural model for interaction of intelligent agents with musical pitch environment and we will show that how MOMDP can shed some light on building up a decision making model for musical pitch conveniently."
music machine-learning generative-art pattern-discovery nudge-targets[1206.0766] Why Optimal States Recruit Fewer Reactions in Metabolic Networks
"The metabolic network of a living cell involves several hundreds or thousands of interconnected biochemical reactions. Previous research has shown that under realistic conditions only a fraction of these reactions is concurrently active in any given cell. This is partially determined by nutrient availability, but is also strongly dependent on the metabolic function and network structure. Here, we establish rigorous bounds showing that the fraction of active reactions is smaller (rather than larger) in metabolic networks evolved or engineered to optimize a specific metabolic task, and we show that this is largely determined by the presence of thermodynamically irreversible reactions in the network. We also show that the inactivation of a certain number of reactions determined by irreversibility can generate a cascade of secondary reaction inactivations that propagates through the network. The mathematical results are complemented with numerical simulations of the metabolic networks of the bacterium Escherichia coli and of human cells, which show, counterintuitively, that even the maximization of the total reaction flux in the network leads to a reduced number of active reactions."
network-theory biological-engineering metabolic-networks systems-biology engineering-design structural-biology- "But the ideas originally behind that trope — now that's the cool part. My friends who work in aerospace tell me the old guys who built the industry all grew up reading Heinlein and Clarke, and went into aerospace to turn those crazy things they read as kids into practical realities as adults. Well, I work in supercomputing, and I can assure you that this industry is full of young geniuses who grew up reading Gibson, Vinge, and Rucker — and yes, me — and they went into this field to do the same thing. We don't quite live in the world that cyberpunk fiction predicted. But we live in the world that the kids who grew up reading cyberpunk fiction built, and that is a very cool thing indeed."
cyberpunk fiction genre retrospective science-fiction cultural-norms


text:
Hi Raw Family!!!!
For the Month of December, I will be making yummy RAW dishes featuring Alissa's FABULOUS books, Living on Live Food and Raw Food For Everyone!!!
I started today with fruit taken from my co-op share!!! I'm planning to have a Greek Salad for dinner (RFFE), so my first nutless recipe is the Breadsticks to go with that later. I made them early this morning, so hopefully they will be ready by tonight.

subset: commoncrawl


text: Your farm party won't be complete until you've topped the cake with our darling Barn Candle set! Our barn candles include a set of 4 farm themed candles, featuring a red barn, a green tractor, a cow, and a chicken. These theme enhancing barn candles are sure to keep the party chug-chugging, cluck-clucking, and mooooving right along! Please keep out of children's reach.


text:
Events Home > ERIC BENET
Wed 8:00 PM
620 T St NW Washington, DC 20001
Photos Pics: Cana Vineyards
Photos Pics: Early Mountain Vineyard
A True-Blue Winterfest -- With Plenty of Snow
Takin' It Off in the Name of Love
The British Are Coming!
Ravens' Victory Parade Set for Tuesday
We accept .jpg, .gif, .png and .tif files under 12MB.
Select an image file to upload
Enter the URL of an image on the web
e.g. http://www.example.com/image.jpg


text:
Fort Wayne Welcomes Holiday Season
By: Robert Bumsted
Updated: November 21, 2012
This year's Night of LIghts kicked off on Main Street at the Aunt Millie's Bread Company Downtown. Thousands of lights now adorn the side of the community center.
As the evening progressed, thousands of people walked through downtown to witness the lighting of many of the city's light displays.
The oldest and largest display is the Santa Claus light display on the side of the PNC Bank building on Main Street. Fort Wayne Mayor Tom Henry and officials from PNC Bank ushered in the 33-year-old tradition.


text:
We work to understand what you do, who you target and your definition of success.
Friendly, helpful, proficient and professional, Nimlok partners and authorized dealers are certified industry experts, who will not only inspire, guide and manage your project from concept to completion, but who will also offer assistance and advice for maximizing your trade show marketing and trade show ROI with booth management techniques and pre and post-show marketing and service programs.
A Nimlok team of consultants, project managers, designers and carpenters partner with you to DELIVER a solution that aligns with your trade show strategy, meets your goals, budget and timeline and EXCEEDS your expectations.
See Nimlok exhibit booths that provide clear Return on Imagination to face-to-face marketing.


text:
Thinking of going? Let your friends know by clicking one of the buttons on your favourite date in the list below.
0 Going
0 Might Go
Why not share this with your friends?
Share this on Facebook
Welsh post-hardcore five-piece Funeral For A Friend's cult following continues to go from strength to strength.
They scooped the 2003 Kerrang award for Best UK Newcomer and with a string of top twenty singles and albums behind them, they're heading back out on tour.
Known for their passionately devout fan base and explosive live shows, Funeral For A Friend are a must see for any rock fan. FFAF tickets on sale now!
Funeral For A Friend
Guildford, UK
Fri 7 Jun 2013
Reading, UK
Sat 15 Jun 2013
Reading University Students Union
Edinburgh, UK
Sun 16 Jun 2013
Electric Circus
Aberdeen, UK
Mon 17 Jun 2013
The Tunnels
Inverness, UK
Wed 19 Jun 2013
The Ironworks Inverness
Carlisle, UK
Fri 21 Jun 2013
The Brickyard
Doncaster, UK
Sat 22 Jun 2013
The Leopard
Derby, UK
Sun 23 Jun 2013
The Venue Derby
Sunderland, UK
Wed 10 Jul 2013
Deichbrand Festival
Nordholz/Cuxhaven, Germany
Thu 18 Jul 2013
Seeflughafen Cuxhaven/Nordholz
Tickets from £102.61
We guarantee that you'll get the tickets you ordered in time for the event or we'll refund your money.
Read more
Follow your favourite artists with My Bands and build your personal gig diary today.


text:
This article was originally distributed via PRWeb. PRWeb, WorldNow and this Site make no warranties or representations in connection therewith.
SOURCE: A' Design Award
A' Award and Competitions are pleased to announce that the work Bonfire by Eric Steigelman has been honored with the famed Golden A' Design Award in Packaging Design Category
Como, Italy (PRWEB) February 09, 2013
Packaging Design Category Golden A' Design Award Victor
A' Award and Competitions are pleased to announce that the work Bonfire by Eric Steigelman became winner of the famed Golden A' Design Award in Packaging Design Category marked as one of the winners by the respected judging committee of the A' Design Awards & Competitions among thousands of projects.
Concerning Bonfire
Eric Steigelman, the creator of the awarded work Bonfire demonstrates "The wine market is experiencing a shift due to changes in product appeal as Millennial and Generation X consumers demonstrate their discerning taste. There is a new appreciation for a fresh approach to communicating creativity and vibrant alternatives in the marketplace. Bonfire Wines is dedicated to innovation in this market by offering high quality wines in convenient packaging at a great value to the customer."
The Golden A' Design Award
The Golden A' Design Award is a prestigious award given to top 3% percentile designs that has delivered an exemplary level of quality in design. The designs are judged by a panel of three different jury which is composed of Academic, Professional and Focus Group Members. The designs are evaluated with score normalization to remove any biases and are voted on aspects such as functionality, ergonomics, engineering, presentation, innovation, usability, fun details, technology, and any other specific points that could be considered, each of these points are further weighted for different jury groups.
About A' Design Award and Competitions
A'Design Award and Competitions, aims to highlight the excellent qualifications of best designs, design concepts and design oriented products. A' Design Award and Competitions are organized and awarded annually and internationally in multiple categories to reach a wide, design-oriented audience. Learn more at: http://www.whatisadesignaward.com
For the original version on PRWeb visit: http://www.prweb.com/releases/prweb2013/2/prweb10415328.htm


text:
So it turns out that even delivering former President Bill Clinton as a Golden Globes presenter isn't enough to persuade the Hollywood Foreign Press Assn. to vote for your "brilliant" film.
Does this mean "Lincoln" is no longer the front-runner for the best picture Oscar? Not at all. Even though we're imagining that Tommy Lee Jones kept that death-stare look on his face right through George Clooney presenting the best drama Globe to "Argo," he needn't be that glum. (Yes, we know. He can't help himself. Still.) "Lincoln" was too particularly American to appeal to HFPA voters in the first place. The last three Globes drama winners — "The Descendants," "The Social Network" and "Avatar" — all came up short for the Oscar best picture, with the latter two losing to other dramas. "Lincoln" remains the movie to beat with academy members, who were the ones, by the way, that Clinton was really addressing last night.
Ben Affleck's win for director obviously has no effect on that race for the Oscars, since he wasn't even nominated there, but the thunderous standing ovation he received certainly indicates that his movie remains strongly in play as a best picture alternative to "Lincoln." The HFPA has a history of giving A-list actors the directing prize — stardom always trumps excellence with this bunch — so Affleck's victory over the likes of Steven Spielberg and Kathryn Bigelow wasn't at all a surprise.
PHOTOS: Golden Globes 2013 red carpet
Daniel Day-Lewis was the lone "Lincoln" nominee to win, and he remains a lock for the lead actor Oscar. Hugh Jackman will have to come up with better stories than the ones he told from the stage Sunday night for him to gain any traction with voters. We don't care about your stolen bike wheels, Hugh. And your wife really shouldn't have had to persuade you not to drop out of "Les Miz." What? Were you worried it would cut into your planning time for a "Real Steel" sequel? Find a better narrative.
The lead actress race remains unchanged with the front-runners, Jennifer Lawrence ("Silver Linings Playbook") and Jessica Chastain ("Zero Dark Thirty"), winning Globes in their respective categories. If you're splitting hairs, Chastain delivered a more by-the-book acceptance speech, breathlessly offering thanks and dutifully noting years of dues-paying. Lawrence, meanwhile, looked at her Globe as if examining the inscription, and said, "What does this say? 'I Beat Meryl!'" The line won a few laughs, but we bet Jones wasn't the only one in the room glowering at the jesting boast, either.
Christoph Waltz's win for his turn as the locquacious bounty hunter in "Django Unchained" continues to advance the Austrian actor's late awards-season momentum. At the Oscars, he'll be competing against Jones, Philip Seymour Hoffman, Robert De Niro and Alan Arkin, all of whom, like Waltz, have won Academy Awards. Waltz's chances for an Oscar win are getting better by the day as voters have been enthusiastically responding to his character in "Django," which is essentially a good-guy variation of Col. Hans Landa, the monstrous Nazi he played in Tarantino's "Inglourious Basterds." With the possible exception of Samuel L. Jackson, nobody handles Quentin Tarantino's twisty monologues better than Waltz.
Golden Globes 2013: List | Red Carpet | Winners | Ballot | Show moments |Best & Worst | Quotes
And yes, Anne Hathaway won the supporting actress Globe for playing dear, tragic Fantine in "Les Miz," and she'll go on to win the Oscar too. Hathaway's inspired shout-out to Sally Field felt like it came from the heart, and that line about the Globe being "this lovely blunt object that I will forevermore use as a weapon against self-doubt" probably took the audience's tear ducts back to the time they first heard Hathaway's "Les Miz" heroine singing about a time gone by when hope was high and life worth living. Now all Hathaway needs to do is come up with a creative use for her Oscar.
Golden Globes 2013: Jodie Foster turns show on its head
Golden Globes 2013: Bill Clinton touts 'Lincoln,' but 'Argo' wins


text:
You are currently viewing the beta version of the new AMM site. Click here to return to the current site.
Oct 05, 2012 | 03:41 PM | Mark Burton
Tags lead, lead premiums, Mark Burton
LONDON European lead premiums have risen further, responding to a global tightness in scrap supply and strong demand from secondary smelters. The Rotterdam lead premiums of AMM sister publication Metal Bulletin rose to $55 to $75 per tonne Friday, up from $40 to $65 per tonne a day earlier and as much as four times higher....
LONDON European lead premiums have risen further, responding to a global tightness in scrap supply and strong demand from secondary smelters.
To access AMM's full content, please log in below. If you do not have an AMM account, we invite you to take a free trial or subscribe below.
Access to amm.com editorial content is granted only to paid subscribers and trialists. If you do not have an active account in your own name, please either subscribe or take a trial and you will have instant access to amm.com content. Sharing your login credentials with individuals who are not subscribers represents a violation of AMM copyright.
Every morning, every minute no matter how often you follow the markets, there's an AMM subscription to fit your needs.
Not sure if you are ready to invest in a subscription right now? Take a free, no-obligation trial. Start your free trial today.
Do you think steel mills will succeed in their efforts to stop selling at a discount to the CRU index?
June 20-21, 2013 New York
This whole thing is becoming a game of smoke.
Midwest service center


text:
Archives > Celina Record > News
Collin County serial robbery suspect arrested: Benjamin Anthony Sanchez located thanks to tip
Submitted photo - Benjamin Anthony Sanchez
By Anthony Tosie, firstname.lastname@example.com
The McKinney Police Department has arrested a man in connection with at least five recent aggravated robberies in Collin County, including one in Frisco.
Shortly after 10 p.m. on Nov. 9, McKinney police and members of the U.S. Marshals arrested Benjamin Anthony Sanchez, 59, at the Value Place motel, located at 3401 North Central Expressway.
The Value Place motel is located less than four miles from a U.S. Post Office in McKinney where police say Sanchez attempted to rob an elderly couple at gunpoint.
�Someone saw him on the news and happened to send in a tip the day we arrested him,� Malolepszy said. �We greatly appreciate all the help the community�s provided in aiding this arrest � the tipster really made it possible.�
So far, McKinney police have submitted paperwork to the Collin County District Attorney�s Office to charge Sanchez in three of the robberies, Malolepszy said. Those incidents are the aggravated robberies of two Cash Now stores in McKinney as well as a McKinney Subway restaurant.
The other two incidents � aggravated robberies at the U.S. Post Office in McKinney and at a Frisco Costco � are still being investigated for potential charges.
In all five robberies, Sanchez is said to have brandished a handgun.
McKinney police contacted the U.S. Marshals for additional help in the arrest when they learned of Sanchez�s location.
�We have several detectives who are deputized marshals � so they�re on that task force that helped us,� Malolepszy said. �But the other members on that task force come in and help us when we have felony suspects. They help us with intelligence issues across the board as well.�
McKinney police are coordinating with the Frisco Police Department in relation to the robbery of the Frisco Costco. That incident took place at about 10:44 a.m. on Oct. 31.
�We�re currently working leads to develop more information in our case and have remained in contact with the McKinney Police Department,� Sgt. Brad Merritt of the Frisco Police Department said. �Hopefully within the next few days we�ll have more information to share, but we haven�t talked to the suspect yet.�
Sanchez is currently being held in the Collin County Jail in lieu of $100,000 bonds for two counts of aggravated robbery.
The following are comments from the readers.
In no way do they represent the view of Starlocalnews.com
In no way do they represent the view of Starlocalnews.com
You must register with a valid email to post comments.
Only your Member ID will be posted with the comments.
Only your Member ID will be posted with the comments.
Registered users sign in here:
Become a Registered User
- Return to: News «
- Home «
- Top of Page ^


text:
Read what customers are saying about this product:
Rating: 5.00 out of 2 votes cast
Great dress!
I just received this dress in the mail this week and wore it the next day. It fits great, no wrinkles and very comfortable. It has a fun design but conservative enough to wear at work. Great dress!!
Columbia, Missouri
Love it !
This is a lovely dress, got it for valentine and I got all kinds of complements. Love it
St. Louis
Click here to read all of this product's reviews


text:
Governor Bill Haslam signed the bill into law Thursday. It says school districts can allow employees with police training and the proper certification to have guns in schools.
It happened around 9:30 p.m. Thursday at the Wendy's at 8305 Kingston Pike.
The overpass from the State Street garage to the former escalator landing is set to open Friday, according to the State Street Garage blog.
The zoo teamed up with Wampler's farm sausage, a company working to become energy independent, to pay for and install a 50-kilowatt solar array that will create green energy.
The change is being driven by Millennials, those ages 16 to 34, who like to live in the city center and don't necessarily need or want a car.
A large sign depicting a Christmas tree was removed Thursday at the former site of the Christmas Inn.
It is never too late to get help. That is the message from a counselor who has devoted years to helping military veterans cope with Post Traumatic Stress Disorder, or PTSD.
KUB has completed construction in zone one of the Lyons View Pike project. The section of Lyons View between Kingston Pike and Colony Way has reopened to traffic.
Florida officials say the car the trio was in was reported stolen on Wednesday in Knoxville. Inside the car, troopers found several items linked to multiple Knoxville robberies.
President Obama has nominated a Knoxville attorney to be a federal judge.
Weekdays: 5:30am-10am
View Current Traffic Conditions


text:
Hot Japanese chick, red lingerie and POV perspective - don´t know about you but it´s all I need! Akiho Yoshizawa straddles a guy takes his junk in her sensual small hands, pumping it and squeezing just as it should be done. That little red devil knows how to make a good handjob and proves with by playing with still warm jizz in her fingers
Screenshots (Total 38) | Comments (0) | Detailed Info | More Stuff |
Yuria Satomi |
Yuria Satomi is a hot Asian MILF in her office suit. She is in the break room with a co worker and he is interested in her sexy pantyhose and her pussy. She is making out with him and doing some hand work on his cock when he gets to her w..
Yuria Satomi |
Round tit and horny babe Yuria Satomi making out and hardcore fucked. She tease and makes out with her hung lover and strips down on her sexy dress. She get her boobies squuezed and wet pussy licked. She humps on his cock, grinds on it ti..
More Akiho Yoshizawa
Check out this lovely babe Kazuha Mukai, she is one of the sexiest looking chicks that you will ever see in your life. Here you will be seeing this babe in some insane group action where you will be seeing her sucking cock like a mad woman and you will be seeing her ending up with cum on her face too
Can´t get enough out of this chick Kazuha Mukai, she seriously is one of the finest looking gals out there. Here you will be seeing her absolutely loving this hardcore action where you will be seeing her getting some doggy style and riding cock like a mad woman ending up with cum on her tits too
Look at this nice teen that we have for you right here Kazuha Mukai, she sure has everything that a man could ever ask for. Here you will be seeing this insane cock sucking maniac getting really down and dirty where you will be seeing her loving this ball licking action ending up with cum in her mouth
You Might Also Like
Featured model : Marin Asaoka
I met Marin Asaoka in a new club I was checking out for the paper. She is a petite little thing about 5 feet tall and she was dressed like a china doll. They had her waitressing instead of being where she belonged which was on stage. She is built??¦man, nice big tits, a tight round ass she would have been great if given the chance. Anyway we ..
Marin Asaoka Big Tits Babe Sex Asian Tramp Is Ready To Suc..
- 84%
- Movie size : 388 Mb
- Movie length : 50:32
Featured model : Aya Matsuki
Aya Matsuki is a hot gal who is into all kinds of surprise sex. She enjoys her dildos and uses them in the office. She sucks cock and enjoys the cock in her mouth. She is a busty babe who gets off on the office sex. Aya Matsuki gets her pantyhose ripped when her guy is in a hurry to get into her hot pussy. She is going to suck his cock and get a ..
- 75%
- Movie size : 449 Mb
- Movie length : 28:28
Featured model : Izumi Yamaguchi
This cute Asian teen is a doll who enjoys showing off her hot body in pictures. She has a nice firm young shape she likes to show off in pictures. She is a waitress in the club a few nights a week and the rest of the time she likes to spend in the pet shop next door. She takes care of the fish section there. She says she likes the peacefulness of..
Izumi Yamaguchi Pretty Asian Babe Plays With Her Shaved Pu..
- 83%
- Movie size : 51 Mb
- Movie length : 3:45
Sensual Japanese model Saki Kouzai has a whole evening to herself and she´ll use it well. Big bed, dimmed light, sexy lingerie and her favourite vibrator will make sure she gets all the pleasure there is. Her fingers are doing a great job at fondlig her already juisy cunt and her clit gets all the vibes it can take.
Sensual and elegant Saki Kouzai treats her clit to a vibra..
- 67%
- Movie size : 660 Mb
- Movie length : 18:14
If you´re looking for some really fucking hot action, than you better come and check out this really wild action that we have for you right with this babe Ogura Nana in sexy stockings right here where you will be seeing her sucking dick and riding cock like a real wild woman as well so come and watch!
Lovely chick Ogura Nana cock sucking and dick riding with ..
- 100%
- Movie size : 906 Mb
- Movie length : 37:12
Featured model : Chie Asada
Chie is a waitress in the club. Her friends all know of her work on the web site she has. It used to be a secret and need passwords supplied by her to get in to see it. She is a hot Asian babe who enjoys her dildo play, and doing it in front of an audience. She has a couple big dildos she enjoys showing off on her site. You would never know she w..
- 84%
- Movie size : 271 Mb
- Movie length : 17:12
Featured model : Mizuki
Mizuki is a hot Japanese milf who shows off her hot tits in her sexy lingerie. She gets some anal fingering in her tight asshole before getting her ass licked by her guy; She is good at sucking cock and inserts his cock into her mouth for a deep throat sucking. He licks her juicy cunt before giving her a penetrating ass fucking! When he is done, ..
- 82%
- Movie size : 546 Mb
- Movie length : 34:40
Featured model : Yukiko Suo
Yukiko Suo is in her maid uniform and she is cleaning up a room. Three guys come in as she is cleaning and decide they want to have some fun with her! She gets tied and shows off her big tits while she is getting fingered and she is taking turns sucking cock for the guys. She gets cum all over her pretty face before she can ride a cock. Yukiko S..
- 76%
- Movie size : 424 Mb
- Movie length : 26:48
Kokomi Sakura is a crazy chick that is just too horny for her own good! Babe can´t even wait long enough to find some cock, so she just grabs any toys and start stuffing herself with joy. Those little massaging devices get her really hot and on the edge of comming, but the good old dildo is what got the job done!
- 100%
- Movie size : 237 Mb
- Movie length : 15:02
Featured model : Sora Aoi
Sora likes to play games with her guy friends. This naughty Asian doll is tied up so she can´t move, and her guys have lots of vibrating pussy toys they can use on her to pleasure or torture her. She has nice round tits and a lovely tight pussy she is happy to show off at any time. Her guys are having fun with her and she is a partier till t..
- 83%
- Movie size : 254 Mb
- Movie length : 16:07
Featured model : Japanese AV Model
Check out this really hot cock sucking maniac that we have for you right here in some of the best hardcore action that you will ever see in your life. you will be seeing this hottie begging or a nice and hard rear fuck and you will be seeing her getting it nice and hard too and receiving some of the best doggystyle
- 100%
- Movie size : 741 Mb
- Movie length : 25:38
Featured model : Japanese AV Model
This sexy pair of legs on this AV model look like the gateway to heaven when her dress is pulled up, and we see her beautiful pantied ass. Soon enough, that dress comes off to reveal her luscious tits and wet pussy. Her sexy ass gets covered in oil and massaged, while her pussy is massaged as well with a powerful vibrator that makes her cum with ..
- 0%
- Movie size : 475 Mb
- Movie length : 30:09
Related DVDs
- Three Hot-chick Mo..
- 0%145 min. 32 sec.
- Molester Obscenity..
- 0%113 min. 25 sec.
- Tekoki That Reliev..
- 0%170 min. 2 sec.
- Perfect Body - Sha..
- 0%102 min. 53 sec.


text:
Need Help? Call (877) 512-7305
To view this content you need the latest version of the Adobe Flash Player.
Download the free Flash Player now!
(based on 14 reviews)
of respondents would recommend this to a friend.
Best Uses
Feels too small
Feels true to size
100% (3 reviews)
(3 reviews)
Feels too big
Feels too short
Feels true to length
Feels too long
Reviewed by 14 customers
Sort by
Displaying reviews 1-14
Back to top
great wool cardigan
By stuff
from n. & s. CA
About Me Classic, Comfort-oriented, Practical
an awesome sweater...finally, a carigan that's not too short....great wool prodcut....I've been wearing their clothes for over 30 years....
Comment on this review(earn bonus points)
By Ranger Don
from Fayetteville, NC
About Me Comfort-oriented, Practical
I wanted an every-day light, comfortable cardigan sweater from Woolrich AND on-sale. I found it with this. As usual for me, I read the reviews so I was not surprised by others' "cons." Except for having to have it dry-cleaned, it meets my other criteria. I especially like the color for everyday wear. It's the right fit, and the right heft. Well done Woolrich!
Very Nice
By Dean
from Pensacola
About Me Classic
See all my reviews
Woolrich is a name representing quality and a fine American product, It would be nice if they did not ship their material overseas to make garments for cheaper labor. Put American workers back to work please.
Good value
By Dave
from Elbert Co.
Service was excellent
Great Value
By mikecrow
from Prov RI
Easy to orderArrived promptly
Great sweater
By Richard
from Montville NJ
Very nice color of red/ Large fits me, but this is a bit smallish at the waist. Its OK!.
Merino wool cardigan
By KEB
from Gulfport, MS
I've been looking for a nice cardigan for a while. They're hard to come by.
Great buy
By CT George
from Durham, CT
Colors are easy to match, warmth is excellent for a light weight sweater so it is useful across three seasons. Quality is first rate
Ruby Red
By Buffalo Bill
from Buffalo, NY
(1 of 1 customers found this review helpful)
Super soft cardi
By John B. Goode
from Pasadena, CA
The softest wool sweater I've ever owned. Fits great. Looks great. Love it.
I would buy this product again and again
By Constance
from Hudson, WI
It's super soft and my Husband loves it!
By Joenry48
from Vicenza, Italy
Marino wool is light and very warm not bulky. Excellent for layering on a chilly day when you don't want to wear a heavy bulk coat. I'll use it around the office and at home. I will order the other color wood brown. Thanks Woolrich for your great quality standards.
leeward cardigan
By Penny
from Columbus, Nebraska
this is a wonderful sweater that we needed to exchange for a larger size. The exchange process seems to be with little stress athough we have not received the exchange item as yet. (we only sent the original sweater back yesterday.
The Perfect Cardigan
By VetMed
from NJ
At long last, the perfect Cardigan - great at home and at the office. Thank you Woolrich


text:
Known as the "Miracle Tea," Rooibos is indigenous to the Cederberg mountain high desert region in the western Cape of South Africa; the only place in the world it's grown. This small, leguminous shrub has needle-like leaves, fine stems, and tiny yellow flowers. Sun-dried, Rooibos is processed like traditional teas.
Teasan, derived from the French, tisane, is Numi's term for a brewed herbal beverage with no tea leaves. Rooibos has no additives, preservatives or colourounts, has a light vanilla scent and yields a rich orange brew.
Rooibos' health benefits are numerous. In-vitro tests in Japan show that it exhibits anti-mutagenic properties and retards growth of certain tumors. Rooibos aids in relieving stomach and indigestive problems, benefits the management of allergies and exhibits anti-viral activity. Because Rooibos contains very little tannin, it doesn't impair iron and protein absorption in the body. It actually contains iron, potassium, and copper and supplements the daily intake of calcium, manganese, and fluoride. It also contains zinc, which helps promote healthy skin and enhances a healthy nervous system. And, of course, it does what a good cup of tea should do- soothe. Most importantly, Rooibos is refreshing, delicious, great in the morning, and lets you sleep well at night.


text:
Rank: 1257
active 7 months ago
Search the Street Team
Shari's Badges
Shari's Friends
Ello!! ^w^ I'm Brianna. <3
I'm 23? Not much of a life story yet HAHAHAHA
I don't want to live - I want to love first, and live incidentally.
At the end of the day, love and compassion will win. Terry Waite
Just your average everyday pagan-hippie-lesbian-activist.
I'm a huge The Vampire Diaries fan.
I'm 17. And I love animals.
Doctor Who Fan who was raised by carnivorous parents and saw the vegetarian light. Is an aspiring veterinarian who plans to spend the rest of her life helping animals.
I'm just fighting for animals in South America
When you try your best but you don't succeed ♫
Are we all failures in disguise for the dream we brought to life from behind our name in lights, our shadow's cast but will they last?
Share This Profile


text:
Eskimo North
Internet Access & Hosting
(206) 812-0051 or toll-free (800)
Web Applications
Account Services
Services & Rates
Internet Access
Domain Hosting
Remote Computing
Dial Access Settings
Application Settings
Free Web Games
Java & Flash Games
System Information
How To Do It
Customer Web Sites
Linux Resources
Web Crafting Tools
Support Hours
Support is available 9am-9pm Every Day.
This Ain't Your Granpappys' Shell
What could you do with a high performance computer running 24x7 with a solid high speed connection to the Internet backbone loaded with thousands of modern applications and access to it's desktop anywhere in the world with full graphics and mouse control just as if you were sitting right in front of it?
This is exactly what our shell accounts offer. While we provide standard ssh, telnet, and rlogin access like the other guys, we also provide much more with a secure remote graphical Gnome or KDE desktop.
CLICK HERE Free Two Week TrialIf you have Comcast for access and you are having problems sending e-mail, click here.
Eskimo North • P.O. Box 55816 • Shoreline WA 98155 •
Fax: 206-812-0054 • E-mail: firstname.lastname@example.com


text:
Black Wooden Coat Stand (Black)
£39.95This item is temporarily out of stock at tszuji but we found this:
Scribble coat rack, black
by HeadSprung!
Add to Wishlist
The stunning Scribble Coat Rack is a stylishly modern hanging storage option that is perfect for coats, garments, bags and hats. The attractive calligraphy design rack is made from durable powder coated steel that is shaped to replicate a simple loopy scribble and offers easily accessible hanging storage solutions. The coat rack comes with coloured matched screws for a seamless wall attachment finish.
All deliveries will take under 3 weeks to deliver.
All deliveries will take under 3 weeks to deliver.
Product details
- Category: Coat Hooks
- Size: H14.5 cm x D4.5 cm x L66 cm
- Weight: 0.5 kg
- Material: powder, steel
Good to know
- Delivered by: HeadSprung!
Delivery information
Shipped from United Kingdom
Delivery cost: £5.00
- Delivery time: 2 to 3 weeks
Happiness guarantee
If you're not completely, utterly, shout-it-from-the-rooftops happy with your purchase from mydeco.com you can return it within 10 days for a full refund.*
*Excl. bespoke and made-to-order items.


text:
The Library Collectors' Council is a group of major donors who help direct the growth of the collections through active involvement in the acquisition process.
E.J. Hayward & H. Muzzall, Presbyterian Church, State Street, Santa Barbara, ca. 1876. Stereographic photograph. The Huntington Library, Art Collections, and Botanical Gardens.
Opening page of Elizabethan manuscript copy of the "First Calais Roll of Arms," a list of the English peers and knights bannerette, with details of their military retinues, who were present at the victorious Siege of Calais in 1347. Illuminated manuscript of 35 paper leaves with 116 heraldic coats of arms, skillfully tricked. England, ca. 1590s.


text:
Over 18,908 ideas submitted. 740,946+ votes. 97,858+ comments. 531+ ideas implemented.
Comments Page (1 of 5)
Hi AllI purchased a DELL Inspiron 1510 Laptop in year 2010. I was bit apprehensive of choosing DELL at the first instance as there were many brands available and i was unaware of Service quality of DELL.The Laptop i purchased got damaged within a week as the screen was damaged while handling, i broke down with fear that i lost all my money and talked to customer care person, fortunately i took 3 years complete accidental cover for my laptop. To my amaze, the laptop screen was replaced within a week, and it was my first good experience with DELL. Had it been other supplier must have either denied or deferred stating that this things are not covered, or you have to pay this or so. Last 3 years of experience has changed my view of DELL, now i am deadly fan of DELL equipments.I feel myself lucky that i purchased DELL laptop. Hope to get service from DELL in ensuing years as well as i got in past yearsRegards
Categories: Dell Community, Desktops and Laptops, Service and Support,
as we know that when searching for an information in google it provides a lots of links to look in actually a few websites provide correct information near 80% websites do not contain the right information about,my idea is to provide an information meter for each website that it contains that much % of matter,by this we can save time. actually lot of people dont know which websites provide much information to their needs.
Categories: Dell Community, Dell Web Site, Service and Support,
should Dell IdeastromCommunity install Mail box function? So the community members can also communicate with each other.
Categories: Dell Community, IdeaStorm,
I think your community site can have a Disqus or livefyre installed to make it easier for users to integrate their social profile and comment rather than having to create a new account altogether.
Categories: Dell Community, Service and Support,
please bring back the zino. great comps to appleTV but less expensive.
Categories: Advertising and Marketing, Dell Community, Retail,
Categories: Dell Community, Desktops and Laptops, Education,
For ideas that are "old" or not popular with the community, automatically archive them after a specific period of time. For example if it were know that ideas that receive no votes or comments in a 90-day time window that these ideas would be automatically archived, two things would happen. First, the clutter automatically cleared out of the way so that one could focus on fresh ideas. Second, there would be a built in promotion component. Whomever was the original poster would be incented to continually recruit new participants in that specific idea or even recruit new community members. Naturally if you did this, you would need put a timer on ideas that are getting within the 2-3 week range so that the author could get back out there and start promoting. And any given post or comment would reset the 90-day timer.
Categories: Dell Community,
I like the concept of the Storm Session / IdeaJam, however this part of the site seems to have been dead for a while. I seems that it would benefit Dell, in terms of getting people to "focus" their creative energy on a set of defined constraints as opposed to just opening up to virtually any idea at once. There also is a definite problem when it comes to promoting the fact that a Storm Session in progress or about to start. I cam about this one quite by chance. You have my email address, drop me a note a few days before a Session starts and I bet you will get more participation. Thanks for listening. Status update: This idea has been changed to Partially Implemented. We have several storm sessions set up for the near future and are working to improve the promoting of them via social media and Dell Community sites rather than email. Thanks to robgtx for the submission.
Categories: Dell Community,
Here's the quote from Dell regarding this Storm session: "Dell (and specifically, the Social Media and Community Team) would like to hear your ideas on how to take IdeaStorm to the next level, and specifically, how to make IdeaStorm a more engaging and vibrant ideas community. What type of involvement would you like to see from Dell? What features would you like to see on the site? What ideas do you have for updating the idea submission and refinement process?" It's all very simple...start listening to our ideas. This includes the other ideas from this storm session, as well as other, older ideas that Dell has, so far, ignored. This also includes both ideas for improving Dell products and ideas for improving IdeaStorm. Here, by the way, is the link to the main page for this Storm session, where you'll see the other Storm Session ideas I talked about (all very good, btw): http://www.ideastorm.com/sessionView?SessionId=a017000000NO3XoAAL There are plenty of ideas that Dell can implement to improve this site (for example, more participation on your part, and of course listening to our ideas), improve Dell in general and improve the company's products (for example, reintroduce 16:10, and offer a no-extra-software option for real). These ideas, of course, are no-brainers and are some of the most important ideas, but there are many other ideas that Dell can put to good use. Anyway, the point in this idea is of course that Dell needs to start listening to our ideas. Most (I'd even say all) of these ideas Dell has not listened to, which is very bad. To take the previously mentioned examples, we have no word from Dell on more implementation or participation, nor has Dell paid attention to the requests to restore 16:10 or pre-install less junk-ware. If Dell were to actually listen to and implement these ideas, I'm sure we'd see significant improvements across the board.
Categories: Dell Community,
Post an "Ideas in Action" update.Make the site "mobile" friendly.Allow your business partners to participate in IdeaStorm.Fix the log in function for IdeaStorm.Bring back the ability to post videos on IdeaStorm.Fix the idea contribution total.Fix the page numbers.Switch to "Webstorm" from SalesForce.Delete the old ideas with negative point totals.Clean up the place.Improve the process for editing our ideas.Follow through on your promises.Add an automatic spell checker to the site.Improve the idea process.Offer Dell employees incentives to participate on IdeaStorm.Focus groups for ideas under consideration.Improve the moderation notifications.Give community member awards.Add a job title under Dell employee user names on the site.Add better information to the user dashboard.Add a rank to all ideas.A new IdeaStorm home page.Improve the speed of the site.Make the idea viewing area bigger.Discount coupons in exchange for user points.Add a personal message function. Add comment page numbers to the top of the comments on an idea.Add a "random" ideas tab.Add a chat function.Update and fix the site's functionality.Status Update: With the recent site update we took past ideas into consideration and used many of the ones listed here.
Categories: Dell Community,


text:
By Ron Gosnell
Editor's note: Ron Gosnell is a retired forester who lives in the Lyons area and who has helped owners manage their forests for over forty years.
With summer coming, many forest landowners will soon be hard at work to make their homes, property, and family safer from wildfire. This usually involves cutting down excess trees and brush. Often the lower quality trees are selected for removal in a "fuel reduction" process. The result is that in many cases, the crooked logs of cut trees look to be worthless. Landowners or contractors end up cutting them into random-length pieces for easier handling, to be manually loaded and then dropped off at a place that accepts this material.
This may be the easiest thing to do depending upon circumstance. However, when there are enough trees of reasonable quality to be thinned, that presents an opportunity to cut wood products. To do so is not that difficult. Wood posts, rails, poles and saw logs must be fairly straight, branchless with flush cuts, and have straight-end cuts to specific
Lately I've been doing a lot of work with wood. Knotty pine to be exact. Hundreds of board feet of it, making baseboard and door and window molding. It takes a lot of busy work to sand and stain and sand and seal all of this wood, but the results are definitely worth the effort.
You have a lot of time for musing when you are doing this type of task. You have to pay attention and keep an eye on what you are doing as you sand each board with one and sometimes two different grits of sandpaper and maybe even a third in between stain and sealer coats. As I was going about this task, I started thinking about what life was like without sandpaper. I couldn't
If your dishwasher is turning out dull, spotty dishes - leaving you frustrated and annoyed - you're not alone. Spotty and cloudy dishes are a common nuisance for many dishwasher owners across America.
In fact, a recent survey from the makers of OxiClean(r) found that people experience spots and cloudy film on their dishes straight out of the dishwasher an average of five times per month, and 70 percent felt annoyed or frustrated because they didn't know the cause.
Login to read more: Are You Seeing Spots...On Your Dishes?
Purchase A Subscription: Are You Seeing Spots...On Your Dishes?
In spite of the recent snows, spring has arrived in Lyons! One clear sign is the return of colorful bluebirds and finches to our town. Unfortunately, these birds are under threat from some nasty neighbors.
House sparrows and starlings are non-native, invasive species that kill and out-compete native birds like the Mountain Bluebird. Please help keep native songbirds coming back to Lyons by
Lyons residents, Elizabeth Lennert and her husband Eric, knew that they wanted to re-model their 1970s-era home, and thought there must be something better than 1970s energy use. As a part of their re-model process, the Lennerts decided to get a home energy assessment from EnergySmart. Based on recommendations from their EnergySmart advisor, they decided to upgrade the insulation in the walls, attic, and in the floor and crawl/space.