Search Results

Search found 8647 results on 346 pages for 'intel cpu'.

Page 275/346 | < Previous Page | 271 272 273 274 275 276 277 278 279 280 281 282  | Next Page >

• Is there a way to highlight specific words or numbers without inserting a span tag?

  - by Taylor

  I've got blocks of text with various specs in them and want to have jquery highlight whatever matches a specific pattern without inserting any extra html. The following is the kind of text that I've got to work with. Intel® Core™ i7 Processor 920 (2.66GHz, 8MB cache, 4.8GT/sec)/ Genuine Windows® 7 Home Premium 64bit- English/ 640 GB Serial ATA non Raid (7200 Rpm)/ 6GB 1333MHz (3x2GB) Tri Channel Memory/ Display Not Included/ 16X DVD+/- RW Optical Drive (DVD & CD read and write)/ 1.8GB NVIDIA® GeForce™ GTX260 graphics card/ Integrated HDA 7.1 Dolby Digital Audio What I'm hoping jquery can do is highlight some of the basic specs without inserting any extra html. Maybe working off a list of values matching the spec format using some wildcards where neededed? The css to select the correct tag is #list div div div+p or I could just give the p class but would rather not. Is this kind of thing possible?

  Read the article

• Which libraries use the "We Know Where You Live" optimization for std::make_shared?

  - by KnowItAllWannabe

  Over two years ago, Stephan T. Lavavej described a space-saving optimization he implemented in Microsoft's implementation of std::make_shared, and I know from speaking with him that Microsoft has nothing against other library implementations adopting this optimization. If you know for sure whether other libraries (e.g., for Gnu C++, Clang, Intel C++, plus Boost (for boost::make_shared)) have adopted this implementation, please contribute an answer. I don't have ready access to that many make_shared implementations, nor am I wild about digging into the bowels of the ones I have to see if they've implemented the WKWYL optimization, but I'm hoping that SO readers know the answers for some libraries off-hand. I know from looking at the code that as of Boost 1.52, the WKWYL optimization had not been implemented, but Boost is now up to version 1.55. Note that this optimization is different from std::make_shared's ability to avoid a dedicated heap allocation for the reference count used by std::shared_ptr. For a discussion of the difference between WKWYL and that optimication, consult this question.

  Read the article

• cross compiling using visual studio 2005

  - by suresh

  Hi, I compiled a x64 application in win32 development environment.. When I run that binary in 64 bit intel machine , the following error is displayed "The application has failed to start because its side-by-side configuration is incorrect. Please see the application event log or use the command-line sxstrace.exe tool for more detail.".. In the event log it is mentioned that "Activation context generation failed for . Dependent Assembly icrosoft.VC80.DebugCRT,processorArchitecture="amd64",publicKeyToken="1fc8b3b9a1e18e3b",type="win32",version="8.0.50608.0" could not be found. Please use sxstrace.exe for detailed diagnosis. What is this issue and how to resolve this problem ?and architecture of the target system is amd64. C:\>set | findstr /i amd64 PROCESSOR_ARCHITECTURE=AMD64

  Read the article

• List of phones that will work with Eclipse?

  - by user1058647

  I need an android phone to test my apps with that will work with Eclipse. It has to be low cost, run Gingerbread with modest memory and CPU. Thinking that any android phone would work I recently purchased a Virgin Mobil Chaser but as it turns out, it cannot be seen by either Eclipse or adb (but device manager does see the phone). Another developer has also had the same identical problem with the Chaser. I could keep buying phones and see if they work but that could be long and frustrating. I hope to find a "no contract" phone. Is there any list of phones that work with Eclipse. Does anyone know of any other Virgin Mobil phones that will work? thanks, Gary

  Read the article

