Search Results

Search found 21501 results on 861 pages for 'slow connection'.

Page 517/861 | < Previous Page | 513 514 515 516 517 518 519 520 521 522 523 524  | Next Page >

• Which approach to create the data access layer has the highest performance?

  - by pooyakhamooshi

  I have to create a very high performance application. Currently, I am using Entity Framework for my data access layer. My application has to insert some communication data almost every second. I found that Entity Framework is slow; it has about 2 seconds delay to finish the SaveChanges() method. I was thinking I have the following options: 1. Create the data access layer myself using ADO.NET; using stored procedures or ad-hoc queries 2. Use Enterprise Library Data access Layer 3. Use NHibernate 4. Use Repository Factory: http://pooyakhamooshi.blogspot.com/search?q=repository What do you think? which one is quicker for inserting data? Which one is quicker to set up?

  Read the article

• Efficiently Reshaping/Reordering Numpy Array to Properly Ordered Tiles (Image)

  - by Phelix

  I would like to be able to somehow reorder a numpy array for efficient processing of tiles. what I got: >>> A = np.array([[1,2],[3,4]]).repeat(2,0).repeat(2,1) >>> A # image like array array([[[1, 1, 2, 2], [1, 1, 2, 2]], [[3, 3, 4, 4], [3, 3, 4, 4]]]) >>> A.reshape(2,2,4) array([[[1, 1, 2, 2], [1, 1, 2, 2]], [[3, 3, 4, 4], [3, 3, 4, 4]]]) what I want: X >>> X array([[[1, 1, 1, 1], [2, 2, 2, 2]], [[3, 3, 3, 3], [4, 4, 4, 4]]]) to be able to do something like: >>> X[X.sum(2)>12] -= 1 >>> X array([[[1, 1, 1, 1], [2, 2, 2, 2]], [[3, 3, 3, 3], [3, 3, 3, 3]]]) Is this possible without a slow python loop? Bonus: Conversion back from X to A Edit: How can I get X from A?

  Read the article

• A good ecommerce alternative to Magento?

  - by delboud

  I been dealing with Magneto for the last 6 months now and its a real headache, always some type of error, slow, bloated, dead community and overly complex to customize (and im a designer...) I look at others like zencart but seem kinda dated compared to magento, but are their any other solutions to replace magento thats better and with a good online community? the main selling points im looking for are configurable items (as in options for products), good online community and not so hard to customize or a nice amount of templates available. has to be free and hopefully open source and if it helps this is for a custom car accessories store

  Read the article

• IE8 Slide Toggle Issue

  - by jef2904

  Im having some trouble with jQuery's slideToggle function in IE8 for some reason the DIV its opening closes immediately after its opened heres the code im using $("h3 a").click(function(){ id = $(this).attr("href"); $(id).slideToggle("slow"); }); and the HTML <h3><a href="#promo-materials">Graphic and Pormotional Materials</a></h3> <div id="promo-materials" class="center gallery"> <a href="images/portfolio/bistro.png" rel="facebox"> <img src="images/portfolio/thumbs/bistro.png" alt="" /> </a> <a href="images/portfolio/direct-savings.png" rel="facebox"> <img src="images/portfolio/thumbs/direct-savings.png" alt="" /> </a> </div> Here is a link to the functional page it works in all other browsers including IE7

  Read the article

• Am I underestimating MySQL ?

  - by user281434

  Hi I'm about to implement a feature on my website that recommends content to users based on the content they already have in their library (a la Last.fm). A single table holds all the records of the content they have added, so a row might look something like: -------------------- | userid | content | -------------------- | 28 | a | -------------------- When I want to recommend some content for a user, I use a query to get all the user id's that have content a added in their library. Then, out of those user id's, I make another query that finds the next most common content among those users (fx. 'b'), and show that to the user. My problem is when I'm thinking about the big picture here. Say that eventually my site will hold something like 500.000 rows in the table, will this make the MySQL response very slow or am I underestimating MySQL here?

  Read the article

