Search Results

Search found 6357 results on 255 pages for 'facebook graph'.

Page 129/255 | < Previous Page | 125 126 127 128 129 130 131 132 133 134 135 136  | Next Page >

• How to keep historic details of modification in a database (Audit trail)?

  - by mada

  I'm a J2EE developer & we are using hibernate mapping with a PostgreSQL database. We have to keep track of any changes occurs in the database, in others words all previous & current values of any field should be saved. Each field can be any type (bytea, int, char...) With a simple table it is easy but we a graph of objects things are more difficult. So we have, speaking in a UML point of view, a graph of objects to store in the database with every changes & the user. Any idea or pattern how to do that?

  Read the article

• Generating Running Sum of Ratings in SQL

  - by Koobz

  I have a rating table. It boils down to: rating_value created +2 april 3rd -5 april 20th So, every time someone gets rated, I track that rating event in the database. I want to generate a rating history/time graph where the rating is the sum of all ratings up to that point in time on a graph. I.E. A person's rating on April 5th might be select sum(rating_value) from ratings where created <= april 5th The only problem with this approach is I have to run this day by day across the interval I'm interested in. Is there some trick to generating a running total using this sort of data? Otherwise, I'm thinking the best approach is to create a denormalized "rating history" table alongside the individual ratings.

  Read the article

• Python: Is there a possiblity to show wlan-antenna-signals?

  - by kame

  Is there a possiblity to show or graph wlan-antenna-signals on a windows-platform?

  Read the article

• Functional languages & support for memoization

  - by Joel

  Do any of the current crop of popular functional languages have good support for memoization & if I was to pick one on the strength of its memoisation which would you recommend & why? Update: I'm looking to optimise a directed graph (where nodes could be functions or data). When a node in the graph is updated I would like the values of other nodes to be recalculated only if they depend the node that changed. Update2: require free or open-source language/runtime.

  Read the article

• Optimizing Vector elements swaps using CUDA

  - by Orion Nebula

  Hi all, Since I am new to cuda .. I need your kind help I have this long vector, for each group of 24 elements, I need to do the following: for the first 12 elements, the even numbered elements are multiplied by -1, for the second 12 elements, the odd numbered elements are multiplied by -1 then the following swap takes place: Graph: because I don't yet have enough points, I couldn't post the image so here it is: http://www.freeimagehosting.net/image.php?e4b88fb666.png I have written this piece of code, and wonder if you could help me further optimize it to solve for divergence or bank conflicts .. //subvector is a multiple of 24, Mds and Nds are shared memory _shared_ double Mds[subVector]; _shared_ double Nds[subVector]; int tx = threadIdx.x; int tx_mod = tx ^ 0x0001; int basex = __umul24(blockDim.x, blockIdx.x); Mds[tx] = M.elements[basex + tx]; __syncthreads(); // flip the signs if (tx < (tx/24)*24 + 12) { //if < 12 and even if ((tx & 0x0001)==0) Mds[tx] = -Mds[tx]; } else if (tx < (tx/24)*24 + 24) { //if >12 and < 24 and odd if ((tx & 0x0001)==1) Mds[tx] = -Mds[tx]; } __syncthreads(); if (tx < (tx/24)*24 + 6) { //for the first 6 elements .. swap with last six in the 24elements group (see graph) Nds[tx] = Mds[tx_mod + 18]; Mds [tx_mod + 18] = Mds [tx]; Mds[tx] = Nds[tx]; } else if (tx < (tx/24)*24 + 12) { // for the second 6 elements .. swp with next adjacent group (see graph) Nds[tx] = Mds[tx_mod + 6]; Mds [tx_mod + 6] = Mds [tx]; Mds[tx] = Nds[tx]; } __syncthreads(); Thanks in advance ..

  Read the article