• What alternatives are there to Google App Engine?

  - by Chris Marasti-Georg

  What alternatives are there to GAE, given that I already have a good bit of code working that I would like to keep. In other words, I'm digging python. However, my use case is more of a low number of requests, higher CPU usage type use case, and I'm worried that I may not be able to stay with App Engine forever. I have heard a lot of people talking about Amazon Web Services and other sorts of cloud providers, but I am having a hard time seeing where most of these other offerings provide the range of services (data querying, user authentication, automatic scaling) that App Engine provides. What are my options here?

  Read the article

• C++/CLI Missing MSVCR90.DLL

  - by Mitch

  I have a c++/cli dll that I load at runtime and which works great in debug mode. If I try and load the dll in release mode it fails to load stating that one or more dependencies are missing. If I run depends against it I am missing MSVCR90.DLL from MSVCM90.DLL. If I check the debug version of the dll it also has the missing dependency, but against the debug (D) version. I have made sure debug/release embed the manifest file. I read something about there being issues with the app loading the dll being build as Any CPU and the dll being built as x86, but I don't see how to set them both to x86. I am using VS2010. Anyway, I've been messing around for a while now and have no idea what is wrong. I'm sure someone out there knows what is going on. Let me know if I need to include additional info.

  Read the article

• R problems using rpart with 4000 records and 13 attributes

  - by josh

  I have attempted to email the author of this package without success, just wondering if anybody else has experienced this. I am having an using rpart on 4000 rows of data with 13 attributes. I can run the same test on 300 rows of the same data with no issue. When I run on 4000 rows, Rgui.exe runs consistently at 50% cpu and the UI hangs.... it will stay like this for at least 4-5hours if I let it run, and never exit or become responsive. here is the code I am using both on the 300 and 4000 size subset : train<-read.csv("input.csv",header=T) y<-train[,18] x<-train[,3:17] library(rpart) fit<-rpart(y~.,x) Is this a known limitation of rpart, am I doing something wrong? potential workarounds? any assistance appreciated

  Read the article

• How do I prevent race condition WITHOUT using locks in C++?

  - by Hristo

  How do I prevent a race condition WITHOUT locking or using mutexes/semaphors in C++? I'm dealing with a nested for loop in which I will be setting a value in an array: for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) for (int k = 0; k < o; ++k) array[k] += foo(...); More or less, I want to deal with this so that I can ensure different threads running at the same time don't write to array[k] at the same time. Any suggestions on how to approach this? Edit: I am running on a Linux machine and I also have to use the Intel compiler. I will be using "icc" instead of "gcc" to compile the code.

  Read the article

• VirtualBox: How to connect to Internet via wi-fi on Mac?

  - by Paul Riedel

  I installed VirtualBox with a Win XP VM on my Mac running OS 10.7.5. My Mac only has a wi-fi connection to the internet. On the settings for the virtual host, I set: Attached to: Bridged Adapter Name: en1: Wi-Fi (AirPort) Adapter Type: Intel PRO/1000 MT Desktop (82540EM) Promiscuous Mode: Deny Mac Address: Cable Connected: true Those are the settings I see around the internet as being correct, but I still can't ping anything. On my Mac I have internet sharing via Ethernet enabled (not sure if that matters). When I start up my WinXP VM, it asks me to install a bunch of hardware which I don't have any drivers to. Do I need to install any ethernet card drivers in order for the internet to work? Thank you!!

  Read the article

• c++ programming for clusters and HPC

  - by Abruzzo Forte e Gentile

  HI All I need to write a scientific application in C++ doing a lot of computations and using a lot of memory. I have part of the job but due to high requirements in terms of resources I was thinking to start moving to OpenMPI. Before doing that I have a simple curiosity: If I understood the principle of OpenMPI is the developer that has the task of splitting the jobs over different nodes calling SEND and RECEIVE based on node available at that time. Do you know if it does exist some library or OS or whatever that has this capability letting my code reamain as it is now? Basically something that connects all computers and let share as one their memory and CPU? I am a bit confused because of the high material available on the topic. Should I look at cloud computing? or Distributed Shared Memory? Can you help me or address me a bit? Thanks

  Read the article