• how to go through a string array and apply functions for different strings?

  - by Newbie

  Ok, this may be really noobish question, but i am wishing there is something i dont know yet. I go through a file, and check which string each line has, depending on the string value i execute a different function for it (or functions). This is how i do it now: if(str == "something"){ // do stuff }else if(str == "something else"){ // do stuff }else if(str == "something more"){ // do stuff }else if(str == "something again"){ // do stuff }else if(str == "something different"){ // do stuff }else if(str == "something really different"){ // do stuff } I am afraid this will become "slow" after i have to repeat those else if lines a lot... I tried to use switch() statement, but obviously it doesnt work here, is there something similar to switch() to use here?

  Read the article

• Actionscript: Switching back into previous function from event handler function

  - by J.Ded.

  I need to return to my original function after capturing an event (downloading something) with another function. The original function needs to return a value, which depends on the downloaded data. So, I'd like to pause original function for the time needed for the download and the eventhandler function to complete it's work, and resume it afterwards. The obvious way is to set a flag value (both the original function and the eventhandler are within the same class) and make the original function check it until the eventhandler function changes the flag. But that would be wasteful, and my AS is slow enough already:) [other parts of the application utilise some heavy graphics]. Is there another way? Like an event that gets captured "in the middle" of the function? Or some other form of flow control?

  Read the article

• How to speed up saving a UIImagePickerController image from the camera to the filesystem via UIImagePNGRepresentation()?

  - by kazuhito0000

  I'm making an applications that let users take a photo and show them both in thumbnail and photo viewer. I have NSManagedObject class called photo and photo has a method that takes UIImage and converts it to PNG using UIImagePNGRepresentation() and saves it to filesystem. After this operation, resize the image to thumbnail size and save it. The problem here is UIImagePNGRepresentation() and conversion of image size seems to be really slow and I don't know if this is a right way to do it. Tell me if anyone know the best way to accomplish what I want to do. Thank you in advance.

  Read the article

• What is your favorite colorscheme FOR PROGRAMMING in Vim?

  - by ThomasGHenry

  I think this is a relevant question for programmers and I'd like to hear other people's answers because some syntax highlighting color schemes are better on the eyes than others. This can affect productivity as much as ergonomic keyboards or anything else on here. It's about comfort and productivity. So, I'm curious. Do you find some color schemes better adapted for some languages over others? At the other end of the spectrum, I think coding without syntax highlight is awful and slow going. Does anyone work better like this? Thanks! EDIT: so we'll try it as a community wiki. Similar Question

  Read the article

• How to hide/show div using jQuery without altering dimensions?

  - by Byron S

  I have a div that is holding a google chart: <div id="chart_div" style="width: 600px; height: 300px;"></div> It has one CSS property: display: none. On the click of a button, I would like to have the chart be displayed using jQuery hide() and show(). It's working, however, the chart's dimensions are set to something different than I have specified and refuse to change to what I have specified. Here is my jquery code: $(document).ready(function(){ var chart = $('#chart_div'); $('#submit').click(function(){ chart.show('slow'); }); }); Let me know if theres any more code you would like to see. By the way, the chart div is not being contained in anything else so that isn't the problem.

  Read the article

• Class library modification / migration

  - by Clint

  I have 3 class libraries. A BBL, a DAL, and a DATA (about 15 datasets). Currently 4 [major] applications utilize the functionality in these DLL's. I'm rewriting one of those applications and I need to (1) Use some of the existing functionality in the libraries (2) Change some of it (3) Add new functionality (4) Add new datasets. I'm back and forth about the best way to do this, while keeping my risks at a minimum. Some thoughts.. 1) Use the existing projects and don't make any modifications, only additions 2) Make new libraries, bring over the code I can use, and make additions as needed 3) Implement partial classes in the existing projects Eventually all 4 applications will use the newest functionality, but it will be a slow migration; so the old code can't be depricated yet. Any thoughts?

  Read the article

• Layers with GDI+

  - by user146780

  I'm thinking of creating a drawing program with layers, and using GDI+ to display them. I want to use GDI+ because it supports transparency. The thing is, drawing lines to the DC is very fast, but drawing directly to a bitmap is very slow. It is only fast if you lock the bits and start setting pixels. Can I draw to multiple DC's in my WM_PAINT event, then just do DrawBitmap for each layer to the MemDC? What's the best way of going about this? Thanks

  Read the article