• Scale GraphicsPaths

  - by serhio

  In a form I draw a graph. This graph has some distinct paths that should have differently drawn. Say AxesPath, SalesPath, CostsPath etc... When I resize the form need I to scale every of components Paths? Take an example: Imports System.Drawing.Drawing2D Public Class Form1 Dim lineOne As GraphicsPath Dim lineTwo As GraphicsPath Dim allPaths As GraphicsPath Dim initSize As Size Public Sub New() ' This call is required by the designer. ' InitializeComponent() initSize = Me.Size lineOne = New GraphicsPath() lineTwo = New GraphicsPath() lineOne.AddLine(20.0F, 20.0F, Me.initSize.Width - 20.0F, 20.0F) lineTwo.AddLine(0.1F, 10.0F, Me.initSize.Width - 20.0F, _ Me.initSize.Height - 0.5F) allPaths = New GraphicsPath() allPaths.AddPath(lineOne, False) allPaths.AddPath(lineTwo, False) Me.ResizeRedraw = True End Sub Protected Overrides Sub OnResize(ByVal e As System.EventArgs) MyBase.OnResize(e) Dim m As New Matrix m.Scale(Me.Width / initSize.Width, Me.Height / initSize.Height) allPaths.Transform(m) initSize = Me.Size End Sub Protected Overrides Sub OnPaint(ByVal e As PaintEventArgs) MyBase.OnPaint(e) ' WORKS ' ' e.Graphics.DrawPath(Pens.GreenYellow, allPaths) ' ' DOES NOT WORK! ' e.Graphics.DrawPath(Pens.DarkGoldenrod, lineOne) e.Graphics.DrawPath(Pens.DarkMagenta, lineTwo) End Sub End Class

  Read the article

• Block site on a PC logged into a domain and using a proxy

  - by Rauf

  I read lot of posts related with blocking sites. Most of the posts says to edit hosts file. I know it is a good method. But this one is not working for me. Can you guess what is the issue by analyzing the following details, My PC is joined to a domain and using proxy settings, and the logged in user having administrator privileges. After reading some answers, I did the following Changed the hosts file to have # 38.25.63.10 x.acme.com # x client host 127.0.0.1 localhost 127.0.0.1 www.facebook.com Added no proxy for facebook, Still, it is not working. Why ?

  Read the article

• How to create file of files?

  - by TheMachineCharmer

  class Node { FooType Data; // I can save Data to file with extension .foo void Save() { // save Data to .foo file } } Now , class Graph { List<Node> Nodes; void Save() { foreach(Node node in Nodes) { node.Save(); } } } Now when I invoke someGraph.Save(); then it creates Nodes.Count number of files. I would like to appear those files as one file with extension somename.graph and be able to read it again as Nodes. How can I do this? Is there a way to bundle files into a single different file?

  Read the article

• XMLEncoder and PersistenceDelegate

  - by Johannes Rössel

  I'm trying to use XMLEncoder to write an object graph (tree in my case) to a file. However, one class contained in it is not actually a Java bean and I don't particularly like making its guts publicly accessible. It's accessed more like a list and has appropriate add methods. I've already written a custom PersistenceDelegate to deal with that. However, is there any way for XMLEncoder to pick it up on its own or do I really need to add it whenever I use an encoder to write a graph that may contain said class?

  Read the article

• Breadth first search all paths

  - by Amndeep7

  First of all, thank you for looking at this question. For a school assignment we're supposed to create a BFS algorithm and use it to do various things. One of these things is that we're supposed to find all of the paths between the root and the goal nodes of a graph. I have no idea how to do this as I can't find a way to keep track of all of the alternate routes without also including copies/cycles. Here is my BFS code: def makePath(predecessors, last): return makePath(predecessors, predecessors[last]) + [last] if last else [] def BFS1b(node, goal): Q = [node] predecessor = {node:None} while Q: current = Q.pop(0) if current[0] == goal: return makePath(predecessor, goal) for subnode in graph[current[0]][2:]: if subnode[0] not in predecessor: predecessor[subnode[0]] = current[0] Q.append(subnode[0]) A conceptual push in the right direction would be greatly appreciated. tl;dr How do I use BFS to find all of the paths between two nodes?

  Read the article

• a small question on GNUPlot

  - by Robert

  Dear Guys, I have used the following statement to get the GNUPlot plot a grah for me: plot "force.dat" using 1:2 title "Detroit" with lines, \ "force.dat" u 1:3 t "US Avergae" w linepoints and the "force.dat" looks like 2005 0 0 2006 104 51 2007 202 101 It draws nice graph for me.However,I don't like the X-axis,because it is labelled as 2005,2005.5,2006,2006.5,2007..etc. However,those are year identifiers,I only want the 2005,2006,2007 etc,how could I get rid of the 2005.5,2006.5 etc labels in my GNUPlot graph? Thank you very much for your ideas.

  Read the article

• how can we pass the variable into the function via url?

  - by subodh

  I have designed a asp.net page which create graphs. I have written a class file (which contain a function to render the graph,a function for entering data named insertdata(string[] s,double[] d)) in App_code folder. I pass the value into the insertdata during page load_event. I saw a feature of googlechart.when you pass the value in url address bar it will create a graph according to that passed value. how can i pass the value into the insertdata() function through url address? can anybody help me?

  Read the article

• Ping Flooding in router log

  - by Freeman

  I've had recently a period of repeated disconnections from my router with connection problems. I checked my router log I found several Ping Flooding entries all originating from the IP 69.171.227.232 which turned out to be one of Facebook IPs! I'm wondering what does that means? Can Facebook chat cause such a condition? My router is DLink dir 600 and the condition that devices were disconnected from router, not router from internet.. Connection is WAN And how to solve this router problem?? My wifi clients were about 3-5 at that time..

  Read the article

• How to know if it's phishing or not in android apps?

  - by Zakaria Dza

  In IM apps (not only), there is a browser frame that appears and prompts for example to connect to facebook account, ebuddy for example (can't post pictures :( ) http://nsa34.casimages.com/img/2013/06/26//130626121230193046.jpg My question is: how can I know if this frame is from facebook.com and not a phishing website. I know that the apps in the play store are legit (mostly at least), but how can we trust apps that we install from outside the store? Or is there any way to check the credentials form action? Thanks for your answers and sorry for my bad english. (And sorry for the picture, couldn't make a screenshot ;-) )

  Read the article

