Search Results

Search found 18003 results on 721 pages for 'nidhinzz own'.

Page 200/721 | < Previous Page | 196 197 198 199 200 201 202 203 204 205 206 207  | Next Page >

• Looking for a 24 Hour project for multiple languages [closed]

  - by Daan Timmer

  Right two friends and I came up with this idea of having a 24h programming competition. Where we are going to meet at one place and program away for 24hours long. Though we need a 'project'. Something that needs to be made within 24h. Doesn't have to be a real thing, just a nice learning 'thing'. The rules that we setup for ourselves is that the project can be programmed in any language of our own choice. What I know is that one guy is a PHP enthousiastic, we've got a C#/.NET person. And I am quite easy in languages and speak quite a few (PHP/C#.net/C++STL/Python/JavaScript/Java). Anything really language specific is out of the question. Is there anyone who happens to have a great idea for this?

  Read the article

• returning null vs returning zero, which would be better?

  - by Dark Star1

  I inherited a project that I am managing and having to maintain pending the redevelopment of the code base. At the moment I am being tasked with adding little feature all over the place and have gotten into the habit of returning null instead of zero in parts of the code where I am working on. The problem is we have a client that is using this code and parts of code that require data from my implemented features recieve a null and dump the stack trace in UI. I would like to avoid this entirely from my input but without the nullPointer exceptions there's the potential that errors would be introduced into the client's data which may go un-noticed. Usually I would have come up with my own error notification system but I have never inherited a project before. so I am unsure whether to continue down this path. I still believe that the stack dump is preferable to un-noticed data corruption/inaccuracies.

  Read the article

• How to set sprite source coordinates?

  - by ChaosDev

  I am creating own sprite drawer with DX11 on C++. Works fine but I dont know how to apply source rectangle to texture coordinates of rendering surface(for animation sprite sheets) //source = (0,0,32,64); //RECT D3DXVECTOR2 t0 = D3DXVECTOR2( 1.0f, 0.0f); D3DXVECTOR2 t1 = D3DXVECTOR2( 1.0f, 1.0f); D3DXVECTOR2 t2 = D3DXVECTOR2( 0.0f, 1.0f); D3DXVECTOR2 t3 = D3DXVECTOR2( 0.0f, 1.0f); D3DXVECTOR2 t4 = D3DXVECTOR2( 0.0f, 0.0f); D3DXVECTOR2 t5 = D3DXVECTOR2( 1.0f, 0.0f); VertexPositionColorTexture vertices[] = { { D3DXVECTOR3( dest.left+dest.right, dest.top, z),D3DXVECTOR4(1,1,1,1), t0}, { D3DXVECTOR3( dest.left+dest.right, dest.top+dest.bottom, z),D3DXVECTOR4(1,1,1,1), t1}, { D3DXVECTOR3( dest.left, dest.top+dest.bottom, z),D3DXVECTOR4(1,1,1,1), t2}, { D3DXVECTOR3( dest.left, dest.top+dest.bottom, z),D3DXVECTOR4(1,1,1,1), t3}, { D3DXVECTOR3( dest.left , dest.top, z),D3DXVECTOR4(1,1,1,1), t4}, { D3DXVECTOR3( dest.left+dest.right, dest.top, z),D3DXVECTOR4(1,1,1,1), t5}, };

  Read the article

• Guide to installing a fully encrypted file system?

  - by Michael Stum

  I have a little Netbook on which I want to install Ubuntu 10.10 (32-Bit) on. However, since it is a portable PC I want to completely encrypt the file system (in case of theft). Currently it runs Windows 7 Starter and I use TrueCrypt which installs a custom boot loader that asks for the password. I remember from the past that Linux can do that as well by putting /boot on it's own, unencrypted partition. Since it's been ages since I last worked with file system encryption (I remember setting up LVM and a custom patched grub to ask for the password) I wonder how that would work nowadays and if there is a step-by-step how-to for it?

  Read the article

