Search Results

Search found 12267 results on 491 pages for 'out of memory'.

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

• Now that Device Central is dead, how can I test my Flash Lite applications?

  - by Kirby

  I'm trying to use Flash Lite to make a simple game for my girlfriend, who only has a Nokia 5530, but I just realized in CS6 Adobe killed Device Central, so there's no way for me to test it without the device (and it's supposed to be a surprise). Is there any other way for me to test it? I know I can just export the movie and use Flash Player, but Device Central allowed me to test drag and drop and memory/processor usage for example... tl;dr, is there an alternative to Device Central for testing Flash Lite in older devices?

  Read the article

• Alternatives to voxel-based terrain

  - by Neomex

  Are there any alternatives to voxel based terrains? Such terrain should be fully destructable, allow for arches, overhangs, preserve sharp features where needed and keep consistent topology. Maybe you can explain the problem that makes you ask this question? Voxel based terrain is basically just using a 3D grid of data to store data. There are lots of ways to render that data, but it doesn't get much simpler for storing it. – Byte56 Current isosurface extraction methods aren't most effective/bug-free. Cubical Marching Squares seem to solve most of the issues, however it is a relatively new method and there aren't too many resources about it. (I've found single university paper) Even if we stick to CMS, when we want to add multi-material support, we can either divide surface into multiple meshes, or pass a texture array or texture atlas to shaders, then we are limited to set amount of textures and additionally increase memory-usage alot.

  Read the article

• How to get rid of multiple linux versions in grub boot menu

  - by Silver Light

  I've been using dual boot on my PC for some time now, to use Ubuntu along side with Windows 7. One very disturbing thing happens, when Ubuntu linux core gets updated (this happens once in a while). They are added as options to the grub menu so, my boot menu now looks like this: Ubuntu, with linux 2.6.35-27 generic Ubuntu, with linux 2.6.35-27 generic (recovery mode) Ubuntu, with linux 2.6.35-25 generic Ubuntu, with linux 2.6.35-25 generic (recovery mode) Ubuntu, with linux 2.6.35-24 generic Ubuntu, with linux 2.6.35-24 generic (recovery mode) Ubuntu, with linux 2.6.35-22 generic Ubuntu, with linux 2.6.35-22 generic (recovery mode) Memory test Windows 7 This gets very annoying, because I want to load windows by default, but after every update it shifts down and I have to go to grub config and change the default option. My question: How to get rid of older versions of linux in the grub menu and leave only the newest one?

  Read the article

• Edubuntu boot problem on dual boot PC

  - by trptplyr

  When booting Edubuntu on a dual boot PC with Windows 7, the last message that I get is "Restoring resolver state" [Ok]. I then press the Enter key, some other messages come up and go away too quickly to notice what they say, and then the system shuts down. Windows 7 works fine. My system is an older Dell Inspiron 9400 laptop with 3Gb usable memory. This all started happening after attempting to upgrade to the next version of Edubuntu, but was not allowed to because I didn't have enough space in my partition to allow for it. I'm unsure whether that has anything to do with the problem.

  Read the article

• should singleton be life-time available or should it be destroyable?

  - by Manoj R

  Should the singleton be designed so that it can be created and destroyed at any time in program or should it be created so that it is available in life-time of program. Which one is best practice? What are the advantages and disadvantages of both? EDIT :- As per the link shared by Mat, the singleton should be static. But then what are the disadvantages of making it destroyable? One advantage is it memory can be saved when it is not useful.

  Read the article

• What data-structure/algorithm will allow me to send a list of key/value dictionaries using the least amount of bits?

  - by user12365

  I have server objects that have corresponding client objects. The data to be kept in sync is inside the server object's key/value dictionary. To keep the client objects in sync with the sever objects, I want the server to send the key/value dictionary every frame for each object. What data-structure/algorithm will allow me to send a list of key/value dictionaries using the least amount of bits? Bonus constraint 1: For each type of object, the values of some keys change more often than others. Bonus constraint 2: Memory usage on the server side is relatively expensive.

  Read the article

• What are the caveats of the event system built on Messenger rather than on classic .NET events?

  - by voroninp

  MVVM Light and PRISM offer messenger to implement event system. the approximate interface looks like the following one: interface Messanger { void Subscribe<TMessageParam>(Action<TMessageParam> action); void Unsubscribe<TMessageParam>(Action<TMessageParam> action); void Unsubscribe<TMessageParam>(objec actionOwner); void Notify<TMessageParam>(TMessageParam param); } Now this model seems beneficial comparing to classic .net events. It works well with Dependency Injection. Actions are stored as weak references so memory leaks are avioded and unsubscribe is not a must. The only annoyance is the need to declare new TMessageParam for each specific message. But everything comes at a cost. And what I'm really worried about is that I see no shortcomings of this approach. Has anoyne the experience of some troubles with this design pattern?

  Read the article