• Which hardware for using Vs.NET 2008/2010 decently ?

  - by stighy

  (Hope to be non OT) Hi, i'm a little exasperated about running vs.net 2008 on an acer aspire with an intel t2350. I know, this hardware is not the "last" and the best we can find on the market. So i'm thinking to buy a new notebook. For your experience, which type of processor i can buy ? I found, here in italy, acer notebook between 350-500 euros with t4400 and 2-3 gb ram. Is it enough to have a good "working experience" with vs (with good i intend not to wait 10-20 seconds when i switch from asp.net design to asp.net source code) ? Any answer is appreciated

  Read the article

• Is there a faster way to draw text?

  - by mystify

  Shark complains about a big performance hit with this line, which takes like 80% of CPU time. I have a counter that is updated very frequently and performance seriously sucks. It's an custom UILabel subclass with -drawRect: implemented. Every time the counter value changes, this is used to draw the new text: [self.text drawInRect:textRect withFont:correctedFont lineBreakMode:self.lineBreakMode alignment:self.textAlignment]; When I comment this line out, performance rocks. Its smooth and fast. So Shark isn't wrong about this. But what could I do to improve this? Maybe go a level deeper? Does that make any sense? Probably drawing text is really so incredible heavy...?

  Read the article

• message queue : selection and sizing

  - by user238591

  Hi, I have 20 messages/s, each 1 - 1.5 Mbytes. I need High Availability (2 to 4 servers min). I need low latencey (high daily volume - full RAM prefered). I need persistent poisoned messages queue. Only few clients (about 16), locally. I can have 12-16G bytes RAM per server (brooker). Which JMS message queue / messaging would you recommend ? On what configuration (CPU/RAM) ? Can I propose optionnal NAS persistence (in case of final delivery failure) ? Thanks

  Read the article

• Regex to find a word, then extract a line containing the first occurence of a different word immedia

  - by Hinchy

  World's most convuluted title I know, an example should explain it better. I have a large txt file in the below format, though details and amount of lines will change everytime: Username: john_joe Owner: John Joe Account: CLI: Default: LGICMD: Flags: Primary days: Secondary days: No access restrictions Expiration: Pwdlifetime: Last Login: Maxjobs: Maxacctjobs: Maxdetach: Prclm: Prio: Queprio: CPU: Authorized Privileges: BYPASS Default Privileges: SYSPRV This sequence is repeated a couple of thousand times for different users. I need to find every user (ideally the entire first line of the above) that has SYSPRV under "Default Permissions". I know I could write an application to do this, I was just hoping their might be a nice regex I could use. Cheers

  Read the article

• prevent linux thread from being interrupted by scheduler

  - by johnnycrash

  How do you tell the thread scheduler in linux to not interrupt your thread for any reason? I am programming in user mode. Does simply locking a mutex acomplish this? I want to prevent other threads in my process from being scheduled when a certain function is executing. They would block and I would be wasting cpu cycles with context switches. I want any thread executing the function to be able to finish executing without interruption even if the threads' timeslice is exceeded.

  Read the article

• Oracle: TABLE ACCESS FULL with Primary key?

  - by tim

  There is a table: CREATE TABLE temp ( IDR decimal(9) NOT NULL, IDS decimal(9) NOT NULL, DT date NOT NULL, VAL decimal(10) NOT NULL, AFFID decimal(9), CONSTRAINT PKtemp PRIMARY KEY (IDR,IDS,DT) ) ; SQL>explain plan for select * from temp; Explained. SQL> select plan_table_output from table(dbms_xplan.display('plan_table',null,'serial')); PLAN_TABLE_OUTPUT -------------------------------------------------------------------------------- --------------------------------------------------------------- | Id | Operation | Name | Rows | Bytes | Cost (%CPU)| --------------------------------------------------------------- | 0 | SELECT STATEMENT | | 1 | 61 | 2 (0)| | 1 | TABLE ACCESS FULL| TEMP | 1 | 61 | 2 (0)| --------------------------------------------------------------- Note ----- - 'PLAN_TABLE' is old version 11 rows selected. SQL server 2008 shows in the same situation Clustered index scan. What is the reason?

  Read the article