• What's the most efficient way to manage large datasets with Javascript/jQuery in IE?

  - by RenderIn

  I have a search that returns JSON, which I then transform into a HTML table in Javascript. It repeatedly calls the jQuery.append() method, once for each row. I have a modern machine, and the Firefox response time is acceptable. But in IE 8 it is unbearably slow. I decided to move the transformation from data to HTML into the server-side PHP, changing the return type from JSON to HTML. Now, rather than calling the jQuery.append() time repeatedly, I call the jQuery.html() method once with the entire table. I noticed Firefox got faster, but IE got slower. These results are anecdotal and I have not done any benchmarking, but the IE performance is very disappointing. Is there something I can do to speed up the manipulation of large amounts of data in IE or is it simply a bad idea to process very much data at once with AJAX/Javascript?

  Read the article

• Easy Threading in WPF

  - by Sandeep Bansal

  Hi everyone, I've been reading a lot about threading in C#, WPF and Silverlight but can't get it to work. My main problem is I have the _load (_Initialized) action and it has a lot of object creation and along with that I have timers working doing different things, this causes the startup time of the program to be very slow and obviously causes the UI to hang and it isn't a good thing for deploying to a lot of users. My timers change values of labels and textfields but having them do that on another thread is an obvious no go. So can someone give me some examples on how to achieve what I need to do? Thanks

  Read the article

