Search Results

Search found 15 results on 1 pages for 'kazoom'.

facebook twitter digg google delicious technorati stumbleupon myspace wordpress linkedin gmail igoogle windows live tumblr viadeo yahoo buzz yahoo mail yahoo bookmarks favorites email print

Page 1/1 | 1 

  • Automatic allocation(not Dynamic Allocation) on Windows DHCP server

    - by Kazoom
    DHCP supports three different mechanisms for IP address allocation: Manual allocation: the server's administrator creates a configuration for the server that includes the MAC address and IP address of each DHCP client that will be able to get an address: functionally equivalent to BOOTP though the protocol is incompatible. Automatic allocation: the server's administrator creates a configuration for the server that includes only IP addresses, which it gives out to clients. An IP address, once associated with a MAC address, is permanently associated with it until the server's administrator intervenes. Dynamic allocation: like automatic allocation except that the server will track leases and give IP addresses whose lease has expired to other DHCP clients How can i configure the automatic allocation on Windows 2000 or XP DHCP server? i can think of setting the lease to unlimited period, but i m not sure if the computer shutsdown gracefully it will make the ip address available to other machine.

    Read the article

  • Install driver and copying files before Installation runs

    - by Kazoom
    I have created installation package for my project, but before or after installation is complete i need to install some drivers and copy some files to target machine, before my software can run. Is it possible for me to do all this action in the MSI installer setup project of visual studio 2005. One option i have explored is using autoITscript, is there a better approach than that? i feel able to do the whole thing in visual studio would be an ideal way? any suggestions? Thanks

    Read the article

  • A very weird problem with texbox control in C# .net

    - by Kazoom
    Well i know textbox is a very simple user control, perhaps the first input control ever made. I have been facing a very frustrating problem with this simple control. I programatically add a textbox in my user control. From ui i am able to edit it like a normal textbox. however, i am not able to read the user inputed value in the program. my program all the time sees the old value with which my text box was initialized. i textchange event getting triggered but the value never gets updated. This seemingly looks to be some innocuous bug in the code, but the program is very simple and it does not seem to be having any bug. Any guidelines on this issue?

    Read the article

  • Millions of 3D points: How to find the 10 of them closest to a given point?

    - by Kazoom
    A point in 3-d is defined by (x,y,z). Distance d between any two points (X,Y,Z) and (x,y,z) is d= Sqrt[(X-x)^2 + (Y-y)^2 + (Z-z)^2]. Now there are a million entries in a file, each entry is some point in space, in no specific order. Given any point (a,b,c) find the nearest 10 points to it. How would you store the million points and how would you retrieve those 10 points from that data structure.

    Read the article

  • A very weired problem with texbox control in C# .net

    - by Kazoom
    Well i know textbox is a very simple user control, perhaps the first input control ever made. I have been facing a very frustrating problem with this simple control. I programatically add a textbox in my user control. From ui i am able to edit it like a normal textbox. however, i am not able to read the user inputed value in the program. my program all the time sees the old value with which my text box was initialized. i textchange event getting triggered but the value never gets updated. This seemingly looks to be some innocuous bug in the code, but the program is very simple and it does not seem to be having any bug. Any guidelines on this issue?

    Read the article

  • millions of 3d points how to 10 closest to origin

    - by Kazoom
    A point in 3-d is defined by (x,y,z). Distance d between any two points (X,Y,Z) and (x,y,z) is d= Sqrt[(X-x)^2 + (Y-y)^2 + (Z-z)^2]. Now there are a million entries in a file, each entry is some point in space, in no specific order. Given any point (a,b,c) find the nearest 10 points to it. How would you store the million points and how would you retrieve those 10 points from that data structure.

    Read the article

  • A very weird problem with texbox control in .net

    - by Kazoom
    Well i know textbox is a very simple user control, perhaps the first input control ever made. I have been facing a very frustrating problem with this simple control. I programatically add a textbox in my user control. From ui i am able to edit it like a normal textbox. however, i am not able to read the user inputed value in the program. my program all the time sees the old value with which my text box was initialized. i textchange event getting triggered but the value never gets updated. This seemingly looks to be some innocuous bug in the code, but the program is very simple and it does not seem to be having any bug. Any guidelines on this issue?

    Read the article

  • Minimum cost strongly connected digraph

    - by Kazoom
    I have a digraph which is strongly connected (i.e. there is a path from i to j and j to i for each pair of nodes (i, j) in the graph G). I wish to find a strongly connected graph out of this graph such that the sum of all edges is the least. To put it differently, I need to get rid of edges in such a way that after removing them, the graph will still be strongly connected and of least cost for the sum of edges. I think it's an NP hard problem. I'm looking for an optimal solution, not approximation, for a small set of data like 20 nodes. Edit A more general description: Given a grap G(V,E) find a graph G'(V,E') such that if there exists a path from v1 to v2 in G than there also exists a path between v1 and v2 in G' and sum of each ei in E' is the least possible. so its similar to finding a minimum equivalent graph, only here we want to minimize the sum of edge weights rather than sum of edges. Edit: My approach so far: I thought of solving it using TSP with multiple visits, but it is not correct. My goal here is to cover each city but using a minimum cost path. So, it's more like the cover set problem, I guess, but I'm not exactly sure. I'm required to cover each and every city using paths whose total cost is minimum, so visiting already visited paths multiple times does not add to the cost.

    Read the article

  • 3 page longest path on a website

    - by Kazoom
    i have a log file which maintains source entry for each page.all the pages share the common file. source means from what page did user arrive on the target page. I want to find the most common 3 page path for all the pages on the website. Example log file: source Target 1 2 1 3 2 1 3 2 3 2 2 1 The most common 3 page path here was from 3 to 2 to 1.

    Read the article

  • Trying to establish remote debug with visual studio running inside vmpalyer

    - by Kazoom
    i have this configuration a visual studio running inside virtual machine. the host machine has xp on it and so does the virtual machine. i have to run remote debug on the third machine which is connected to the host machine. i m currently facing this problem i m not able to ping my virtual machine from my host machine, however reverse is possible. how to resolve that? both my machine are on same workgroup (not domain, arent they both same?)

    Read the article

  • Unresponsive UI when using BeginInvoke

    - by Kazoom
    Bckground I have a networked application written in C#. my server program has a UI and several communication threads, that read from tcp sockets and display messages on controller UI. Communication with each client is done through a seprate thread. When i recieve some stream of messages from one client , the thread for that client writes on UI, which is a richtextbox on a Form. I call SetTextHelper(string text) method of the form. which looks like this private delegate void MyTextUpdateHandler(string text); public void SetTextHelper(string text) { BeginInvoke(new MyTextUpdateHandler(SetText), new object[] { text }); } public setText(string text) { richtext.Text= text; } Question - If i use BeginInvoke my UI is entirely unresponsive when i m writing large stream of data to UI - Invoke solves that problem, but i read that for multi threaded environment where many thereads are sharing same resource Invoke can lead to deadlocks I share the common ichtextbox between around 16 threads - What would be a good desing for my situation?

    Read the article

  • non contiguous String object C#.net

    - by Kazoom
    By what i understand String and StringBuilder objects both allocate contiguous memory underneath. My program runs for days buffering several output in a String object. This sometimes cause outofmemoryexception which i think is because of non availability of contiguous memory. my string size can go upto 100MBs and i m concatenating new string frequently this causes new string object being allocated. i can reduce new string object creation by using Stringbuilder but that would not solve my problem entirely Is there an alternative to a contiguous string object?

    Read the article

  • Can I have fixed typed ArrayList in C#, just like C++?

    - by Kazoom
    I have an ArrayList which contains fixed type of objects. However everytime I need to extract an object a particular index, I need to typecast it to my user defined type from object type. Is there a way in C# to declare ArrayList of fixed types just like Java and C++, or is there a work around to avoid the typecasting everytime? Edit: I apologize I forgot mentioning that I require the datastructure to be thread-safe, which List is not. Otherwise I would have just used a normal Array. But I want to save myself from the effort of explicitly locking and unlocking while writing the array. So I thought of using ArrayList, synchronize it, but it requires typecasting every time.

    Read the article

facebook twitter digg google delicious technorati stumbleupon myspace wordpress linkedin gmail igoogle windows live tumblr viadeo yahoo buzz yahoo mail yahoo bookmarks favorites email print

1