• Merging branches in tortoiseHg does not seem to work

  - by Spock

  In a project, I have a default branch and another named branch. After a merging both branches and committing it, the graph in TortoiseHg shows that both branches have been merged. However, pushing to a remote repository (which is at the stage before branching, it only has the default branch), I get the message "abort: push creates new remote branches". If I'm not mistaken, I'm left with one branch after merging, so why this error message? Note: the graph still shows that I have 2 heads, is it in anyway related to this?

  Read the article

• "Winamp style" spectrum analyzer

  - by cvb

  I have a program that plots the spectrum analysis (Amp/Freq) of a signal, which is preety much the DFT converted to polar. However, this is not exactly the sort of graph that, say, winamp (right at the top-left corner), or effectively any other audio software plots. I am not really sure what is this sort of graph called (if it has a distinct name at all), so I am not sure what to look for. I am preety positive about the frequency axis being base two exponential, the amplitude axis puzzles me though. Any pointers?

  Read the article

• Removing items from lists and all references to them.

  - by LiamV

  I'm facing a situation where I have dependent objects and I would like to be able to remove an object and all references to it. Say I have an object structure like the code below, with a Branch type which references two Nodes. public class Node { // Has Some Data! } public class Branch { // Contains references to Nodes public Node NodeA public Node NodeB } public class Graph { public List<Node> Nodes; public List<Branch> Branches; } If I remove a Node from the Nodes list in the Graph class, it is still possible that one or more Branch objects still contains a reference to the removed Node, thus retaining it in memory, whereas really what I would quite like would be to set any references to the removed Node to null and let the garbage collection kick in. Other than enumerating through each Branch and checking each Node reference sequentially, are there any smart ideas on how I remove references to the Node in each Branch instance AND indeed any other class which reference the removed Node?

  Read the article

