Search Results

Search found 281 results on 12 pages for 'discrete'.

Page 6/12 | < Previous Page | 2 3 4 5 6 7 8 9 10 11 12  | Next Page >

  • How to prepare for the GRE Computer Science Subject Test?

    - by Maddy.Shik
    How do I prepare for the GRE Computer Science subject test? Are there any standard text books I should follow? I want to score as competitively as possible. What are some good references? Is there anything that top schools like CMU, MIT, and Standford would expect? For example, Cormen et al is considered very good for algorithms. Please tell me standard text books for each subject covered by the test, like Computer Architecture, Database Design, Operating Systems, Discrete Maths etc.

    Read the article

  • Oracle sort précipitamment OpenOffice 3.3, 24 heures après l'arrivée de LibreOffice 3.3

    Oracle sort précipitamment OpenOffice 3.3, 24 heures après l'arrivée de LibreOffice 3.3 Mise à jour du 28.01.2011 par Katleen Oracle vient de sortir la version 3.3 de sa suite bureautique libre OpenOffice.org. Cette mise à disposition du public à presque été passée sous silence tant elle fut discrète. Elle semble avoir été précipitée et pas très bien organisée. Quoiqu'il en soit, cette nouvelle mouture ( tournant sous Windows, Linux -x86 32 bits et 64 bits-,Mac OS X -x86 et PowerPC- et Solaris -x86 et SPARC-). apporte plusieurs nouveautés : - renforcement de la protection des documents du tableur et du traitement de texte - possibilité de gére...

    Read the article

  • wubi install of ubuntu 12.10 on hp dv6 6154tx causes uncontrolled heating, fan speed, low battery life

    - by kansi
    i have a hp dv6 6154tx with an integrated Intel GPU and a discrete ATI GPU (Radeon Mobility HD 6490M (1 GB DDR5)). -Problems: when i install ubuntu 12.10 using wubi, my laptop starts heating, fans start to run fast (to much of noise), and battery goes really low Any attempt to install catalyst drivers (from ati official site and also proprietary drivers) fails , as after reboot when i login everything is gone like no unity no desktop and sometimes black screen appears. even bumblebee and jupiter didnt help.... :( So PLEASE, PLEASE can somebody post the real solution to my problems i.e.(inc battery life and stop fan noise and heating). (i want to install ubuntu only using wubi)

    Read the article

  • How to use only intel graphics and power off radeon?

    - by luizrogeriocn
    I've been using Linux for quite a while in everyday computing and programming. But now i got this new laptop with amazing battery life on windows which runs pretty cool even while gaming. But for some reason on Ubuntu I get like 1/3 battery life and it gets hot even while browsing the web. I have the proprietary drivers for radeon, but I'm thinking about upgrading from Ubuntu 12.04 to 14.04, and I would like to know how can I use only the Intel graphics and have radeon always turned off? Since I do not need the discrete graphics on Ubuntu and I'm pretty sure my problem is related to the radeon sucking up my battery and generating heat. My laptop technical specifications are: Dell latitude 3540 Intel core i7 4500U (with Intel hd4400 graphics ) Ati Radeon HD 8850m with 2GB GDDR5 VRAM 8 GB DDR3L @1600mhz Toshiba 256gb SSD Ubuntu 12.4.3 If you need any additional info, please tell me :)

    Read the article

  • Google s'offre une nouvelle interface, et optimise l'intelligence de ses recherches

    Google s'offre une nouvelle interface, et optimise l'intelligence de ses recherches Google s'est offert un lifting de printemps. La page d'accueil du moteur de recherche et si sobre et discrète que le moindre changement n'y passe pas inaperçu. Depuis aujourd'hui, Google.com a une nouvelle présentation. A côté d'un logo aux couleurs plus vives, le site se divise en trois panneaux : à gauche, les options ; au centre, les résultats ; et à droite, la publicité. L'onglet des options, d'habitude caché par défaut, est mis en avant. Un moyen de pousser les internautes à tester ces filtres de recherche qui ne sont pas nouveaux, mais encore trop méconnus du grand public. Par exemple, "update" : la recherche en temps...

    Read the article

  • YouSendIt Alternative?

    - by user4855
    Looking for a reasonably priced alternative to YouSendIt's exorbitant pricing for an embedded, unbranded (i.e. no "Uploads by SomeCompany" or at the very least, discrete, subtle co-branding) file upload solution for my client's print shop Website. To do what we want to do with YouSendIt, we're looking at a corporate account of $995 USD plus $29.99 USD monthly fee, that is only sold pro-rated, so you have to buy the entire year's worth. To me, this is just unacceptable considering the commodity pricing of storage and bandwidth nowadays. For data, we're looking at roughly 10MB per upload, with perhaps 250-1000 uploads per month, with transient data storage of no more than 30 days (and more than likely 1-2 business days) for a total of 10 GB transfer (upload) and 10 GB transfer (download, to the print shop) at the very max each month. Any ideas? Everything I've found through searching seems to be geared more towards personal file sharing and not for embedding into Websites. Thanks

    Read the article

  • Which is the best low/mid level GPU in terms of compatibility for 12.04 and 12.10?

    - by Ghost
    I'm tired of dealing with the disaster that is catalyst on a 4xxx IGP and I want to buy some discrete graphics that support both Unity and alternative environments like GNOME3 and Mate-Cinnamon without getting sluggish. Besides that, 1080p video and some light 3D gaming. Again nothing crazy, I'm not a designer and I wont be using stuff like Blender. One thing I want to make clear is that I want a GPU that is 100% compatible, that means no bugs, no glitches, not having to toggle between propietary and Xorg because it decided to crapout on me. Thanks for your help

    Read the article

  • Can I randomly generate an endless road?

    - by y26jin
    So suppose we stand on a position(x0, y0) of a map. We can only move on the horizontal plane(no jump and stuff) but we can move forward, left, or right (in a discrete math way, i.e. integer movement). As soon as we move to the next position(x1, y1), everything around us is generated randomly by a program. We could be surrounded by one of mountain, lake, and road. We can only move on the road. The road is always 2D as the map itself. My question is, are we able to play this game endlessly? "End" means that we come across a dead end and the only way out is to go backward.

    Read the article

  • Silverlight : vers une fin programmée ? Microsoft ferme Silverlight.net, le site de référence sur la technologie

    Silverlight : vers une fin programmée ? Microsoft ferme Silverlight.net, le site de référence sur la technologie L'avènement du HTML5 a mis en mal les technologies de développement d'applications Web riches (RIA) comme Silverlight et Flash. Voici aujourd'hui pratiquement un an que Microsoft a publié Silverlight 5. Depuis, l'éditeur n'a plus fait mention d'une évolution de la technologie en dehors de la sortie discrète d'une mise à jour mineure (Silverlight 5.1). [IMG]http://idelways.developpez.com/news/images/silverlight-logo.jpg[/IMG] Par contre, Microsoft accorde une attention particulière à HTML5, qui occupe une place de...

    Read the article

  • Regex to repeat a capture across a CDL?

    - by richardtallent
    I have some data in this form: @"Managers Alice, Bob, Charlie Supervisors Don, Edward, Francis" I need a flat output like this: @"Managers Alice Managers Bob Managers Charlie Supervisors Don Supervisors Edward Supervisors Francis" The actual "job title" above could be any single word, there's no discrete list to work from. Replacing the ,  with \r\n is easy enough, as is the first replacement: Replace (^|\r\n)(\S+\s)([^,\r\n]*),\s With $1$2$3\r\n$2 But capturing the other names and applying the same prefix is what is eluding me today. Any suggestions?

    Read the article

  • Mercurial Queues: combining patches

    - by Eamon Nerbonne
    I've been playing with Mercurial and mercurial queues, and now have a fairly reasonable working version. However, before I submit a patch, I'd like to take that spagetti-history and merge it into discrete, logical steps, rather than the semi-overlapping repeated do-undo-redo-slightly-differently mess it is now, if only to reduce the number of patches. How do I do that?

    Read the article

  • How do I add older versions of code into a Subversion repository as tagged versions

    - by TheoJones
    When we finally started using source control, old versions of code were added into the SVN in their own discrete folders, so I ended up with root \libv4 \libv4.2 \lib4.3 \lib5 What I would like to get to is having these older versions of the code as tagged versions inside the repository, like this: root \lib \tags \v4 \v4.2 \v4.3 \v5.0 \trunk how would I go about doing this? I'm using Tortoise SVN on the client side, and visualSVN server at the back.

    Read the article

  • Edge detection using wavelet

    - by cheoma
    I had done Edge detection using wavelet transform using thus steps changing the image to Gray scale decomposing the image using dwt2(discrete wavelet transform,Haar wavelet filter ) in to horizontal,vertical,diagonal and approximation(detail) further decomposing the horizontal part threshold (global threshold like canny Edge detection ) i got the edge but i got a problem while locating the edge to complete image to mean recovering original image using only the Edges so i need help concerning this either in concept ,mat lab code or references I hope i will get your help soon

    Read the article

  • Discarding several log levels within a range with log4net

    - by Harel Moshe
    Hey, Say i set my log4net logger's minLevel and maxLevel to FATAL and DEBUG respectively, but under some scenario i want to mute the log-items written in the WARN level, and keep all the other levels in the range active. Is it possible to somehow use 'discrete' levels of log-levels rather than specifying a range using minLevel and maxLevel? I assume this should be simple, but i haven't found any log4net docs or examples dealing with this issue. Regards, Harel

    Read the article

  • Datatypes for physics

    - by Juan Manuel Formoso
    Hi, I'm currently designing a program that will involve some physics (nothing too fancy, a few balls crashing to each other) What's the most exact datatype I can use to represent position (without a feeling of discrete jumps) in c#? Also, what's the smallest ammount of time I can get between t and t+1? One tick? EDIT: Clarifying: What is the smallest unit of time in C#? [TimeSpan].Tick?

    Read the article

  • Drawing performance in Java 6 updates 19,20 versus Java 6 update 3 ?

    - by Pesho
    I'm getting twice the frame rate with the earlier Java 6 u 3, than with the new ones. Very weird. Can anyone give some explanation? On Core 2 Duo 1.83ghz, integrated video (only one core is used) - 1500 (older java) vs 700 fps On Athlon 64 3500+, discrete video - 120 (older java) vs 55 fps The app is a simple game with a moving rectangle. I'm using Graphics2D to draw from a loop.

    Read the article

  • CS Majors: Hardest concept(s) you learned in school?

    - by Mark Lubin
    For the CS majors out there what were the hardest CS classes or concepts that you learned in your undergraduate schooling? Did you find once you learned the basics,(data structs, OOP fundamentals, discrete math, pointers, recursion, etc) the rest followed naturally or did you hit a wall at any point in your higher classes like OS'es and Compilers? Thanks for the input!

    Read the article

  • Get spiral index from location

    - by ricick
    I'm using Alberto Santini's solution to this question to get a spiral grid reference based on an items index Algorithm for iterating over an outward spiral on a discrete 2D grid from the origin It's not the accepted solution, but it's the best for my needs as it avoids using a loop. It's working well, but what I want now is to do the inverse. Based on a known x and y coordinate return the index of a location. This is as a precursor to returning the items surrounding a given location.

    Read the article

  • Analytic functions – they’re not aggregates

    - by Rob Farley
    SQL 2012 brings us a bunch of new analytic functions, together with enhancements to the OVER clause. People who have known me over the years will remember that I’m a big fan of the OVER clause and the types of things that it brings us when applied to aggregate functions, as well as the ranking functions that it enables. The OVER clause was introduced in SQL Server 2005, and remained frustratingly unchanged until SQL Server 2012. This post is going to look at a particular aspect of the analytic functions though (not the enhancements to the OVER clause). When I give presentations about the analytic functions around Australia as part of the tour of SQL Saturdays (starting in Brisbane this Thursday), and in Chicago next month, I’ll make sure it’s sufficiently well described. But for this post – I’m going to skip that and assume you get it. The analytic functions introduced in SQL 2012 seem to come in pairs – FIRST_VALUE and LAST_VALUE, LAG and LEAD, CUME_DIST and PERCENT_RANK, PERCENTILE_CONT and PERCENTILE_DISC. Perhaps frustratingly, they take slightly different forms as well. The ones I want to look at now are FIRST_VALUE and LAST_VALUE, and PERCENTILE_CONT and PERCENTILE_DISC. The reason I’m pulling this ones out is that they always produce the same result within their partitions (if you’re applying them to the whole partition). Consider the following query: SELECT     YEAR(OrderDate),     FIRST_VALUE(TotalDue)         OVER (PARTITION BY YEAR(OrderDate)               ORDER BY OrderDate, SalesOrderID               RANGE BETWEEN UNBOUNDED PRECEDING                         AND UNBOUNDED FOLLOWING),     LAST_VALUE(TotalDue)         OVER (PARTITION BY YEAR(OrderDate)               ORDER BY OrderDate, SalesOrderID               RANGE BETWEEN UNBOUNDED PRECEDING                         AND UNBOUNDED FOLLOWING),     PERCENTILE_CONT(0.95)         WITHIN GROUP (ORDER BY TotalDue)         OVER (PARTITION BY YEAR(OrderDate)),     PERCENTILE_DISC(0.95)         WITHIN GROUP (ORDER BY TotalDue)         OVER (PARTITION BY YEAR(OrderDate)) FROM Sales.SalesOrderHeader ; This is designed to get the TotalDue for the first order of the year, the last order of the year, and also the 95% percentile, using both the continuous and discrete methods (‘discrete’ means it picks the closest one from the values available – ‘continuous’ means it will happily use something between, similar to what you would do for a traditional median of four values). I’m sure you can imagine the results – a different value for each field, but within each year, all the rows the same. Notice that I’m not grouping by the year. Nor am I filtering. This query gives us a result for every row in the SalesOrderHeader table – 31465 in this case (using the original AdventureWorks that dates back to the SQL 2005 days). The RANGE BETWEEN bit in FIRST_VALUE and LAST_VALUE is needed to make sure that we’re considering all the rows available. If we don’t specify that, it assumes we only mean “RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW”, which means that LAST_VALUE ends up being the row we’re looking at. At this point you might think about other environments such as Access or Reporting Services, and remember aggregate functions like FIRST. We really should be able to do something like: SELECT     YEAR(OrderDate),     FIRST_VALUE(TotalDue)         OVER (PARTITION BY YEAR(OrderDate)               ORDER BY OrderDate, SalesOrderID               RANGE BETWEEN UNBOUNDED PRECEDING                         AND UNBOUNDED FOLLOWING) FROM Sales.SalesOrderHeader GROUP BY YEAR(OrderDate) ; But you can’t. You get that age-old error: Msg 8120, Level 16, State 1, Line 5 Column 'Sales.SalesOrderHeader.OrderDate' is invalid in the select list because it is not contained in either an aggregate function or the GROUP BY clause. Msg 8120, Level 16, State 1, Line 5 Column 'Sales.SalesOrderHeader.SalesOrderID' is invalid in the select list because it is not contained in either an aggregate function or the GROUP BY clause. Hmm. You see, FIRST_VALUE isn’t an aggregate function. None of these analytic functions are. There are too many things involved for SQL to realise that the values produced might be identical within the group. Furthermore, you can’t even surround it in a MAX. Then you get a different error, telling you that you can’t use windowed functions in the context of an aggregate. And so we end up grouping by doing a DISTINCT. SELECT DISTINCT     YEAR(OrderDate),         FIRST_VALUE(TotalDue)              OVER (PARTITION BY YEAR(OrderDate)                   ORDER BY OrderDate, SalesOrderID                   RANGE BETWEEN UNBOUNDED PRECEDING                             AND UNBOUNDED FOLLOWING),         LAST_VALUE(TotalDue)             OVER (PARTITION BY YEAR(OrderDate)                   ORDER BY OrderDate, SalesOrderID                   RANGE BETWEEN UNBOUNDED PRECEDING                             AND UNBOUNDED FOLLOWING),     PERCENTILE_CONT(0.95)          WITHIN GROUP (ORDER BY TotalDue)         OVER (PARTITION BY YEAR(OrderDate)),     PERCENTILE_DISC(0.95)         WITHIN GROUP (ORDER BY TotalDue)         OVER (PARTITION BY YEAR(OrderDate)) FROM Sales.SalesOrderHeader ; I’m sorry. It’s just the way it goes. Hopefully it’ll change the future, but for now, it’s what you’ll have to do. If we look in the execution plan, we see that it’s incredibly ugly, and actually works out the results of these analytic functions for all 31465 rows, finally performing the distinct operation to convert it into the four rows we get in the results. You might be able to achieve a better plan using things like TOP, or the kind of calculation that I used in http://sqlblog.com/blogs/rob_farley/archive/2011/08/23/t-sql-thoughts-about-the-95th-percentile.aspx (which is how PERCENTILE_CONT works), but it’s definitely convenient to use these functions, and in time, I’m sure we’ll see good improvements in the way that they are implemented. Oh, and this post should be good for fellow SQL Server MVP Nigel Sammy’s T-SQL Tuesday this month.

    Read the article

  • Best software for taking math notes at lectures

    - by data_jepp
    Let me first just say that I know about La-Tex, and that doesn't fast enough. I use it for papers, but for "real-time" note taking it's just to heavy. I'm talking two math classes this semester. Linear algebra and discrete math, I just got a laptop with 10 hour battery life which makes me want to take notes on it!!! Openoffice with formula thingy is what I use now. Now I have to pay attention lol. Thanks.

    Read the article

  • Prove this Tautology (No Truth Tables)

    - by FSM
    This is for homework for my Discrete Math class. I understand how to prove tautologies with a truth table. I'm having trouble figuring out how to do it without though. I found this example in our text, but the solution is not provided. I was hoping someone could answer it as best they could so I could apply it to my other questions. Thanks! ! = not/invert ^ = and V = or - = if then [!P ^ (P V Q) ] - Q I also am completely lost for this question (I fear I'll be tested on something of this difficulty) [ (P - Q) ^ (Q - R) ] - (P - R) Thanks for the help all!

    Read the article

  • How do I calculate the amount of tuning needed for my server ?

    - by Low Kian Seong
    I have a server which is running a few discrete Python, Java application which most of the time imports data into a PostGreSQL database. I would like to know from people out there who have experience tuning enterprise grade servers how do i go about calculating in a holistic way the amount of tuning needed for my server for example vm.swappiness, vm.overcommit_ratio and other numerical tunings needed for my server. I tried to enable sar on my server to capture daily numbers but these are more along the lines of total numbers and I can't figure out how to allocate memory for my applications. Help would be appreciated. Thanks.

    Read the article

< Previous Page | 2 3 4 5 6 7 8 9 10 11 12  | Next Page >