• HTG Explains: Live File System vs. Mastered Disc Formats in Windows

  - by Chris Hoffman

  When burning a CD or DVD with Windows, you’ll be asked whether you want to use a Live File System or a Mastered disc format. Each has its own advantages and disadvantages. Windows 7 refers to this as “Like a USB flash drive” or “With a CD/DVD player.” But how exactly can a non-rewritable disc function like a USB flash drive? HTG Explains: What is the Windows Page File and Should You Disable It? How To Get a Better Wireless Signal and Reduce Wireless Network Interference How To Troubleshoot Internet Connection Problems

  Read the article

• Personal/career objectives tracker

  - by scottyab

  Looking for a simple, clean and easy to use personal/career objectives tracker for my team of ~10 developers something like what remember the milk is for tasks. At the moment I track these in a google doc, but ideally like a system where I can browse the teams objectives, add a team objective and it automatically appear on members personal objectives. Also where team members can add/manage their own objectives, browse colleges public/team objectives. Ideally it would also have option for people to add personal out side of work objectives for personal dev projects. Anyone used a tool to do this? our a combination of existing tools like gdocs, rtm?

  Read the article

• Looking for bug tracking software

  - by Shelton

  I'm looking for a bug/issue tracking system that can: Integrate with lots of other services. Basecamp, Beanstalk, etc. Integrate popular CMSs, such as WordPress, so the client can enter a ticket from the system that is familiar to them and not have one more login to worry about. Generate reports for my own purposes. Bonus if there's an iPhone app. Doesn't require additional development on my end (I have plenty of money and no time). I've already looked into Lighthouse and ZenDesk -- both are solid offerings -- but don't see what I need out of the box. I'd have to build CMS plug-ins. And I've looked through WP plug-ins for bug tracking software, but nothing I've found integrates with these products. Anyone know of something that meets these requirements without additional development, or am I stuck putting my business on hold to get this piece in place myself?

  Read the article

• What is the best way to work with large databases in Java depending on context?

  - by user19000

  We are trying to figure out the best practice for working with very large DBs in Java. What we do is a kind of BI (business Intelligence), i.e analyzing very large DBs, and using them to create intermediate DBs that represent intelligent knowledge of the DBs. We are currently using JDBC, and just preforming queries using a ResultSet. As more and more data is being created, we are wondering whether more appropriate ways exist for parsing and manipulating these large DBs: We need to support 'chunk' manipulation and not an entire DB at once(e.g. limit in JDBC, very poor performance) We do not need to be constantly connected since we are just pulling results and creating new tables of our own. We want to understand JDBC alternatives, with respect to advantages and disadvantages. Whether you think JDBC is the way to go or not, what are the best practices to go by depending on context (e.g. for large DBs queried in chunks)?

  Read the article

• DirectX 9.0c and C++ GUI

  - by SullY

  Well, I'm trying to code a gui for my engine, but I've got some problems. I know how to make a UI overlay but buttons are still black magic for me. Anything I tried was to compilcated ( if it goes big ). To Example I tried to look if the mouse position is the same as the Pixel that is showing the button. But If I use some bigger areas it's getting to complicated. Now I'm searching for a Tutorial how to implement your own gui. I'm really confused about it. Well I hope you have/ know some good tutorials. By the way, I took a look at the DXUTSample, but it's to big to get overview.

  Read the article

• Rules of Holes #2: You Are Still in a Hole

  - by ArnieRowland

  OK. So you followed the First Rule of Holes -you stopped digging yourself in deeper. But now what? You are still in a Hole. Your situation has not changed much, but at least you are no longer making it worse. You need to redirect the digging effort into escape and avoidance efforts. The Hole has a singular purpose -consuming all of your time and effort. AND it has succeeded! But now you are going to redirect your efforts for your own survival. You have encountered the Second Rule of Holes: When you...(read more)

  Read the article

