Search Results

Search found 10417 results on 417 pages for 'large'.

Page 165/417 | < Previous Page | 161 162 163 164 165 166 167 168 169 170 171 172  | Next Page >

• Passing a Dictionary to WCF service

  - by Sandeep

  I need to pass a Dictionary (with max 20,000 entries) to a WCF service. Can I pass it all by once? void SubmitDictionary(Dictionary<string, MyEntry> val); where MyEntry is : class MyEntry { string Name; long Age; } Is there a configuration for size of the value passed? or can we pass as large data as this?

  Read the article

• System call time out?

  - by Arnold

  Hi, I'm using unix system() calls to gunzip and gzip files. With very large files sometimes (i.e. on the cluster compute node) these get aborted, while other times (i.e. on the login nodes) they go through. Is there some soft limit on the time a system call may take? What else could it be?

  Read the article

• Uploading Document in Chunks on SharePoint using Web Services with some MetaData

  - by Pari

  I want to Upload large file on Sharepoint.So i am uploading it in chunks. But i am unable to give meta information at the time of Uploading file. Is there any solution?

  Read the article

• A lightweight application framework for PHP?

  - by millenomi

  I have long been a fan of _why's Camping microframework -- lightweight, great for microscopic applications (low concurrency, easy to use and edit and maintain), which is what I do. I'd love to know if there's something similar for PHP; full-blown app frameworks like CakePHP or Symphony are very large for what I do, but I can't seem to find nothing "less". What PHP framework would you prefer, in this situation?

  Read the article

• Android Load Camera image as Bitmap

  - by GuyNoir

  I am using BitmapFactory.decodeFile to load Bitmaps of images into my application. However, the function returns null on large images (such as those from the camera). The filepath is definitely correct, I just can't figure out why it would return null. I tried supersampling, but it didn't seem to help. Does anyone have any idea why it would do this or how I could more easily load images taken from the camera into a Bitmap? Thanks.

  Read the article

• MySQL Optimization 20 gig table

  - by user169743

  I have a 20 gig table that has a large amount of inserts and updates daily. This table is also frequently searched. I'd like to know if the MySQL indices can become fragmented and perhaps need to be rebuilt or something similar. I'm finding it difficult to figure out which of the CHECK TABLE, REPAIR TABLE or something similar? Any guidance appreciated, I'm a db newb.

  Read the article

• Categorize the approximate shape of an array of Points in 3D Space

  - by user1295133

  I have a set of points in 3d space and I want to be able to categorize the shape that best fits them - cube, sphere, cylinder, planar (flat) etc. I've looked at supervised/machine learning but since I need first generate a large training data set that's not really suitable. My dream solution would be a java library with a wonderful magical function something like : public enum ShapeType { CUBE, SPHERE, CYLINDER, PLANAR } public ShapeType CategorizeShapeFromPoints( 3DPoint[] points ) However, any and all help will be appreciated. Thanks

  Read the article

• Find image position inside a larger image

  - by Matthew

  Basically I want to find the pixel location of a small image inside a large image. I have searched for something similar to this but have had no luck.

  Read the article

• List goals/targets in GNU make

  - by BitShifter

  I have a fairly large makefile that creates a number of targets on the fly by computing names from variables. (eg foo$(VAR) : $(PREREQS)). Is there any way that gnu make can be convinced to spit out a list of targets after it has expanded these variables?

  Read the article

• Image Uploading in a web aplication.

  - by sandeep manglani

  actually i m devloping a web application that provides facility to users upload the image as we see in orkut and facebook through a form and a upload button.but the actually problem I am facing is : 1.should i store the image in database using Large data objects ie BLOB and the problem arises of retrieving it back from the database and then displaying it on the form. 2.sholud i store the absolute path of the the image in database and provide it to the source tag of the image in the html form.

  Read the article