• How to find root cause for "too many connections" error in MySQL/PHP

  - by Nir

  I'm running a web service which runs algorithms that serve millions of calls daily and run some background processing as well. Every now and than I see "Too many connections" error in attempts to connect to the MySQL box" for a few seconds. However this is not necessarily attributed to high traffic times or anything I can put my finger on. I want to find the bottleneck causing it. Other than in the specific times this happens the server isn't too loaded in terms of CPU and Memory, and has 2-3 connections (threads) open and everything works smoothly. (I use Zabbix for monitoring) Any creative ideas on how to trace it?

  Read the article

• QR Factorization Discrepancy

  - by KyleSum

  I'm trying to get a feel for the Intel MKL library with a simple back-solve (A*x = b) using a QR factorization and comparing my MKL answer to the answer of a known working solution. When my answers didn't come up correct I printed a diff between the Q and R matrices of the known working and the MKL test code. I know MKL/lapack uses "elementary reflectors" to store the values of both the Q and R matrices. So, I'm wondering if these differences (mostly +/-) are by design or the result of some bug. I'm using DGEQRF, DORMQR, and DTRSM routines to solve the system and DORGQR (for debugging) to get the Q matrix shown in the diff. diff with 6x6 matrix (top known, bottom mkl): http://pastebin.com/4uwcME0J

  Read the article

• Embedded Google Earth Plug-Ins no longer working

  - by user1497162

  I really hope someone can help me. I just noticed that none of my website's Google Earth embedded plug-in's work anymore (in Safari, Chrome or Firefox)  All you can see now is blank space and small text that says "Information is temporarily unavailable." I have no idea why they would no longer be working.  Nothing has changed whatsoever. Example here: http://www.grandcanyonvirtualtour.com/_tours/phantom_ranch.html Any suggestions greatly appreciated!! Please note, I am not a coder -- I am a photographer who is learning how to integrate photographs into maps, so I apologize if any questions are elementary. Thanks, Sara I am on a MacBook Pro 2.4 GHz Intel Core i7; OS 10.7.4

  Read the article

• How to optimize indexing of large number of DB records using Zend_Lucene and Zend_Paginator

  - by jdichev

  So I have this cron script that is deployed and ran using Cron on a host and indexes all the records in a database table - the index is later used both for the front end of the site and the backed operations as well. After the operation, the index is about 3-4 MB. The problem is it takes a lot of resources (CPU: 30+ and a good chunk of memory) and slows the machine down. My question is about how to optimize the operation described below: First there is a select query built using the Zend Framework API, this query is then passed to a Paginator factory that returns a paginator which I am using to balance the current number of items being indexed and not iterate over too much items. The script is iterating over the current items in the paginator object using a foreach loop until reaching the end and then it starts from the beginning after getting items for the next page. I am suspecting this overhead is caused by the Zend_Lucene but no idea how this could be improved.

  Read the article

• Faking a Single Address Space

  - by dsimcha

  I have a large scientific computing task that parallelizes very well with SMP, but at too fine grained a level to be easily parallelized via explicit message passing. I'd like to parallelize it across address spaces and physical machines. Is it feasible to create a scheduler that would parallelize already multithreaded code across multiple physical computers under the following conditions: The code is already multithreaded and can scale pretty well on SMP configurations. The fact that not all of the threads are running in the same address space or on the same physical machine must be transparent to the program, even if this comes at a significant performance penalty in some use cases. You may assume that all of the physical machines involved are running operating systems and CPU architectures that are binary compatible. Things like locks and atomic operations may be slow (having network latency to deal with and all) but must "just work".

  Read the article