• Alternatives to sql like databases

  - by user613326

  Well i was wondering these days computers usually have 2GB or 4GB memory I like to use some secure client server model, and well an sql database is likely candidate. On the other hand i only have about 8000 records, who will not frequently be read or written in total they would consume less then 16 Megabyte. And it made me wonder what would be good secure options in a windows environment to store the data work with it multi-client single server model, without using SQL or mysql Would for well such a small amount of data maybe other ideas better ? Because i like to keep maintenance as simple as possible (no administrators would need to know sql maintenance, as they dont know databases in my target environment) Maybe storing in xml files or.. something else. Just wonder how others would go if ease of administration is the main goal. Oh and it should be secure to, the client server data must be a bit secure (maybe NTLM files shares https or...etc)

  Read the article

• Processing a stream. Must layers be violated?

  - by Lord Tydus

  Theoretical situation: One trillion foobars are stored in a text file (no fancy databases). Each foobar must have some business logic executed on it. A set of 1 trillion will not fit in memory so the data layer cannot return a big set to the business layer. Instead they are to be streamed in 1 foobar at a time, and have business logic execute on 1 foobar at a time. The stream must be closed when finished. In order for the stream to be closed the business layer must close the stream (a data operation detail), thus violating the separation of concerns. Is it possible to incrementally process data without violating layers?

  Read the article

• Miss Open World? View this Roadmap Presentation

  - by PeopleTools Strategy

  If you were unable to attend Oracle Open World in September, you missed out on some important PeopleSoft messages.  Don't despair!  You now have a chance to receive an update on PeopleSoft’s presence at Oracle OpenWorld 2013 and the key messages delivered there. You can view the “PeopleSoft Update and Roadmap” webcast found here on the Quest Users Group site.  (Note: this is available with a FREE subscriber account.  Anyone can sign up here at no cost. This webcast recording presents the significant adoption and momentum behind PeopleSoft 9.2.  Viewers will also learn about the new release model for continuously delivering new capabilities to PeopleSoft customers at a lower cost enabled by the new PeopleSoft Update Manager.  There are also compelling live demonstrations of the major investment areas for PeopleSoft including a new PeopleSoft user experience enabling mobile solutions as well as In-Memory PeopleSoft applications.

  Read the article

• When profiling a function for time use, what information is desirable?

  - by AaronMcSmooth

  I'm writing a program similar to Python's timeit module. The idea is to time a function by executing it anywhere from 10 to 100,000 times depending on how long it takes and then report results. I've read that the most important number is the minimum execution time because this is the number that best reflects how fast the machine can run the code in question in the absence of other programs competing for processor time and memory. This argument makes sense to me. Would you be happy with this? Would you want to know the average time or the standard deviation? Is there some other measure that you consider more important?

  Read the article

• Fast lookup for organization hierarchy

  - by Élodie Petit

  I need a way to implement a fast lookup algorithm / system to find users very quickly in a multi-level department and multi-level employee/manager relation organization structure. Departments can have any level of departments and users directly connected to departments. User are connected to departments and other users at the same time. What would be the best approach to implement such a system? There will be approximately 2000 users and 30 departments. Is there a good way to hold all of this information on memory?

  Read the article

• XBMC is slow and sluggish in Ubuntu 13.04; how can I speed it up?

  - by Dreamdealer

  I have a Zotac ZBOX ID84 with Intel D2550 proc and Nvidia GT520M GPU, 2GB memory and 320GB hard disk. I tried XBMCbuntu first and it ran perfectly for a few months until I started to mess around with the Terminal. After a re-install I could get the HDMI sound to work again so I installed the latest version of Ubuntu (13.04) instead. That worked fine. The sound and everything worked right away, but the interface of Ubuntu is sluggish and XBMC doesn't run as good as it did in XBMCbuntu. The video playback is slow and it stutters. It speeds up and slows down with the complexity of the video. So, the PC is more than capable to run XBMC and play the videos, but something in Ubuntu (GUI?) slows it down to an unusable pace. Can anybody tell me what I can do to speed things up? Since I'm new to Ubuntu I have no clue where to start looking.

  Read the article