• How to link to part of the same document in Markdown?

  - by recipriversexclusion

  I am writing a large Markdown document and would like to place a table of contents of sorts at the beginning that will provide links to various locations in the document. How can I do this? I tried using [a link](# MyTitle) where MyTitle is a title within the document and this didn't work.

  Read the article

• I need to show bigger image when image is clicked, is there any good jQuery plugins for this?

  - by newbie

  I need good and small plugin to show bigger image. One requirement is that images are different images, because images might be large, so if user dosen't click on image, then user doesn't have to download big image, but just smaller image.

  Read the article

• Oracle : Identifying duplicates in a table without index

  - by user288031

  When I try to create a unique index on a large table, I get a unique contraint error. The unique index in this case is a composite key of 4 columns. Is there an efficient way to identify the duplicates other than : select col1, col2, col3, col4, count() from Table1 group by col1, col2, col3, col4 having count() 1 The explain plan above shows full table scan with extremely high cost, and just want to find if there is another way. Thanks !

  Read the article

• How to define and work with an array of bits in C?

  - by Eddy

  I want to create a very large array on which I write '0's and '1's. I'm trying to simulate a physical process called random sequential adsorption, where units of length 2, dimers, are deposited onto an n-dimensional lattice at a random location, without overlapping each other. The process stops when there is no more room left on the lattice for depositing more dimers (lattice is jammed). Initially I start with a lattice of zeroes, and the dimers are represented by a pair of '1's. As each dimer is deposited, the site on the left of the dimer is blocked, due to the fact that the dimers cannot overlap. So I simulate this process by depositing a triple of '1's on the lattice. I need to repeat the entire simulation a large number of times and then work out the average coverage %. I've already done this using an array of chars for 1D and 2D lattices. At the moment I'm trying to make the code as efficient as possible, before working on the 3D problem and more complicated generalisations. This is basically what the code looks like in 1D, simplified: int main() { /* Define lattice */ array = (char*)malloc(N * sizeof(char)); total_c = 0; /* Carry out RSA multiple times */ for (i = 0; i < 1000; i++) rand_seq_ads(); /* Calculate average coverage efficiency at jamming */ printf("coverage efficiency = %lf", total_c/1000); return 0; } void rand_seq_ads() { /* Initialise array, initial conditions */ memset(a, 0, N * sizeof(char)); available_sites = N; count = 0; /* While the lattice still has enough room... */ while(available_sites != 0) { /* Generate random site location */ x = rand(); /* Deposit dimer (if site is available) */ if(array[x] == 0) { array[x] = 1; array[x+1] = 1; count += 1; available_sites += -2; } /* Mark site left of dimer as unavailable (if its empty) */ if(array[x-1] == 0) { array[x-1] = 1; available_sites += -1; } } /* Calculate coverage %, and add to total */ c = count/N total_c += c; } For the actual project I'm doing, it involves not just dimers but trimers, quadrimers, and all sorts of shapes and sizes (for 2D and 3D). I was hoping that I would be able to work with individual bits instead of bytes, but I've been reading around and as far as I can tell you can only change 1 byte at a time, so either I need to do some complicated indexing or there is a simpler way to do it? Thanks for your answers

  Read the article

• gpf while sync to Sharepoint from Project 2010

  - by user316663

  i am trying to use built-in MS Project feature - sync to sharepoint list. The project size is not very large - yet i almost always get GPFs. Could not find any leads on how to work around this

  Read the article

• Why is a .net generic dictionary so big

  - by thefroatgt

  I am serializing a generic dictionary in VB.net and I am very surprised that it is about 1.3kb with a single item. Am I doing something wrong, or is there something else I should be doing? I have a large number of dictionaries and it is killing me to send them all across the wire. The code I use for serialization is Dim dictionary As New Dictionary(Of Integer, Integer) Dim stream As New MemoryStream Dim bformatter As New BinaryFormatter() dictionary.Add(1, 1) bformatter.Serialize(stream, dictionary) Dim len As Long = stream.Length

  Read the article

• uploading problem

  - by Syom

  i can't upload large files, but i've set php.ini max_execution_time = 3600 max_input_time = 600 memory_limit = 100M post_max_size = 100M file_uploads = On upload_max_filesize = 100M it returns a 500 error - [an error occurred while processing this directive] could you say why? thanks

  Read the article

• Creating a modular web app?

  - by Khou

  If i was to design this application in modules (ie split a large app in smaller modular applications) I might design it like this, is this correct? MainApplicaionX the following 5 modules? Company Customer Employee Supplier Banking if Not How would you create this into a modular app?

  Read the article

• How can I solve NP complete problems in erlang?

  - by Yadira Suazo

  Hi, I already have my operators for, by example, eat banana problem [#op{ action = [climb, on, {object}], preconds = [[at, {place}, {object}], [at, {place}, me], [on, floor, me], [on, floor, {object}], [large, {object}]], add_list = [[on, {object}, me]], del_list = [[on, floor, me]] }, But how can I use it in the function solve(Problem, depth_first, []). And depth_first (Problem, Start) - search_tree(Problem, container.stack, Start).

  Read the article

• loading javascript file after jquery.ready

  - by Spines

  I want to load a javascript file at the end of jquery.ready so that the code in my ready handler doesn't have to wait to execute until this large javascript file is loaded. My jquery.ready code doesn't rely on this javascript file at all. Would this be a good way to do that? $(function(){ ... ... $('head').append('<script type="text/javascript" src="/largejs.js"></script>'); });

  Read the article

• Change size of ImageIcon in a JRadioButton

  - by Frederik Wordenskjold

  I simply want to change the size (diameter) of the actual (default) ImageIcon of my JRadioButton. I've changed the size of the font displayed in the widget, so it really looks silly with such a large radiobutton. JRadioButton button = new JRadioButton("Button"); button.setFont(new Font("Lucida Grande",Font.PLAIN, 11)); gives me this giant button: Do I really have to create my own ImageIcon? Or can I somehow scale the default one, without too much of a hassle?

  Read the article

• How to "check for overwide node(s)." in graphviz dot file

  - by Tomas Forsman

  I'm trying to generate a large graph using graphviz. I have a generated text file with nodes defined in the dot format. When I try to generate a PNG file from the file using dot -Tpng:cairo graph.txt graph.png I get the error message: Error: Edge length 136228 larger than maximum 65535 allowed. Check for overwide node(s). How do I actually "check for overwide node(s)" ?

  Read the article

• How can I rebuild / reorganize my indexes on Sql Compact 3.5 SP1 ?

  - by Jalil

  I have a large (40 Mo) SDF database. Some queries are very long, but can become quick after some time. I would like to try to tidy up my indexes but I only find information for SQL Server and not for SQL CE.

  Read the article

• Splitting tables by field to optimize MySQL?

  - by AK

  Do splitting fields into multiple tables ever yield faster queries? Consider the following two scenarios: Table1 ----------- int PersonID text Value1 float Value2 or Table1 ----------- int PersonID text Value1 Table2 ----------- int PersonID float Value2 If Value1 and Value2 are always being displayed together, I imagine Table1 is always faster because the second schema would require two SELECT statements. But are there any situations where you would choose the second? If the number of records were expected to be really large?

  Read the article

• Printing page x of y in .Net

  - by maxfridbe

  If I have a very large document to print and on each page of the document it needs to say "page x of y" Is there a way I could precalculate y without having to printing twice as offered as a solution here: http://bytes.com/topic/c-sharp/answers/862133-c-printing-page-count I'm trying to avoid printing once, getting they y and then setting it, then printing again.

  Read the article

< Previous Page | 161 162 163 164 165 166 167 168 169 170 171 172  | Next Page >