• Jquery show div on hover then when user hovers out of div hide it help?

  - by user342391

  I have a menu and when I hover one of the links a div shows. I want the user to be able to hover over this div but when the user hovers out of the div (mouseout i think its called) I want it to hide. Imagine a dropdown menu in css, the user hovers over the link and the sub nav is shown, when the user hovers out or away from the link and sub nav the sub nav dissapears. How can this be done with jquery??? this is what I have: $(document).ready(function(){ //when user hovers over plans the mainnavbottom is shown $(".plans").hover( function() { $(".mainnavbottom").show("fast"); }, function(){ $(".mainnavbottom").mouseout.hide("slow"); }); });

  Read the article

• Wordpress: Forcing a widget to display?

  - by meds

  I've been trying to make a widget which stays active permanently on a wordpress sidebar, preferably being on top before all other widgets. However the only way I have figured I can do this is by manually modifying individual sidebar.php's but that is slow and inefficient. So is there a way I can force a widget to display in a sidebar? If I was to change actual wordpress code where would I go about doing htis? I Know where a widget is registered but I don't know where a widget is activated, if I knew this I think I could force the main widget I want to see active all the time be active.

  Read the article

• How to pass a file (read from Java) most effectively to a native method?

  - by soc

  Hi, I have approx. 30000 files (1MB each) which I want to put into a native method, which requires just an byte array and the size of it as arguments. I looked through some examples and benchmarks (like http://nadeausoftware.com/articles/2008/02/java_tip_how_read_files_quickly) but all of them do some other fancy things. Basically I don't care about the contents of the file, I don't want to access something in that file or the byte array or do anything else with it. I just want to put a file into a native method which accepts an byte array as fast as possible. At the moment I'm using RandomAccessFile, but that's horribly slow (10MB/s). Is there anything like byte[] readTheWholeFile(File file){ ... } which I could put into native void fancyCMethod(readTheWholeFile(myFile), myFile.length()) What would you suggest?

  Read the article

• Faster s3 bucket duplication

  - by Sean McCleary

  I have been trying to find a better command line tool for duplicating buckets than s3cmd. s3cmd can duplicate buckets without having to download and upload each file. The command I normally run to duplicate buckets using s3cmd is: s3cmd cp -r --acl-public s3://bucket1 s3://bucket2 This works, but it is very slow as copies each file via the API one at a time. If s3cmd could run in parallel mode, I'd be very happy. Are there other options available as a command line tools or code that people use to duplicate buckets that are faster than s3cmd?

  Read the article

• Performance of Serialized Objects in C++

  - by jm1234567890

  Hi Everyone, I'm wondering if there is a fast way to dump an STL set to disk and then read it back later. The internal structure of a set is a binary tree, so if I serialize it naively, when I read it back the program will have to go though the process of inserting each element again. I think this is slow even if it is read back in correct order, correct me if I am wrong. Is there a way to "dump" the memory containing the set into disk and then read it back later? That is, keep everything in binary format, thus avoiding the re-insertion. Do the boost serialization tools do this? Thanks! EDIT: oh I should probably read, http://www.parashift.com/c++-faq-lite/serialization.html I will read it now... no it doesn't really help

  Read the article

• Can't get jQuery and IE to be friends

  - by Matthew

  Using jQuery and the Cycle plugin. Runs flawless in Safari, Chrome, Firefox, and the latest version of Opera. Won't run in older versions of Opera, and of course, IE. I know its running Java, because its picking up the rollovers. This is driving me batty. Hopefully its something simple. Here's the code... $(document).ready(function() { $("#slideshow").css("overflow", "hidden"); $("div#slides").cycle({ fx: 'scrollHorz', speed: 'slow', timeout: 0, prev: '#prev', next: '#next' }); Really appreciate the help guys.

  Read the article

• SQL JOIN with two or more tables as output - most efficient way?

  - by littlegreen

  I have an SQL query that executes a LEFT JOIN on another table, then outputs all results that could be coupled into a designated table. I then have a second SQL query that executes the LEFT JOIN again, then outputs the results that could not be coupled to a designated table. In code, this is something like: INSERT INTO coupledrecords SELECT b.col1, b.col2... s.col1, s.col2... FROM bigtable AS b LEFT JOIN smallertable AS s ON criterium WHERE s.col1 IS NOT NULL INSERT INTO notcoupledrecords SELECT b.col1, b.col2... bigtable AS b LEFT JOIN smallertable AS s ON criterium WHERE s.col1 IS NULL My question: I now have to execute the JOIN two times, in order to achieve what I want. I have a feeling that this is twice as slow as it could be. Is this true, and if yes, is there a way to do it more efficiently?

  Read the article

• is there a limit of merge tables with Mysql ?

  - by sysko

  I'm working on a database with mysql 5.0 for an open source project it's used to stored sentences in specific languages and their translations in other languages I used to have a big table "sentences" and "sentences_translations" (use to join sentences to sentences) table but has we have now near one million entries, this begin to be a bit slow, moreover, most of request are made using a "where lang =" so I've decided to create a table by language sentences_LANGUAGECODE and sentences_translation_LANGSOURCE_LANGTARGET and to create merge table like this sentences_ENG_OTHERS which merge sentences_ENG_ARA sentences_ENG_DEU etc... when we want to have the translations in all languages of an english sentence sentences_OTHERS_ENG when we want to have only the english translations of some sentences I've created a script to create all these tables (they're around 31 languages so more than 60 merge table), I've tested, that works really great a request which use to take 160ms now take only 30 :) but I discover that all my merge table after the 15th use to have "NULL" as type of storage engine instead of MRG_MYISAM, and if delete one, then I can create an others, using FLUSH table between each creation also allow me to create more merge tables so is this a limitation from mysql ? can we override it ? thanks for your answers

  Read the article

• jQuery: Fade not working

  - by Rosarch

  For some reason, jQuery's fade effect isn't working. Could it be because of the code? This function does everything it is supposed to, aside from the fading. It gets called at the correct time. function moveToTerm(original_course, helper, term) { var cloned_course = original_course.clone(true); original_course.addClass('already-scheduled'); helper.fadeOut(function() { cloned_course.appendTo(term).attr('style', '').fadeIn("slow"); }); } UPDATE: It fails in both FF 3.5.9 and IE 8.

  Read the article

• How to calculate the state of a graph?

  - by zcb

  Given a graph G=(V,E), each node i is associated with 'Ci' number of objects. At each step, for every node i, the Ci objects will be taken away by the neighbors of i equally. After K steps, output the number of objects of the top five nodes which has the most objects. Some Constrains: |V|<10^5, |E|<2*10^5, K<10^7, Ci<1000 My current idea is: represent the transformation in each step with a matrix. This problem is converted to the calculation of the power of matrix. But this solution is much too slow considering |V| can be 10^5. Is there any faster way to do it?

  Read the article

• Searching in a TreeMap (Java)

  - by Kronen

  I need to do a search in a map of maps and return the keys this element belong. I think this implementation is very slow, can you help me to optimize it?. I need to use TreeSet and I can't use contains because they use compareTo, and equals/compareTo pair are implemented in an incompatible way and I can't change that. (sorry my bad english) Map m = new TreeSet(); public String getKeys(Element element) { for(Entry e : m.entrySet()) { mapSubKey = e.getValue(); for(Entry e2 : mapSubKey.entrySet()) { setElements = e2.getValue(); for(Element elem : setElements) if(elem.equals(element)) return "Key: " + e.getKey() + " SubKey: " + e2.getKey(); } } }

  Read the article

< Previous Page | 513 514 515 516 517 518 519 520 521 522 523 524  | Next Page >