• Where can I learn to write my own database?

  - by Buttons840

  I'm interested in writing my own database - a triple-store. Are there any good resources to help with the challenges of such a project? Or more generally: How can I learn to write my own database? Some specific issues I'm unsure of: How is the data actually stored on the file-system? A flat-file seems easy enough, but a database is a lot more then a flat-file. What kinds of things are typically stored (or cached) in memory? How are indexes created and stored? How is ACID compliance achieved? Etc. This is a big topic, but knowing how to store large amounts of data in a reliable way is good to know. (My investigation into existing triple-stores was summarized back in 2008; not much has changed in 4 years it seems. This is why I want write my own.)

  Read the article

• Daemon for moving files between partitions?

  - by RATHI

  I have a system with Ubuntu installed in 20GB and windows in 100 GB, two partitions - each of 100GB using NTFS. While using DC++ (multiple downloading of big file) I used to get message that system is running out of memory. Is there any way to make a deamon which will be checking the Ubuntu partition so that if its used space goes up to a certain amount (let's say 18 GB) it will automatically start a moving file from this drive to another drive (let's assume it will pick the file from movie folder or largest media file from this drive to move)? Or it prompt to ask from user which file to move? Is there any program which can do this for me? If not, can you suggest something to read so that I could make it?

  Read the article

• Given two sets of DNA, what does it take to computationally "grow" that person from a fertilised egg and see what they become? [closed]

  - by Nicholas Hill

  My question is essentially entirely in the title, but let me add some points to prevent some "why on earth would you want to do that" sort of answers: This is more of a mind experiment than an attempt to implement real software. For fun. Don't worry about computational speed or the number of available memory bytes. Computers get faster and better all of the time. Imagine we have two data files: Mother.dna and Father.dna. What else would be required? (Bonus point for someone who tells me approx how many GB each file will be, and if the size of the files are exactly the same number of bytes for everyone alive on Earth!) There would ideally need to be a way to see what the egg becomes as it becomes a human adult. If you fancy, feel free to outline the design. I am initially thinking that there'd need to be some sort of volumetric voxel-based 3D environment for simulation purposes.

  Read the article

• Exalytics at Partners in EMEA

  - by Mike.Hallett(at)Oracle-BI&EPM

  Many partners have got Oracle Exalytics systems on their premises where they can help customers with proof-of-solution demonstrations to show how fast this engineered in-memory analytics solution can be, and how this translates into tangible business benefits.  Any customer with Oracle Analytics (OBIEE, Essbase, Hyperion Planning, Oracle BI-Applications) who is seeking to upgrade their hardware infrastructure, looking for a quick, low risk and cost effective implementation, should contact one of these to test what an Exalytics can do for them. Below is a list of some of our specialist Oracle Partners who have an Exalytics: http://www.arrowecs.fr/produits/index.php?id=82 France http://www.ise-informatik.de/ Germany http://www.hotitem.nl/ Netherlands http://bi.fors.ru/ Russia http://www.synchrotech-group.com/ Switzerland http://www.linkplus.com.tr/ Turkey http://www.rittmanmead.com/ UK

  Read the article

