Search Results

Search found 25974 results on 1039 pages for 'source routing'.

Page 153/1039 | < Previous Page | 149 150 151 152 153 154 155 156 157 158 159 160  | Next Page >

  • Code Colorer Being Used

    - by Sarfraz
    Hello, I visited this site and i really liked the code colorer used by it (apart from that CSS3 article on speech bubbles). I went through the source code of that page but could not find which syntax highlighter is being used there. Does any one have an idea?

    Read the article

  • Beginner question about merging in git

    - by wxyz
    I'm 15 and have just started using source control systems to manage my code a little better, so I'm a little new to this stuff. Right now I have this repository: [a]---[b]---[d]---[f] master \ \ [c]---[e] develop I want to wind up here: [a]---[b]---[d]---[f]---[g] master \ / \ / [c]---[e]---/ develop where g is equivalent to performing commits [c] and [e] on [f]. This is git checkout master; git merge develop, right?

    Read the article

  • opensourcing a website code

    - by pygabriel
    Hi! I'm writing a little website (webapp) in php+codeigniter, I'd really like to make it open source (to attract collaborators and to have a free VCS hosting). Is that a good practice? This mine security? Which are the best tools to change important data before uploading? (like config files with db names and passwords used for testing etc..)

    Read the article

  • Good tool to convert sourcecode to PDF?

    - by Toad
    I've a daunting task of getting familiair and possibly re-architecting large pieces of old source code. I was hoping there would be a nice tool to convert php (in my case), but let's make it more general: any language to PDF, for offline browsing on a Kindle or Ipad Would be ideal if it would create indexes / hyperlinks automatically. So function calls can be easily browsed into

    Read the article

  • Why do most web hosting services support only php as server-side language?

    - by HJ-INCPP
    Hello, I have been working with java and python, so I found a nice web host which has support for these. But my question is, why can you find so hard such hosts? I understand that php is easy, I also understand that oracle host is hard to find ($$$ of course), but what do they have against some good open-source, completely free java spring, jsp, django, python, ror, perl etc etc .... So rare to find hosts ... not to mention freelancer bids Thank you.

    Read the article

  • Any password protected info sharing tool....

    - by siva
    I'm looking for a password-protected information sharing tool that has the following constraints: Two or more users can upload their ideas and discuss on that idea (like a blog) The discussed things will be shown in a tree kind of structure Should be password protected. Ideally open source and web-based

    Read the article

  • Consideration to create a UI for CrouseControl.net

    - by Nasser Hajloo
    As CrouseControl.net is an open source software and it is a good CI tool, I'm going to create a UI which make configuration easier than tricking XML. So What are the considerations and necessities. I also need to know about any documentation which may help me to implement UI. like a XML tag refrences or something else. any help will appriciated.

    Read the article

  • Are there any free tools for building AIR applications?

    - by rspeed
    There is an ongoing argument on the web right now about the "openness" of the iPhone OS and Adobe Flash platforms. Adobe's argument is that anyone can build a Flash application without having to worry about being allowed to distribute it. This made me wonder… is it possible to build and distribute an AIR application without giving any money to Adobe (without violating any licenses, of course)? Are any of these tools free? Are any open-source?

    Read the article

  • OpenGL code to render ribbon diagrams for protein

    - by eipxen
    Hey all, I am looking to render ribbon diagrams of proteins using OpenGL and C++. Does anyone know if any open source code for this already exists, or if there are good guides to do this? If not, I'd prefer to figure it out myself ;) but I didn't want to reinvent the wheel, especially if the wheel was free.

    Read the article

  • Breaking out of the Google App Engine Python lock-in?

    - by Alterlife
    Are there any guidelines to writing Google App Engine Python code that would work without Google's infrastructure on other platforms? Is there any known attempt to create an open source framework which can run applications designed for Google App Engine on other platforms? Edit: To clarify, the question really is: If I develop an application on Google App Engine now, will I be able to migrate to another platform later, or is it a lock in?

    Read the article

  • Rich text box with spell checker

    - by user329755
    Hi, I have a very unique requirement for a rich text box with spell check and auto text. The spell check will not happen on any other site thus i need to have the dictionary and the spell check logic in my site only. It should be open source as i will then add auto text feature to that text box. Any help will be appreciated. Thanks.

    Read the article

  • How to compile a C++ source code written for Linux/Unix on Windows Vista (code given)

    - by HTMZ
    I have a c++ source code that was written in linux/unix environment by some other author. It gives me errors when i compile it in windows vista environment. I am using Bloodshed Dev C++ v 4.9. please help. #include <iostream.h> #include <map> #include <vector> #include <string> #include <string.h> #include <strstream> #include <unistd.h> #include <stdlib.h> using namespace std; template <class T> class PrefixSpan { private: vector < vector <T> > transaction; vector < pair <T, unsigned int> > pattern; unsigned int minsup; unsigned int minpat; unsigned int maxpat; bool all; bool where; string delimiter; bool verbose; ostream *os; void report (vector <pair <unsigned int, int> > &projected) { if (minpat > pattern.size()) return; // print where & pattern if (where) { *os << "<pattern>" << endl; // what: if (all) { *os << "<freq>" << pattern[pattern.size()-1].second << "</freq>" << endl; *os << "<what>"; for (unsigned int i = 0; i < pattern.size(); i++) *os << (i ? " " : "") << pattern[i].first; } else { *os << "<what>"; for (unsigned int i = 0; i < pattern.size(); i++) *os << (i ? " " : "") << pattern[i].first << delimiter << pattern[i].second; } *os << "</what>" << endl; // where *os << "<where>"; for (unsigned int i = 0; i < projected.size(); i++) *os << (i ? " " : "") << projected[i].first; *os << "</where>" << endl; *os << "</pattern>" << endl; } else { // print found pattern only if (all) { *os << pattern[pattern.size()-1].second; for (unsigned int i = 0; i < pattern.size(); i++) *os << " " << pattern[i].first; } else { for (unsigned int i = 0; i < pattern.size(); i++) *os << (i ? " " : "") << pattern[i].first << delimiter << pattern[i].second; } *os << endl; } } void project (vector <pair <unsigned int, int> > &projected) { if (all) report(projected); map <T, vector <pair <unsigned int, int> > > counter; for (unsigned int i = 0; i < projected.size(); i++) { int pos = projected[i].second; unsigned int id = projected[i].first; unsigned int size = transaction[id].size(); map <T, int> tmp; for (unsigned int j = pos + 1; j < size; j++) { T item = transaction[id][j]; if (tmp.find (item) == tmp.end()) tmp[item] = j ; } for (map <T, int>::iterator k = tmp.begin(); k != tmp.end(); ++k) counter[k->first].push_back (make_pair <unsigned int, int> (id, k->second)); } for (map <T, vector <pair <unsigned int, int> > >::iterator l = counter.begin (); l != counter.end (); ) { if (l->second.size() < minsup) { map <T, vector <pair <unsigned int, int> > >::iterator tmp = l; tmp = l; ++tmp; counter.erase (l); l = tmp; } else { ++l; } } if (! all && counter.size () == 0) { report (projected); return; } for (map <T, vector <pair <unsigned int, int> > >::iterator l = counter.begin (); l != counter.end(); ++l) { if (pattern.size () < maxpat) { pattern.push_back (make_pair <T, unsigned int> (l->first, l->second.size())); project (l->second); pattern.erase (pattern.end()); } } } public: PrefixSpan (unsigned int _minsup = 1, unsigned int _minpat = 1, unsigned int _maxpat = 0xffffffff, bool _all = false, bool _where = false, string _delimiter = "/", bool _verbose = false): minsup(_minsup), minpat (_minpat), maxpat (_maxpat), all(_all), where(_where), delimiter (_delimiter), verbose (_verbose) {}; ~PrefixSpan () {}; istream& read (istream &is) { string line; vector <T> tmp; T item; while (getline (is, line)) { tmp.clear (); istrstream istrs ((char *)line.c_str()); while (istrs >> item) tmp.push_back (item); transaction.push_back (tmp); } return is; } ostream& run (ostream &_os) { os = &_os; if (verbose) *os << transaction.size() << endl; vector <pair <unsigned int, int> > root; for (unsigned int i = 0; i < transaction.size(); i++) root.push_back (make_pair (i, -1)); project (root); return *os; } void clear () { transaction.clear (); pattern.clear (); } }; int main (int argc, char **argv) { extern char *optarg; unsigned int minsup = 1; unsigned int minpat = 1; unsigned int maxpat = 0xffffffff; bool all = false; bool where = false; string delimiter = "/"; bool verbose = false; string type = "string"; int opt; while ((opt = getopt(argc, argv, "awvt:M:m:L:d:")) != -1) { switch(opt) { case 'a': all = true; break; case 'w': where = true; break; case 'v': verbose = true; break; case 'm': minsup = atoi (optarg); break; case 'M': minpat = atoi (optarg); break; case 'L': maxpat = atoi (optarg); break; case 't': type = string (optarg); break; case 'd': delimiter = string (optarg); break; default: cout << "Usage: " << argv[0] << " [-m minsup] [-M minpat] [-L maxpat] [-a] [-w] [-v] [-t type] [-d delimiter] < data .." << endl; return -1; } } if (type == "int") { PrefixSpan<unsigned int> prefixspan (minsup, minpat, maxpat, all, where, delimiter, verbose); prefixspan.read (cin); prefixspan.run (cout); }else if (type == "short") { PrefixSpan<unsigned short> prefixspan (minsup, minpat, maxpat, all, where, delimiter, verbose); prefixspan.read (cin); prefixspan.run (cout); } else if (type == "char") { PrefixSpan<unsigned char> prefixspan (minsup, minpat, maxpat, all, where, delimiter, verbose); prefixspan.read (cin); prefixspan.run (cout); } else if (type == "string") { PrefixSpan<string> prefixspan (minsup, minpat, maxpat, all, where, delimiter, verbose); prefixspan.read (cin); prefixspan.run (cout); } else { cerr << "Unknown Item Type: " << type << " : choose from [string|int|short|char]" << endl; return -1; } return 0; }

    Read the article

  • Software Engineering undergraduate project ideas

    - by Nasser Hajloo
    There was a similar post at << Computer science undergraduate project ideas << Ideas for Software Engineering Thesis Project << Senior computer engineering project ideas ? << Final Year Project(Software Engineering) Idea So I read all of them and my answer wasn't fit to those. Actually I'm looking for some ideas which 1 - Help me extend a functionality of Open source software (like creating a usefull add-in 2 - Let me Create a Scientific Paper (ideas to publish a scientific paper) 3 - Or Create a Unique an usefull application from the scratch , (like performance tool, profiler, analyzers and other similar tools) I know C# - Asp.net and sql So with all these conditions what do you think is better to do? let me know your ideas whatever those are. any idea appriciated.

    Read the article

  • Is git / tortoisegit ready to replace snv / tortoisesvn on windows?

    - by opensas
    I've been using svn thru tortoise and svn:// protocol on windows for a couple of years and I'm pretty comfortable with it. Nevertheless tThere are a couple of features I'd like to hove, mainly shelves (something like local commits) and easier branch / merge support. From my experience, svn / tortoise on windows is rock solid stuff. I was wondering if git / tortoisegit has achieved the level of maturity and stability so as to be a replacement for svn on windows. Any experience about it? saludos sas some links: a similar question, only a bit outdated http://stackoverflow.com/questions/1500400/is-tortoisegit-ready-for-prime-time-yet http://stackoverflow.com/questions/931105/tortoisegit-tortoisebzr-tortoisehg-are-any-solid-enough-to-switch-from-tortois (well, it seems like mercurial could be an option) http://code.google.com/p/tortoisegit/ http://www.syntevo.com/smartgit/index.html (free of charge for non-commercial use or to active members of the Open Source community)

    Read the article

  • Problem building dotnetnuke blog module

    - by GeminiDNK
    I have dnn 5.2 running on my machine, and installed the blog module, the blog module is also reflected in the development environment i have. But i want to find out, how do i actually develope, or build the blog from source, so i can actually output the .dll file, instead of just running it. If i import the Blog project file from the folder, it will give me a host of error like .resx file not found and so on. Does any dotnetnuke expert out there know about this?And have encountered the problem before? If not, how do you actually make the module work so u can make changes to the module. Im talking about core logic change, like adding functions, not just skin or UI changes.

    Read the article

  • Am I right about the differences between Floyd-Warshall, Dijkstra's and Bellman-Ford algorithms?

    - by Programming Noob
    I've been studying the three and I'm stating my inferences from them below. Could someone tell me if I have understood them accurately enough or not? Thank you. Dijkstra's algorithm is used only when you have a single source and you want to know the smallest path from one node to another, but fails in cases like this Floyd-Warshall's algorithm is used when any of all the nodes can be a source, so you want the shortest distance to reach any destination node from any source node. This only fails when there are negative cycles (this is the most important one. I mean, this is the one I'm least sure about:) 3.Bellman-Ford is used like Dijkstra's, when there is only one source. This can handle negative weights and its working is the same as Floyd-Warshall's except for one source, right? If you need to have a look, the corresponding algorithms are (courtesy Wikipedia): Bellman-Ford: procedure BellmanFord(list vertices, list edges, vertex source) // This implementation takes in a graph, represented as lists of vertices // and edges, and modifies the vertices so that their distance and // predecessor attributes store the shortest paths. // Step 1: initialize graph for each vertex v in vertices: if v is source then v.distance := 0 else v.distance := infinity v.predecessor := null // Step 2: relax edges repeatedly for i from 1 to size(vertices)-1: for each edge uv in edges: // uv is the edge from u to v u := uv.source v := uv.destination if u.distance + uv.weight < v.distance: v.distance := u.distance + uv.weight v.predecessor := u // Step 3: check for negative-weight cycles for each edge uv in edges: u := uv.source v := uv.destination if u.distance + uv.weight < v.distance: error "Graph contains a negative-weight cycle" Dijkstra: 1 function Dijkstra(Graph, source): 2 for each vertex v in Graph: // Initializations 3 dist[v] := infinity ; // Unknown distance function from 4 // source to v 5 previous[v] := undefined ; // Previous node in optimal path 6 // from source 7 8 dist[source] := 0 ; // Distance from source to source 9 Q := the set of all nodes in Graph ; // All nodes in the graph are 10 // unoptimized - thus are in Q 11 while Q is not empty: // The main loop 12 u := vertex in Q with smallest distance in dist[] ; // Start node in first case 13 if dist[u] = infinity: 14 break ; // all remaining vertices are 15 // inaccessible from source 16 17 remove u from Q ; 18 for each neighbor v of u: // where v has not yet been 19 removed from Q. 20 alt := dist[u] + dist_between(u, v) ; 21 if alt < dist[v]: // Relax (u,v,a) 22 dist[v] := alt ; 23 previous[v] := u ; 24 decrease-key v in Q; // Reorder v in the Queue 25 return dist; Floyd-Warshall: 1 /* Assume a function edgeCost(i,j) which returns the cost of the edge from i to j 2 (infinity if there is none). 3 Also assume that n is the number of vertices and edgeCost(i,i) = 0 4 */ 5 6 int path[][]; 7 /* A 2-dimensional matrix. At each step in the algorithm, path[i][j] is the shortest path 8 from i to j using intermediate vertices (1..k-1). Each path[i][j] is initialized to 9 edgeCost(i,j). 10 */ 11 12 procedure FloydWarshall () 13 for k := 1 to n 14 for i := 1 to n 15 for j := 1 to n 16 path[i][j] = min ( path[i][j], path[i][k]+path[k][j] );

    Read the article

  • Can someone recommend a bells and whistles CSS framework?

    - by Ali A
    I am looking for a bells and whistles CSS framework. I have found a number online that deal with "grids", and some that deal with "typography" and others that deal with "resetting". What I have not found is something that will give my web applications a consistent reusable style or theme. I guess it would have to have a number of predefined elements that do things, for example: div.boxed {...} And then a number of themes or plugins that provide these in a consistent way. Javascript toolkits like ExtJS, YUI, and also GWT have their own skinability, and I guess this is the featureset that I want, but independent of any Javascript library. (Open source would be best, but we don't mind paying) Edit: 5 good answers, but I have seen all those frameworks, and they are not enough of what I am looking for. Perhaps what I am looking for doesn't exist. Or I haven't explained properly. I will give them a good going over and see.

    Read the article

  • making a new opensource WebOs ?

    - by Ayman
    hello guys, trying to make a new webos for my graduation project, I'm a computer science guy, and this project will be my graduation project. two days ago i sat with ghost OS R&D operation manager and he told me it's a big project and i should not thinking in a project like this. anyway i have an experience, and i can made it using GWT and some programing languages for server side. and am gonna make it as a development environment, OS with specific API that allows any body to write an applications, or some modifications to add a 3rd party apps. i need some feedback and what about making it open-source project, what do you think guys ?

    Read the article

  • private c# project hosting - plugin in visual studio

    - by b0x0rz
    is there a project hosting for c# code and that has a simple to use visual studio plugin? does not need to be free. it does need to be private. should have a plugin or already by usable from within visual studio. something like a hosted team foundation server would be best, however i only found one and for $150 per user per month. a bit much, don't you think :P the problem with searching via google is that there is a lot of free project hostings for open source and can't seem to weed them out :( thnx a lot for any info

    Read the article

  • Address extraction from emails in Java

    - by Hans Klock
    I'm looking for an Java open-source library which is able to extract address information from a (German) email (signature). The library should find name street city, city code/postal code email tel/fax address-parser.com is an commercial product, but an free (albeit simple) library would be great. stackoverflow.com/questions/16413/parse-usable-street-address-city-state-zip-from-a-string is asking for something similar, but my problem is broader because the address information is hidden in a complete email. And there isn't a solution either... Any ideas?

    Read the article

  • Geographical ontologies ready to use?

    - by Mulone
    Hi all, I'm looking for an ontology containing geographical knowledge. In particular I'd like to have these types of information: political states / regions / cities / city areas geographical regions (e.g. continents, name of mountains, lakes, etc) For example, starting from the node "New York" I'd like to be able to find parents like the New York state, the USA etc, and children like Manhattan, Bronx, etc. I couldn't find anything open-source/free to use. I know that a lot of researchers extract such information from Wikipedia, but I couldn't find any off-the-shelf packages to use. I also checked OpenStreetMap, which is great for the amount of data but doesn't seem to contain a proper geographical ontology. Even a web service would be good! Any hints? Mulone

    Read the article

  • Showing Dynamic Content within a Facebook Page

    - by Jay
    Hi all, I need to have some content displayed in a Facebook Page (I believe these are also referred to as Business Pages?). However, some of these content will be dynamic. What I mean by that is, some of the content will be taken from an existing web application. I've looked into using Static FBML (which allows us to have tabs in the profile page with FBML in it). These no longer allow iframes. Does work in this instance (as I've not been able to get it to work either). Are there any other tags which can be used for this purpose? In short, is there a way to obtain data from an external source and display those content within a Facebook Page (Tab)? Thank you very much in advance for any light that you can shed on this issue. Cheers~

    Read the article

  • SAML Authentication Portal

    - by Alvin Jones
    I'd like to develop a portal similar to what a company like OneLogin (http://www.onelogin.com/) has: The user would login with their login credentials then have links to the web resources that their account is associated with. When they see their resources all they need to do is click on them and they'll be automatically login in (SAML authentication). Are there any open source projects out there that have started on this effort? It would be great if there was something that we could use as a base to build on top of with a friendly license (e.g. MIT). Thanks

    Read the article

< Previous Page | 149 150 151 152 153 154 155 156 157 158 159 160  | Next Page >