Search Results

Search found 922 results on 37 pages for 'linear'.

Page 26/37 | < Previous Page | 22 23 24 25 26 27 28 29 30 31 32 33  | Next Page >

• Preallocate memory for a program in Linux before it gets started

  - by Fyg

  Hi, folks, I have a program that repeatedly solves large systems of linear equations using cholesky decomposition. Characterising is that I sometimes need to store the complete factorisation which can exceed about 20 GB of memory. The factorisation happens inside a library that I call. Furthermore, this matrix and the resulting factorisation changes quite frequently and as such the memory requirements as well. I am not the only person to use this compute-node. Therefore, is there a way to start the program under Linux and preallocate free memory for the process? Something like: $: prealloc -m 25G ./program

  Read the article

• [C++] Is it possible to use threads to speed up file reading ?

  - by Mister Mystère

  Hi there, I want to read a file as fast as possible (40k lines) [Edit : the rest is obsolete]. Edit: Andres Jaan Tack suggested a solution based on one thread per file, and I want to be sure I got this (thus this is the fastest way) : One thread per entry file reads it whole and stocks its content in a container associated (- as many containers as there are entry files) One thread calculates the linear combination of every cell read by the input threads, and stocks the results in the exit container (associated to the output file). One thread writes by block (every 4kB of data, so about 10 lines) the content of the output container. Should I deduce that I must not use m-mapped files (because the program's on standby waiting for the data) ? Thanks aforehand. Sincerely, Mister mystère.

  Read the article

• How to change ScrollView's position after touch?

  - by Matt

  I'm trying to make a ScrollView with a list of numbers in it that the user can select from. After the user touches and scrolls, after the finger is lifted I want the scroll to "snap" to the item in the middle of the ScrollView and give me the output. My ScrollView contains a vertical linear layout with TextView objects in it. The ScrollView's vertical size is about 60sp. I think this would involve the ScrollView.onTouch with a ACTION_UP, but I don't know how to use it. Also, is there a way to get an item's index or value based on a position in the list? Thanks!

  Read the article

• dynamically changing the selector text

  - by kelly

  I have a 'next' button which fades out a div, shows another, changes out a graphic and then... I want it to change the actual ID of the 'next' button but neither .html nor replaceWith seem to be working. I have this: $(document).ready(function(){ $('#portfolio').fadeTo(500,0.25); $('#account') .animate({width:"10.1875em",height:"11.1875em",duration:'medium'}); $('#next2_btn').click(function(){ $('#content').fadeTo(300, 0.0, function() { $('#content2').show(300, function() { $('#next2_btn').$('#next2_btn'.value).html('<area shape="rect" coords="826,935,906,971" id="next3_btn" href="#">') $('#account').fadeTo(500,1.0) .animate({marginLeft:"220px", width:"2em",'height' :"2em",duration:'medium'}) .animate({     marginLeft:"400px",     marginTop:"35px",     width:"7em",     height:"7em", duration:"medium"     }, 'medium', 'linear', function() {     $('#statusGraphic').replaceWith('<img src="state2_138x28.gif">');     }) .fadeTo(500,0.5); $('#portfolio') .fadeTo(500,1.5) .animate({marginLeft:"-175px", width:"2em",height:"2.5em",duration:'medium'}) .animate({marginLeft:"-330px", width:"8.5em",height:"9.9375em",duration:'medium'}); }); }) })

  Read the article

• MongoDB efficient dealing with embedded documents

  - by Sebastian Nowak

  I have serious trouble finding anything useful in Mongo documentation about dealing with embedded documents. Let's say I have a following schema: { _id: ObjectId, ... data: [ { _childId: ObjectId // let's use custom name so we can distinguish them ... } ] } What's the most efficient way to remove everything inside data for particular _id? What's the most efficient way to remove embedded document with particular _childId inside given _id? What's the performance here, can _childId be indexed in order to achieve logarithmic (or similar) complexity instead of linear lookup? If so, how? What's the most efficient way to insert a lot of (let's say a 1000) documents into data for given _id? And like above, can we get O(n log n) or similar complexity with proper indexing? What's the most efficient way to get the count of documents inside data for given _id?

  Read the article

• Can't load AMD 64-bit .dll on a IA 32-bit platform

  - by Guihua

  I download the Gurobi package for linear programming. I import the corresponding gurobi.jar package. Then run the example program. Then it appears the following errors: Exception in thread "main" java.lang.UnsatisfiedLinkError: C:\gurobi460\win64\win64\bin\GurobiJni46.dll: Can't load AMD 64-bit .dll on a IA 32-bit platform Then I downloaded the window 64 bit Jre, and use the "window--preference--Installed JRE" to install this new JRE. However, it still appeared this error. Could you help me? Thank you !

  Read the article

• Why do MSTests Assert.AreEqual(1.0, double.NaN, 0.0) pass?

  - by Egil Hansen

  Short question, why do Assert.AreEqual(1.0, double.NaN, 0.0) pass when Assert.AreEqual(1.0, double.NaN) do not? Is it an error in MSTest or am I missing something here? Best regards, Egil. Update: Should probably add, that the reason behind my question is, that I have a bunch of unit tests that unfortunately passed due to the result of some linear algebraic matrix operation being NaN or (+/-)Infinity. The unit tests are fine, but since Assert.AreEqual on doubles with a delta will pass when actual or/and expected are NaN or Infinity, I was left to believe that the code I was testing was correct.

  Read the article

• ActionScript Drawing Gradient Line With Transparency

  - by TheDarkIn1978

  i'm attempting to draw a simple gradient line with some transparency, but the portion of the line that receives 0 for the alpha draws black. var lineMatrix:Matrix = new Matrix(); lineMatrix.createGradientBox(500, 1); var line:Sprite = new Sprite(); line.graphics.lineStyle(1, 0, 1, false, LineScaleMode.NONE, CapsStyle.NONE); line.graphics.lineGradientStyle(GradientType.LINEAR, [0XFF0000, 0, 0xFF0000], [1, 0, 1], [0, 127, 255], lineMatrix); line.graphics.moveTo(0, 0); line.graphics.lineTo(500, 0); addChild(line); what am i doing wrong?

  Read the article

• My image does not load on a jQuery fade in effect even though the div loads.

  - by Konstantin

  jQuery(document).ready(function() { if (useMSIE){ pngfixALL(); }; jQuery(div).show(data_fadeInEffect, 500);return false; // jQuery(div).animate({opacity:1}, 500, 'linear'); }); This is what I have for a fade in effect. When using animate(), the image in the div tag fades in fine. However, when I use show(), the div loads because I can click in that area, but the image itself doesn't load. Why is this happening? I have another area of the code where I click on an 'x' in the image and it fades out using hide(). This works fine.

  Read the article

• Buttons with equal heights.

  - by Rpond

  Linear layout below. This layout is aligned parent bottom in a Relative Layout. Problem is I want all buttons to have the same height. I have tried layout_gravity="fill" but that doesn't seem to work. <LinearLayout android:id="@+id/button_layout" android:layout_height="wrap_content" android:layout_width="fill_parent" android:background="#FFFFFF" android:layout_alignParentBottom="true"> <Button android:text="Send" android:id="@+id/send_button" android:layout_weight="1" android:layout_gravity="fill" android:layout_width="0dip" android:layout_height="wrap_content"> </Button> <Button android:text="Report Missing Image" android:id="@+id/report_button" android:layout_weight="1" android:layout_width="0dip" android:layout_height="wrap_content"> </Button> <Button android:text="Close" android:id="@+id/close_button" android:layout_weight="1" android:layout_gravity="fill" android:layout_width="0dip" android:layout_height="wrap_content"> </Button> </LinearLayout>

  Read the article

• create a dataset by using modulo division method

  - by ayoom

  create a dataset with 101 integers. Use the modulo division method of hashing to store the random data values into hash tables with table sizes of 7, 51, and 151. Use the linear probing and quadratic method of collision resolution. Print out the tables after the data values have been stored. Search for 10 different values in each of the three hash tables, counting the number of comparisons necessary. Print out the number of comparisons necessary in each case, in tabular form.

  Read the article

• Distance between hyperplanes

  - by michael dillard

  I'm trying to teach myself some machine learning, and have been using the MNIST database (http://yann.lecun.com/exdb/mnist/) do so. The author of that site wrote a paper in '98 on all different kinds of handwriting recognition techniques, available at http://yann.lecun.com/exdb/publis/pdf/lecun-98.pdf. The 10th method mentioned is a "Tangent Distance Classifier". The idea being that if you place each image in a (NxM)-dimensional vector space, you can compute the distance between two images as the distance between the hyperplanes formed by each where the hyperplane is given by taking the point, and rotating the image, rescaling the image, translating the image, etc. I can't figure out enough to fill in the missing details. I understand that most of these are indeed linear operators, so how does one use that fact to then create the hyperplane? And once we have a hyperplane, how do we take its distance with other hyperplanes?

  Read the article

• How to color a mesh with values at the vertices in WPF 3D?

  - by Christo

  We've got a sphere which we want to display in 3D and color given a fuction that depends on spherical coordinates. The sphere was triangulated using a regular grid in (theta, phi), but this produced a lot of small triangles near the poles. In an attempt to reduce the number triangles at the poles, we've changed out mesh generation to produce more evenly sized triangles over the surface. The first triangulation method had the advantage that we could easily create a texture and drape it over the surface. It seems that in WPF it isn't possible to assign colors to vertices the way one would go about in OpenGL or Direct3D. With the second triangulation method it isn't apparent how to go about generating the texture and setting the texture coordinates, since the vertices aren't aligned to a grid anymore. Maybe it would be possible to create a linear texture containing a color for each vertex, but then how will that effect the coloring? Will it still render smoothly over the triangle surfaces as one would expect by applying per vertex coloring?

  Read the article

• Background-image and background in 1 tag

  - by teepusink

  Hi, Is it possible to have both background-image and background gradient color applied together in 1 div tag? (CSS3 and above is ok) I have the below code, the gradient background color does show up, but the background-image doesn't. What am I missing? <div style="background: -webkit-gradient(linear, left top, left bottom, from(#595959), to(#2e2e2e));border-bottom:1px solid #636363;height:39px;-moz-border-radius-bottomleft:0px;-webkit-border-bottom-left-radius: 0px;-moz-border-radius-topright:10px;-webkit-border-top-right-radius: 10px;background-image:url('/uploads/image1.jpg') no-repeat;-moz-border-radius-bottomleft:0px;-webkit-border-bottom-left-radius: 0px;-moz-border-radius-topright:10px;-webkit-border-top-right-radius: 10px;-webkit-background-size: 33px 33px"></div> Thanks, Tee

  Read the article

• How to implement B+ Tree for file systems ?

  - by user312544

  I have a text file which contains some info on extents about all the files in the file system, like below C:\Program Files\abcd.txt 12345 100 23456 200 C:\Program Files\bcde.txt 56789 50 26746 300 ... Now i have another binary which tries to find out about extents for all the files. Now currently i am using linear search to find extent info for the files in the above mentioned text file. This is a time consuming process. Is there a better way of coding this ? Like Implementing any good data structure like BTree. If B+ Tree is used what is the key, branch factor i need to use ?

  Read the article

• PyPy: What is all the buzz about?

  - by sub

  Note: The title is provocating (to make you click on it and want to close-vote the question) and I don't want to look preoccupated. Since some time now I read and heard more and more about PyPy. It's like a linear graph. Why is PyPy so special? As far as I know implementations of dynamic languages written in the languages itself aren't such a rare thing, or am I not getting something? Some even people call PyPy "the future" [of python], or see some sort of deep potential in this implementation. What exactly is the meaning of this?

  Read the article

• Instantaneous frequency not plotting correctly in Matlab

  - by user2951069

  I'm trying to convert square wave data to instantaneous frequency and plot against time. It works correctly for one data set, but three others are plotting as shown in the image: http://i.imgur.com/iuL648o.png Time is linear, so it shouldn't be plotting like that. Anyone have any ideas as to what's going on? I'm using the following code: ddiff = diff(flow(:,1)); locations = find(ddiff(1:end-1,1)>0.1 & ddiff(2:end,1) <=0.1); for z = 2:length(locations) inst_freq(z-1) = 1/(time(locations(z))-time(locations(z-1))); freq_time(z-1) = time(locations(z)); end plot(freq_time,inst_freq)

  Read the article

• What's the deal with all of the abstract stuff?

  - by JustVenting

  I see a lot of talk about MVVM, MVC, Design Patterns etc... You know, some guy has a blog, and he spent the last six months learning about one these things and desiging a program centered around that concept and then he goes on and on about it like its better than sliced bread. I read all of this crap and I wonder, whatever happened to simple logical programming? Not self-absorbed huge frameworks of design patterns and mvc and whatever else you can think of... just simple linear programming, perhaps a few classes to encapsulate things here and there.

  Read the article

• Android: how do i custom arrange menu items?

  - by mtmurdock

  I would like to arrange the menu items in my app so that one item appears in its own line, and the other 3 items appear below it. I know that this is possible because i have seen apps do it. I tried writing a menu xml with linear layouts to arrange the items, but this doesnt work. I have also tried putting them in different groups, but I had no luck with that either. I know that this is possible: i have seen it done. Anyone have any ideas?

  Read the article

• Layout Drawer doesn't add new view in a new line

  - by user547995

  Hy!! If i want to add a textview and a textedit, both are in the same line I have a Linear Layout <?xml version="1.0" encoding="utf-8"?> <LinearLayout xmlns:android="http://schemas.android.com/apk/res/android" android:layout_width="wrap_content" android:layout_height="wrap_content"> <TextView android:text="@+id/TextView01" android:id="@+id/TextView01" android:layout_width="wrap_content" android:layout_height="wrap_content"></TextView> <EditText android:text="@+id/EditText01" android:id="@+id/EditText01" android:layout_width="wrap_content" android:layout_height="wrap_content"></EditText> </LinearLayout> What i have made wrong?

  Read the article

• Which parallel sorting algorithm has the best average case performance?

  - by Craig P. Motlin

  Sorting takes O(n log n) in the serial case. If we have O(n) processors we would hope for a linear speedup. O(log n) parallel algorithms exist but they have a very high constant. They also aren't applicable on commodity hardware which doesn't have anywhere near O(n) processors. With p processors, reasonable algorithms should take O(n/p log n/p) time. In the serial case, quick sort has the best runtime complexity on average. A parallel quick sort algorithm is easy to implement (see here and here). However it doesn't perform well since the very first step is to partition the whole collection on a single core. I have found information on many parallel sort algorithms but so far I have not seen anything pointing to a clear winner. I'm looking to sort lists of 1 million to 100 million elements in a JVM language running on 8 to 32 cores.

  Read the article

• How to add padding for background image

  - by michael

  Hi, I have a linear layout which has a background image (a 9 patched png file). How can I add padding to left and right so that the background image does not take up the whole width? I have tried 'android:paddingLeft' and 'android:paddingRight', but that does not change anything. <LinearLayout xmlns:android="http://schemas.android.com/apk/res/android" android:orientation="horizontal" android:layout_width="fill_parent" android:layout_height="fill_parent" android:paddingLeft="25dip" android:paddingRight="25dip" android:background="@drawable/background"> The whole background still stretches the whole screen width. Thank you for any help.

  Read the article

• Extract elements from list based on object property type

  - by Dustin Digmann

  Often, I have a list of objects. Each object has properties. I want to extract a subset of the list where a specific property has a predefined value. Example: I have a list of User objects. A User has a homeTown. I want to extract all users from my list with "Springfield" as their homeTown. I normally see this accomplished as follows: List users = getTheUsers(); List returnList = new ArrayList(); for (User user: users) { if ("springfield".equalsIgnoreCase(user.getHomeTown()) returnList.add(user); } I am not particularly satisfied with this solution. Yes, it works, but it seems so slow. There must be a non-linear solution. Suggestions?

  Read the article

• maching strings

  - by kiran

  Write two functions, called countSubStringMatch and countSubStringMatchRecursive that take two arguments, a key string and a target string. These functions iteratively and recursively count the number of instances of the key in the target string. You should complete definitions for def countSubStringMatch(target,key): and def countSubStringMatchRecursive (target, key): For the remaining problems, we are going to explore other substring matching ideas. These problems can be solved with either an iterative function or a recursive one. You are welcome to use either approach, though you may find iterative approaches more intuitive in these cases of matching linear structures.

  Read the article

• The best practice to setup hierarchy data

  - by eski

  I'm trying to figure out the best practice to setup hierarchy data that i take from a database into some contoller that would show the hierachy. Basicly this would look like a normal tree but when you press the items that are under "chapters" you get a link to another page. I have these tables and this is the way they are connected Period Courses Subjects Chapters I select Period from a DropDownBox and then i want all the courses in that period to line up. Under each course would be the subject and under them are the chapers, typical hierarchy. The tables are linked together with refrences to each other in linear way. I have tried to use treeview to show this, but dont understand how to do it. I though i could use <ul><il> tags and do it at runtime. Reapeter or datalist, possible ? Is it better to do this with databinding in XAML or in code ?

  Read the article

< Previous Page | 22 23 24 25 26 27 28 29 30 31 32 33  | Next Page >