• What software do you use to help plan your team work, and why?

  - by Alex Feinman

  Planning is very difficult. We are not naturally good at estimating our own future, and many cognitive biases exacerbate the problem. Group planning is even harder. Incomplete information, inconsistent views of a situation, and communication problems compound the difficulty. Agile methods provide one framework for organizing group planning--making planning visible to everyone (user stories), breaking it into smaller chunks (sprints), and providing retrospective analysis so you get better at planning. But finding good tools to support these practices is proving tricky. What software tools do you use to achieve these goals? Why are you using that tool? What successes have you had with a particular tool?

  Read the article

• What is the best unit test framework for .NET and why?

  - by rmx

  It seems to me that everyone uses NUnit without even considering the other options. I think this is because: Everyone is familiar with it already so they won't have to learn a new API. It is already set up with their continuous integration server to work with NUnit. Am I wrong about this? I decided to use xUnit on one of my own projects recently and I love it! It makes so much more sense to me and conceptually it seems like a definite step forward from NUnit. I'd like to hear opinions on which framework is actually the best - not taking into consideration having to learn it or reconfigure your automated testing.

  Read the article

• How do I get Chromium to show PDFs using Evince?

  - by potofcoffee

  Is there any way to get Chromium to use a mozpluggerrc/evince combination to show PDFs embedded into its own window? Right now, Chromium is just downloading PDFs. I can open them in an external evince window by clicking on the downloaded file. I am using Chrome 18.0.1025.168 under Ubuntu 12.04 (amd64). Here's the pdf section of my /etc/mozpluggerrc.d/62-documents.conf: application/pdf:pdf:PDF file application/x-pdf:pdf:PDF file text/pdf:pdf:PDF file text/x-pdf:pdf:PDF file repeat noisy swallow(evince) fill needs_xembed: evince "$file" mozpluggerrc does show up in about:plugins. BTW, this works just fine in Firefox. Note: I am not looking for hints on how to use Google Chrome's PDF plugin in Chromium.

  Read the article

• Finding the Best Spot in the Microwave [Video]

  - by Jason Fitzpatrick

  Where’s the best spot in the Microwave? In this video we see a neat hands-on demonstration with some LED lights that shows just how the microwave beam in your microwave works. In the above video from Smarter Ever Day they visit the National Electronics Museum and get a first person look at how microwaves work and why nearly every microwave you’ll ever own has a turn table. Best Spot in the Microwave? [YouTube] How to Make and Install an Electric Outlet in a Cabinet or DeskHow To Recover After Your Email Password Is CompromisedHow to Clean Your Filthy Keyboard in the Dishwasher (Without Ruining it)

  Read the article

• Active PPA for latest stable chromium? [closed]

  - by trmpa

  Possible Duplicate: How to install the latest stable version of Chromium? I run chromium and used this PPA: https://launchpad.net/~chromium-daily/+archive/stable I just realized that it seems to be abandoned and I'm running a quite outdated version of this browser. There have not been any updates since the first of May this year. Do you know of any PPA thats actively maintained? Thanks, trmpa (Yes, I know, I could use google chrome but i would like to go with chromium if possible. Building from source is also not a good option. It's not my own machine and I need updates to work reliably without much intervention from the user)

  Read the article

• How can I get started installing Buddycloud software to a hosted site?

  - by rujic

  I'm confused about how one hosts a Buddycloud (federated social networking software) channel. I downloaded the source code, but I'm not sure how to install it on my website. Most of the information seems to assume that the host is running their own server, but I have plain ol' paid web hosting. I know that you also need to set up an XMPP server to run Buddycloud, and I'm not sure how to do that on my hosted website—or if it's even possible. If it matters, my site is hosted on a Linux server through IX Web Hosting. I'd greatly appreciate it if you guys could point me in the right direction.

  Read the article