• Mercurial Branching Model for task features

  - by Stan

  My development env: Windows 7, TortoiseHg, ASP.NET 4.0/MVC3 Test branch: code on test server Prod branch: code on production server This is my current branching model. The reason to branch out every task (feature) is because some features go to live slower. So in above graph, task 1 finished earlier (changeset #5), and merge into test branch for testing. However, due to bug or modification of original request, changesets #10, #12 have been made. While task 2 has finished testing #8 and pushed to live #9 already. My problem is every time when modifying task branch (like #10, #12), I have to do another merge to test branch (#11, #13), this makes the graph very messy. Is there any way to solve this issue? Or any better branching model?

  Read the article

• Fusion charts free on Ruby on Rails

  - by Kiran

  Hi i am using Fusion charts free with Rail 2.3.5 I tried to simulate the single_array example provided in the documentation but instead of graph it is showing me the following message The method used is setDataXML.The XML is #Creates xml with values for sales data of products #along with their names. #The values required for building the xml is obtained as parameter arr_data #It expects an array in which each element is #itself an array with first element as label and second element as value xml = Builder::XmlMarkup.new xml.graph(:caption='Sales by Product', :numberPrefix='$', :formatNumberScale='0',:decimalPrecision='0') do for item in arr_data xml.set(:name=item[0], :value=item[1],:color=''+get_FC_color) end end Anybody seen this message before ? i am using Firefox with flash player 9

  Read the article

• pointer delegate in STL set.

  - by ananth

  hi. Im kinda stuck with using a set with a pointer delegate. my code is as follows: void Graph::addNodes (NodeSet& nodes) { for (NodeSet::iterator pos = nodes.begin(); pos != nodes.end(); ++pos) { addNode(*pos); } } Here NodeSet is defined as: typedef std::set NodeSet; The above piece of code works perfectly on my windows machine, but when i run the same piece of code on a MAC, it gives me the following error: no matching function for call to 'Graph::addNode(const boost::shared_ptr&)' FYI, Node_ptr is of type: typedef boost::shared_ptr Node_ptr; can somebody plz tell me why this is happening?

  Read the article

• How to change the range of a chart in Excel using VBA?

  - by Pieter

  Hi guys, I'm using an Excel sheet to keep track of a particular time series (my daily weight, if you must know). I created a macro that inserts a row, automatically adds today's date and calculates a moving average based on my input. There is also a chart to visualize my progress. I have tried recording a macro that updates the time series in the graph, but to no success. How can I create a macro or VBA script that, when executed, updates the range of the graph from A(x):Cy to A(x-1):Cy to include today's measurement? Thanks!

  Read the article

• How to convert a url to a browser like url? ( ...%20... )

  - by Kaoukkos

  I want to get data using CURL but I have a problem. When I set the url like this $url = "https://graph.facebook.com/fql?q=SELECT name FROM page"; // continues I do not have anything returned. When I copy the browser url, this is $url = "https://graph.facebook.com/fql?q=SELECT%20name%20FROM%20page"; I get the results through CURL. I tried htmlentities and htmlspecialchars without luck. What am I missing here? $ch = curl_init($url); curl_setopt($ch,CURLOPT_RETURNTRANSFER,1); $content = curl_exec($ch);

  Read the article

• How to get id vertex from name vertex in R and Igraph?

  - by user1310873

  I have a graph with names from 1 to 10 library(igraph) library(Cairo) g<- graph(c(0,1,0,4,0,9,1,7,1,9,2,9,2,3,2,5,3,6,3,9,4,5,4,8,5,8,6,7,6,8,7,8),n=10,dir=FALSE) V(g)$name<-c(1:10) V(g)$label<-V(g)$name coords <- c(0,0,13.0000,0,5.9982,5.9991,7.9973,7.0009,-1.0008,11.9999,0.9993,11.0002,7.9989,13.0009,10.9989,14.0009,5.9989,14.0009,7.0000,4.0000) coords <- matrix(coords, 10,2,byrow=T) plot(g,layout=coords) listMn<-neighborhood(g,1,0:9) I'd like to do this but in opposite way m1<-V(g)[listMn[[7]]]$name the above instructions gets, 7 4 8 9 how to get listMn[[7]]=6 3 7 8 from names 7 4 8 9?

  Read the article

• Interpolation on Cubism graphs

  - by Abe Stanway

  Cubism was designed, by mbostock's own words, for maximum information density - which means it generally wants to display one datapoint per pixel. While this is useful in many cases, it doesn't help when your data itself is not that dense. In these cases, you get ugly, staccato-style graphs like so: Is there a way to interpolate my data/graph within Cubism to show a nice, smoothed graph? EDIT: After adding keepLastValue to the metric, I get this: Here is the same data as shown in Graphite: I would like to smooth the Cubism view to look more like Graphite (with the added awesomeness of the horizon overplotting)

  Read the article

• Prevent runaway threads and ultimately physical overheating and battery drain on Android [migrated]

  - by foampile

  I was wondering if there is a system monitor app that will raise (audible) alerts and offer app closure if it detects runaway threads on Android that cause physical overheating and battery drain. E.g., I just had to turn my phone off because there was a runaway thread that I think was constantly trying to refresh FB where there was very poor connection, so it was going in a virtually endless loop. But I get that with other apps too and not just Facebook. I'd like to actually shut apps down when they're detected. I am not kidding, I nearly burned my fingertips when I touched my phone -- it was on for only 2 hrs and the battery was almost dead. It is because 4G is very poor inside my office building and I checked Facebook walking between my vehicle and the building this AM. After that, the app kept trying to refresh continuously without success and overheating the phone.

  Read the article

< Previous Page | 125 126 127 128 129 130 131 132 133 134 135 136  | Next Page >