logic

In my rails 3.1 application, I want to create and expire random password for users.I am using devise gem for that.Any plugin available for expiring password withing some duration? Or else Please give me some logical advice to implement this feature. Please consider me as a newbie. It sounds like you just want to expire the password once. If you're looking to do it at regular intervals (e.g. every couple of months) or if you want to prevent users from re-using passwords, it gets more complicated. Taken from an app I'm working on: app/models/user.rb (assuming that's what you name your model):

How to create dynamic color list for charts Basically i have a different value in my database or each values contain each percentage and i need to show this percentages in pie chart with different colors .... This is the example code of pie chart in static way <color value="#99CDFB"/> <color value="#3366FB"/> <color value="#0000FA"/> <color value="#F8CC00"/> <color value="#F89900"/> <color value="#F76600"/> but i need dynamic way using PHP ( for loop / foreach loop ) like this $color = ""; foreach($data as $data){ echo '<color value=".$color."/>'; } and i don't know to create dynamic color

my problem is that we try to use a MVC (PHP) framework. After discussing a lot think that MVC is very good, but I'm missing the possibility to write reusable model-(application)logic. So, I'm not sure if we have the right approach to implement our software in a MVC framework. First I´ll describe the non-MVC, oo-approach which we use at the moment. For example - we are working on some browser games (yes that's our profession). Imagine we have an player object. We use this player object very often. We have some different pages where you can buy thinks, so you need to make "money" transactions on

Problem Statement: On a positive integer, you can perform any one of the following 3 steps. Subtract 1 from it. ( n = n - 1 ) If its divisible by 2, divide by 2. ( if n % 2 == 0 , then n = n / 2 ) If its divisible by 3, divide by 3. ( if n % 3 == 0 , then n = n / 3 ) Given a positive integer n and you task is find the minimum number of steps that takes n to one . My Recursive Solution (in C++) compares all the 3 cases when N is divisible by 3, while the general solution compares only 2, but still gives the correct solution. int min_steps(int N){ if(N==1) return 0; else{ if(N%3==0){ if(N%2==0)

I am programming my first real PHP website and am wondering how to make my code more readable to myself. The reference book I am using is PHP and MySQL Web Development 4th ed. The aforementioned book gives three approaches to separating logic and content: include files function or class API template system I haven't chosen any of these yet, as wrapping my brains around these concepts is taking some time. However, my code has become some hybrid of the first two as I am just copy-pasting away here and modifying as I go. On presentation side, all of my pages have these common elements: header,

I'm setting something up to SSH out to several servers in 'batches'. I basically want to maintain 5 connections at a time, and when one finishes open up another (following an array of server IPs). I'm wondering for something like this should I be using fork() ? If so, what logic can I use to ensure that the I maintain 5 children at a time? kbenson Forking (or threading) is what you want, but you should look at CPAN for modules that will provide most of what you need to prevent you from reinventing the wheel and going through the learning pains of what you need to do. For example, Parallel:

I have complex logical expression that look like this: ((((!((cond1) || (cond2) || (cond3)) && (cond4))) && (cond5)) <= (((cond6) || (cond7) || (cond8)) || (cond9))) Each line has several dozens of expressions. The allowed logical signs are || , && , ! and <= . <= means leads, as in a <= b means that b leads to a. I need to go over those statements and check the conditions, since some of them are no longer valid. I want to be able to parse it to a tree, then check each of it leafs (where each leaf is a condition), delete the unwanted leafs and build the full and correct expressions back. I