• Where to put git "remote" repo on purely local git setup?

  - by Mittenchops

  I overwrote and lost some important scripts and would like to setup version control to protect my stuff. I've used git before, and am familiar with commands, but don't understand where I would put my "remote" repository on an install set up on my own machine---the place I push/pull to. I don't intend to share or access remotely, I just want a little source control for my files. I followed the instructions here for setting up my staging area: http://stackoverflow.com/questions/4249974/personal-git-repository But where do I put git "remote" repo on purely local git setup? How does the workflow work then? On the command in the above: git remote add origin ssh://myserver.com:/var/repos/my_repo.git Where should I put/name something like this? If I have multiple different projects, would they go in different places? I'm running 11.10.

  Read the article

• Loading from Multiple Data Sources with Oracle Loader for Hadoop

  - by mannamal

  Oracle Loader for Hadoop can be used to load data from multiple data sources (for example Hive, HBase), and data in multiple formats (for example Apache weblogs, JSON files).   There are two ways to do this: (1) Use an input format implementation.  Oracle Loader for Hadoop includes several input format implementations.  In addition, a user can develop their own input format implementation for proprietary data sources and formats. (2) Leverage the capabilities of Hive, and use Oracle Loader for Hadoop to load from Hive. These approaches are discussed in our Oracle Open World 2013 presentation. 

  Read the article

• When Google AdSense says "Site does not comply with Google policies"?

  - by Danny

  Recently for my website, I received a new kind of email from Google AdSense after trying it for 4 times and solving all the previous disapprove reasons. But from the below message, it seems all my website is okay for getting AdSense. Issues: Site does not comply with Google policies. Further detail: Please provide your own suggestion to solve this issue for my website. I would like to request you not to close this question unless I get an answer. Since 9 months I am strugglling for this. Let some one to reply for my doubt.

  Read the article

• Welcome to our Friday tips series!

  - by Chris Kawalek

  Today we're starting a brand new blog series. For your Friday afternoon reading, we'll be posting a technical tip or question and answer on a technical topic. We'll start by introducing ideas on our own, but we'd really like it if you were involved and asked us questions via Twitter! Tag your tweet with #AskOracleVirtualization and we'll consider your question for the blog. Today's tip is on Storage and Oracle Virtual Desktop Infrastructure: Question: I run Oracle Virtual Desktop 3.4.1 on Solaris and use a local ZFS storage pool.  How should I configure my ZFS ARC cache?  Answer by John Renko, Consulting Developer, Oracle: Oracle recommends about 5G of ARC cache per template in use to achieve up to a 90% disk read offload. Set your ARC min=max to reserve the maximum amount of your remaining memory for your running VMs. In /etc/system: set zfs:zfs_arc_min = 5368709120 set zfs:zfs_arc_max = 5368709120 The amount you need to reserve will depend on your template but this has proven to be a great start for a typical windows 7 VM running productivity applications.

  Read the article

• Rebooting yes, Shutdown no

  - by Chiotis Leonidas

  Hello everyone and thanks in advance. I am new in Ubuntu and have the 12.04 version dual boot with Windows XP. I have the following problem. The laptop can reboot using the reboot option from the menu but it cannot shut down. It starts shutting down, the dots appear but then it freezes and does not turn off. Sometimes it shuts down normally (usually just after an update) but then it loses that capability again. Some strange things, I noticed that when the dots freeze, the USB mouse loses power, BUT the usb-powered cooling pad continues to work The only Fn shortcuts that work all the time are the Volume up, down and mute, BUT sometimes when the other Fn combinations (screen-off etc) work the computer shuts down normally I searched a lot on my own, please help.

  Read the article

• IoC containers and service locator pattern

  - by TheSilverBullet

  I am trying to get an understanding of Inversion of Control and the dos and donts of this. Of all the articles I read, there is one by Mark Seemann (which is widely linked to in SO) which strongly asks folks not to use the service locator pattern. Then somewhere along the way, I came across this article by Ken where he helps us build our own IoC. I noticed that is is nothing but an implementation of service locator pattern. Questions: Is my observation correct that this implementation is the service locator pattern? If the answer to 1. is yes, then Do all IoC containers (like Autofac) use the service locator pattern? If the answer to 1. is no, then why is this differen? Is there any other pattern (other than DI) for inversion of control?

  Read the article