• Preprocessor not skipping asm directives

  - by demula

  I'm programming to a microprocessor (Coldfire) and I don't have access every day to the microprocessor trainer so I want to be able to execute some of my code on the computer. So I'm trying to skip a part of my code when executing on the computer by defining _TEST_. It doesn't work. It tries to compile the asm code and dies whining about not knowing the registers names (they're defined alright compiling against the Coldfire, not my Intel Core Duo). Any ideas why it's not working? or maybe an alternative way to run the code on the pc without commenting it out?. Here's sample code from my project: inline void ct_sistem_exit(int status) { #ifdef _TEST_ exit(status); #else asm volatile( "moveb #0,%%d1\n\t" "movel #0, %%d0\n\t" "trap #15\n\t" : : : "d0", "d1" ); #endif /* _TEST_ */ } If it helps: using gcc3 with cygwin on Netbeans 6.8

  Read the article

• Endless saving of CoreData Context

  - by Robert

  Sometimes I noticed that a 'save:' operation an a ManagedObjectContext never returns and consumes 100% CPU. I'm using an SQL Store in a GarbageCollected environment (Mac OS X 10.6.3). The disk activity shows about 700 KB/s writing. While having a look at the folder that contains the sqlite database file the "-journal" file appears and disappears, appears and disappears, ... This is part of the call graph from the process analysis: 2203 -[NSManagedObjectContext save:] 1899 -[NSPersistentStoreCoordinator(_NSInternalMethods) executeRequest:withContext:] 1836 -[NSSQLCore executeRequest:withContext:] 1836 -[NSSQLCore saveChanges:] 1479 -[NSSQLCore performChanges] ... 335 -[NSSQLCore recordChangesInContext:] ... 20 -[NSSQLCore rollbackChanges] ... 2 -[NSSQLCore prepareForSave:] ... 62 -[NSPersistentStoreCoordinator(_NSInternalMethods) _checkRequestForStore:originalRequest:andOptimisticLocking:] ... 1 -[NSPersistentStore(_NSInternalMethods) _preflightCrossCheck] ... 184 -[NSMergePolicy resolveConflicts:] ... 120 -[NSManagedObjectContext(_NSInternalChangeProcessing) _prepareForPushChanges:] ... Everything a happening in the main GUI thread. Any ideas what I can to do to resolve the problem?

  Read the article

• How can two programs talk to each other in Java?

  - by Arnon

  I want to ?reduce? the CPU usage/ROM usage/RAM usage - generally?, all system resources that my app uses - who doesn't? :) For this reason I want to split the preferences window from the rest of the application, and let the preferences window to run as ?independent? program. The preferences program ?should? write to a Property file(not a problem at all) and to send a "update signal" to the main program - which means it should call the update method (that i wrote) that found in the Main class. How can I call the update method in the Main program from the preferences program? To put it another way, is a way to build preferences window that take system resources just when the window appears? Is this approach - of separating programs and let them talk to each other (somehow) - the right approach for speeding up my programs?

  Read the article

• Marvell C++ compiler (for Windows CE) for building Qt

  - by vnm

  Hello, I was able to build Qt 4.5 for Windows CE (ARM4VI) using MS VisualC++ compiler. Now, I am trying to compile Qt 4.5 for Windows CE 5.0 using Marvel C++ compiler v 2.2 (former Intel C++ compiler for XScale architecture) for achieving some performance benefit. It seems, that this compiler not officially supported for building Qt by trolltech (no appropriate mkspec in mkspec's folder of Qt folder). So, my questions: Is it worth to trying build Qt by this compiler for achieving performance enhancement ? Is there any way for building Qt using Marvell C++ compiler (by creating my own mkspec or something like that)?

  Read the article

< Previous Page | 271 272 273 274 275 276 277 278 279 280 281 282  | Next Page >