• Miss Oracle Open World? View the PeopleSoft Roadmap Presentation Here

  - by John Webb

  If you were unable to attend Oracle Open World in September, you missed out on some important PeopleSoft messages.   Don't despair!  You now have a chance to receive an update on PeopleSoft's presence at Oracle OpenWorld 2013 and the key messages delivered there. You can view the “PeopleSoft Update and Roadmap” webcast found here on the Quest Users Group site.  (Note: this is available with a FREE subscriber account.  Anyone can sign up here at no cost. This webcast recording presents the significant adoption and momentum behind PeopleSoft 9.2.  Viewers will also learn about the new release model for continuously delivering new capabilities to PeopleSoft customers at a lower cost enabled by the new PeopleSoft Update Manager.  There are also compelling live demonstrations of the major investment areas for PeopleSoft including a new PeopleSoft user experience enabling mobile solutions as well as In-Memory PeopleSoft applications. You can view all presentations ns in the Oracle Open World 2013 Content Catalog.

  Read the article

• Render 2D textures on a 3D object's face

  - by www.Sillitoy.com

  I am not familiar with 3D graphics, and I'd like to know the right way to render some 2D figures on different points of a wider face of a 3D object. My 3D object is just a cube representing a poker table. I have a 2D png for players' placeholders, and I'd like to render these figures on the 3D object where needed. An alternative solution would be to render the whole face with a big picture containing all the placeholders figures. However, it would be a waste of memory and thus less efficient. What do you suggest?

  Read the article

• Can all code be represented as a series of Map / Filter / Reduce operations?

  - by Mongus Pong

  I have recently been refactoring large chunks of code and replacing them with Linq queries. Removing the language bias - Linq is essentially a set of Map / Filter and Reduce operations that operate on a sequence of data. This got me thinking, how far would I theoretically be able to take this. Would I be able to rewrite the whole code base into a series (or even a single) of Map / Filter and Reduce operations. Unfortunately I get paid to do useful stuff, so I haven't been able to experiment much further, but I can't think of any code structure that couldn't be re structured as such. Side effected code can be dealt with via monads.. Even output is essentially mapping memory addresses to screen addresses. Is there anything that couldn't be (theoretically) rewritten as a Linq query?

  Read the article

• Data structures for a 3D array

  - by Smallbro

  Currently I've been using a 3D array for my tiles in a 2D world but the 3D side comes in when moving down into caves and whatnot. Now this is not memory efficient and I switched over to a 2D array and can now have much larger maps. The only issue I'm having now is that it seems that my tiles cannot occupy the same space as a tile on the same z level. My current structure means that each block has its own z variable. This is what it used to look like: map.blockData[x][y][z] = new Block(); however now it works like this map.blockData[x][y] = new Block(z); I'm not sure why but if I decide to use the same space on say the floor below it wont allow me to. Does anyone have any ideas on how I can add a z-axis to my 2D array? I'm using java but I reckon the concept carries across different languages.

  Read the article

• Do unused vertices in a 3D object affect performance?

  - by Gajet

  For my game I need to generate a mesh dynamically. Now I'm wondering does it have a noticeable affect in FPS if I allocate more vertices than what I'm actually using or not? and does it matter if I'm using DirectX or OpenGL? Edit Final output will be a w*h cell grid, but for technical issues it's much easier for me to allocate (w+1)*(h+1) vertices. Sure I'll only use w*h vertices in indexing, and I know there is some memory wasting there, but I want to know if it also affect FPS or not? (Note that mesh is only generated once in each time you play the game)

  Read the article

• Do threads delete themselves?

  - by Prog

  Let's say I was working on a Swing application. Most of it is run on the EDT using SwingUtilities.invokeLater() inside the main method, because I heard (please correct me if I'm wrong) that that's what you need to do with Swing. However, some parts of it shouldn't run on the EDT. These parts are parts that take long to complete (I assume that this is because long tasks on the EDT will interfere with GUI stuff the EDT should be doing, and thus these kinds of tasks should be run on parallel, on a different thread. Is this assumption correct?) To do this, when I need to perform a task that takes long to complete and thus can't be run on the EDT like the rest of the program, I create a new thread and run that task inside it. My question is: When the run() method of that new thread finishes, aka the thread finished it's job. Does it delete itself? Or does it keep existing in the memory?

  Read the article

• Can GJK be used with the same "direction finding method" every time?

  - by the_Seppi

  In my deliberations on GJK (after watching http://mollyrocket.com/849) I came up with the idea that it ins not neccessary to use different methods for getting the new direction in the doSimplex function. E.g. if the point A is closest to the origin, the video author uses the negative position vector AO as the direction in which the next point is searched. If an edge (with A as an endpoint) is closest, he creates a normal vector to this edge, lying in the plane the edge and AO form. If a face is the feature closest to the origin, he uses even another method (which I can't recite from memory right now) However, while thinking about the implementation of GJK in my current came, I noticed that the negative direction vector of the newest simplex point would always make a good direction vector. Of course, the next vertex found by the support function could form a simplex that less likely encases the origin, but I assume it would still work. Since I'm currently experiencing problems with my (yet unfinished) implementation, I wanted to ask whether this method of forming the direction vector is usable or not.

  Read the article

• SAP courtise les petites structures et les startups, l'éditeur veut faire savoir que ses solutions ne s'adressent pas qu'aux "gros"

  SAP courtise les petites structures et les start-ups Et veut faire savoir que ses solutions ne s'adressent pas qu'aux multinationales HANA n'est pas réservé aux multinationales. SAP a mis les petits plats dans les grands pour le faire savoir lors d'un « concours » de start-ups qui souhaitent utiliser la technologie de In-Memory Computing de l'éditeur allemand pour accélérer de manière drastique le traitement de leurs données ? et donc de leurs temps de calcul. Cette journée parisienne du « SAP Startup Forum » a vu défiler des entreprises très diverses. Certaines ont été lancées depuis plusieurs années (comme Kxen, qui crée des outils de « deuxième génération d'analyse pré...

  Read the article

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