• Who makes laptops for Ubuntu?

  - by Tim Lytle

  I'm looking for a laptop and would like to avoid the whole 'is this [specific configuration of hardware] compatible with Ubuntu?' process by finding a laptop manufactured with Ubuntu in mind. I know of system76, but are there any other manufacturers making laptops built to run a standard build of Ubuntu? I'm not counting Dell, as - from my experience - their 'Ubuntu' laptops/netbooks require their build, and because of that have their own set of compatibility issues. UPDATE: And as mentioned in the comments, Dell is no longer selling systems with Ubuntu to consumers.

  Read the article

• How to shrink Windows partition with unmovable files in dual boot installation

  - by Tim

  To install Ubuntu alongside Windows 7, I have to shrink Windows 7 partition C:. But due to some unmovable files, I cannot shrink as much as I plan by using Windows own shrinking tool. I guess many of you who have both OSes on the same hard drive must have similar experience. How to solve this problem? Any reference that can help is also appreciated! Thanks and regards! UPDATE: I have identified what unmovable file currently stop further shrinking: \ProgramData\Microsoft\Search\Data\Applications\Windows\Projects\SystemIndex\Indexer\CiFiles\00010015.wid::$DATA If I understand correctly, the file belongs to Windows Search. Can I set up somewhere in Windows system settings to temperately eliminate the file and similar ones (because there are many similar files under the same directory which I guess will also stand in the way of shrinking and unmovable by defrag)?

  Read the article

• How can I estimate the entropy of a password?

  - by Wug

  Having read various resources about password strength I'm trying to create an algorithm that will provide a rough estimation of how much entropy a password has. I'm trying to create an algorithm that's as comprehensive as possible. At this point I only have pseudocode, but the algorithm covers the following: password length repeated characters patterns (logical) different character spaces (LC, UC, Numeric, Special, Extended) dictionary attacks It does NOT cover the following, and SHOULD cover it WELL (though not perfectly): ordering (passwords can be strictly ordered by output of this algorithm) patterns (spatial) Can anyone provide some insight on what this algorithm might be weak to? Specifically, can anyone think of situations where feeding a password to the algorithm would OVERESTIMATE its strength? Underestimations are less of an issue. The algorithm: // the password to test password = ? length = length(password) // unique character counts from password (duplicates discarded) uqlca = number of unique lowercase alphabetic characters in password uquca = number of uppercase alphabetic characters uqd = number of unique digits uqsp = number of unique special characters (anything with a key on the keyboard) uqxc = number of unique special special characters (alt codes, extended-ascii stuff) // algorithm parameters, total sizes of alphabet spaces Nlca = total possible number of lowercase letters (26) Nuca = total uppercase letters (26) Nd = total digits (10) Nsp = total special characters (32 or something) Nxc = total extended ascii characters that dont fit into other categorys (idk, 50?) // algorithm parameters, pw strength growth rates as percentages (per character) flca = entropy growth factor for lowercase letters (.25 is probably a good value) fuca = EGF for uppercase letters (.4 is probably good) fd = EGF for digits (.4 is probably good) fsp = EGF for special chars (.5 is probably good) fxc = EGF for extended ascii chars (.75 is probably good) // repetition factors. few unique letters == low factor, many unique == high rflca = (1 - (1 - flca) ^ uqlca) rfuca = (1 - (1 - fuca) ^ uquca) rfd = (1 - (1 - fd ) ^ uqd ) rfsp = (1 - (1 - fsp ) ^ uqsp ) rfxc = (1 - (1 - fxc ) ^ uqxc ) // digit strengths strength = ( rflca * Nlca + rfuca * Nuca + rfd * Nd + rfsp * Nsp + rfxc * Nxc ) ^ length entropybits = log_base_2(strength) A few inputs and their desired and actual entropy_bits outputs: INPUT DESIRED ACTUAL aaa very pathetic 8.1 aaaaaaaaa pathetic 24.7 abcdefghi weak 31.2 H0ley$Mol3y_ strong 72.2 s^fU¬5ü;y34G< wtf 88.9 [a^36]* pathetic 97.2 [a^20]A[a^15]* strong 146.8 xkcd1** medium 79.3 xkcd2** wtf 160.5 * these 2 passwords use shortened notation, where [a^N] expands to N a's. ** xkcd1 = "Tr0ub4dor&3", xkcd2 = "correct horse battery staple" The algorithm does realize (correctly) that increasing the alphabet size (even by one digit) vastly strengthens long passwords, as shown by the difference in entropy_bits for the 6th and 7th passwords, which both consist of 36 a's, but the second's 21st a is capitalized. However, they do not account for the fact that having a password of 36 a's is not a good idea, it's easily broken with a weak password cracker (and anyone who watches you type it will see it) and the algorithm doesn't reflect that. It does, however, reflect the fact that xkcd1 is a weak password compared to xkcd2, despite having greater complexity density (is this even a thing?). How can I improve this algorithm? Addendum 1 Dictionary attacks and pattern based attacks seem to be the big thing, so I'll take a stab at addressing those. I could perform a comprehensive search through the password for words from a word list and replace words with tokens unique to the words they represent. Word-tokens would then be treated as characters and have their own weight system, and would add their own weights to the password. I'd need a few new algorithm parameters (I'll call them lw, Nw ~= 2^11, fw ~= .5, and rfw) and I'd factor the weight into the password as I would any of the other weights. This word search could be specially modified to match both lowercase and uppercase letters as well as common character substitutions, like that of E with 3. If I didn't add extra weight to such matched words, the algorithm would underestimate their strength by a bit or two per word, which is OK. Otherwise, a general rule would be, for each non-perfect character match, give the word a bonus bit. I could then perform simple pattern checks, such as searches for runs of repeated characters and derivative tests (take the difference between each character), which would identify patterns such as 'aaaaa' and '12345', and replace each detected pattern with a pattern token, unique to the pattern and length. The algorithmic parameters (specifically, entropy per pattern) could be generated on the fly based on the pattern. At this point, I'd take the length of the password. Each word token and pattern token would count as one character; each token would replace the characters they symbolically represented. I made up some sort of pattern notation, but it includes the pattern length l, the pattern order o, and the base element b. This information could be used to compute some arbitrary weight for each pattern. I'd do something better in actual code. Modified Example: Password: 1234kitty$$$$$herpderp Tokenized: 1 2 3 4 k i t t y $ $ $ $ $ h e r p d e r p Words Filtered: 1 2 3 4 @W5783 $ $ $ $ $ @W9001 @W9002 Patterns Filtered: @P[l=4,o=1,b='1'] @W5783 @P[l=5,o=0,b='$'] @W9001 @W9002 Breakdown: 3 small, unique words and 2 patterns Entropy: about 45 bits, as per modified algorithm Password: correcthorsebatterystaple Tokenized: c o r r e c t h o r s e b a t t e r y s t a p l e Words Filtered: @W6783 @W7923 @W1535 @W2285 Breakdown: 4 small, unique words and no patterns Entropy: 43 bits, as per modified algorithm The exact semantics of how entropy is calculated from patterns is up for discussion. I was thinking something like: entropy(b) * l * (o + 1) // o will be either zero or one The modified algorithm would find flaws with and reduce the strength of each password in the original table, with the exception of s^fU¬5ü;y34G<, which contains no words or patterns.

  Read the article

< Previous Page | 196 197 198 199 200 201 202 203 204 205 206 207  | Next Page >