zak100

Sir, very good idea. I would try this . God bless you Zulfi.

Hi, I am now discussing the improved version: I found the improved version here: First Fit Tree Version (Improved Running time) Q.What is a segment tree above? I can't understand the running time of this tree version. In case of tree version, searching should take O(log n) and insertion should take O(log n). So the total running time should be O(log n log n). Somebody please guide me why the running time is: O (n log n). Zulfi.

Hi all, Thanks for your responses. @SenseiWhich language can I use for implementing this pseudo code? Zulfi.

Hi, First I want to discuss the running time of original version. Form the book (Allen Weiss), I found: What I understood from this that before placing the items, FF traverses all the bins from beginning to end i.e. n bins. Now each bin can have n items, because of that the running time is O(n^2). Somebody please guide me is the above version correct or not. Zulfi.

Hi, Thanks for your reply and link. If there is no encryption, how are we having security in the above circuitry? Somebody please guide me. Zulfi.

Hi, Thanks for your input. We have two groups. Why we call the circuit as multipart circuit? Zulfi.

Hi, I am trying to understand the circuitry provided at: MPCircuits: Optimized Circuit Generation for Secure Multi-Party Computation The circuit is : Somebody please guide me what is the purpose of priority encoder in this circuit and how it works in the context of stable matching problem. Is it doing some encryption/ decryption? Zulfi.

Hi, Thanks. I checked it with another sequence same as what you said (0.4, 0.4, 0.4, 0.4, 0.6, 0.6, 0.6, 0.6). I found that its not possible that online can be 4/3 of optimal. Zulfi.

Hi taeto, You are trying too hard but still I have got confusion when I am following the book's page step by step: Stepwise ' Let m=2, then the sequence is: 0.4, 0.2, 0.6, .51 i.e. 0.2 is the mth small item and 0.51 is the mth largest item. The book page further says: In terms of bins, is b =3? The book page further says: m/2 means 1, its not possible to put 4 items in ‘1’ bin. Please guide me. Sorry I am taking your too much time. Zulfi

Hi, I am trying to read the attached text: It uses some variables having subscript and superscript. I have underlined them in the attached figure. Somebody please guide me what is the name of the underlined notations and how we read them?

Hi, Thanks I understand I1 and I2. <Or to just leave some of them in half-packed boxes, because maybe later there will come items to fill up those boxes.> Can we do this in online? Can we go back to previous bin? If this is the case then online can have the same performance as optimal which is not possible. In the attached slide, we are comparing OPT with algorithm A. OPT can require m/2 bins (why?) They have supposed the bins required by A to b. After that they are saying that : b1= # of bins containing one item (i.e. each of these bins will contain large items i.e greater than 0.5 so each bin will have one item) b2 = # of bins containing 2 items (i.e each of these bins contain 2 items such that their collective weight/space is less than 1) Then we have b1 + 2b2 = m b1 = m- 2b2 b = m -b2 What is the point of showing these calculations? Thanks for helping me. God bless you. Zulfi.

Hi, Thanks for these book images. Sorry I can't understand the sequences of I1 and I2. Zulfi.

Hi, Your discussion really gave me some insight. I don't know much about that. My teacher taught it several times but I can't get anything but discussion is recalling me what my teacher taught. This is the advantage of discussion. Thanks. This is a good strategy. According to this 'a' can be 0.4 (1/2>a>0). So 0.5-0.4 = 0.1 and two sequences of 1/2-a can easily fit in one box. But if a = 0.1 then still 1/2-,1 = 0.4, again two sequences of (1/2-a) can fit in a box because the boxes are of unit size. So what my friend "taeto" is saying is correct. Now: if a=0.1 then, 0.5+1 = 0.6 so 1/2+a items would consume 2 additional boxes, total space = 0.8 of 1st box and 1.2 of two boxes so its 1.2 +.8 = 2 boxes. But if a= 0.4 then again we would occupy 0.2 of 1st box, and 0.9 + 0.9 = 1.8 of two boxes which is again two boxes. So we can achieve the optimal solution in both the cases. But we have to use some technique which is discussed by my friend Ghideon i.e, this actually recalled me about my professor, he discussed this solution in the context of load balancing, and he again talked about the ratio 4/3 OPT but he said that we sort the items in decreasing order of wait. Our items are (1/2-a) (1/2-a), (1/2+a) and (1/2+a), let a= 0.1 then we have 0.4, 0.4, 0.6, 0.6, so if we sort in decreasing order we can do that because this he talked in the context of offline bin packing. So after sorting we have, 0.6, 0.6, 0.4, 0.4, I think we can do it in two boxes. Now for a=0.4, Our items are: 0.1, 0.1, 0.9, 0.9 we would sort in decreasing order of weight: 0.9, 0.9, 0.1, 0.1 So they would fit. Thanks Ghideon, taeto and Strange. God bless you. Ghideon , what is the name of your book? I can't understand the values in the time axes, what is meant by 1, 2, m, m+1, m+2, and 2m? Somebody please guide me. Zulfi.

Hi, Thanks for your responses. I am trying to understand them. I found the link: http://ac.informatik.uni-freiburg.de/lak_teaching/ws07_08/algotheo/Slides/13_bin_packing.pdf 13_bin_packing.pdf

Hi, Can somebody please explain me the following figure in the context of online bin packing algorithm: I can't understand the concept related to the ration 4/3. Somebody please guide me. Zulfi.

Hi, I am trying to read a research paper: PrivateJobMatch: A Privacy-Oriented Deferred Multi-Match Recommender System for Stable Employment : https://faculty.ucmerced.edu/frusu/Papers/Conference/2019-recsys-private-job-match.pdf On one hand it says: And on the other hand it says: I feel the above two views are conflicting because on one side it says that PrivateJobMatch does not generate recommendations and on the other hand, it says, it is adapting DAA into recommender system. I can't understand how PrivateJobMatch utilizes the features of decntralized markets. Somebody please guide me. Zulfi.

Hi, Home help people do not provide answers. Zulfi.

Hi, Thanks. There is only one value for driveway i.e. 12. There are 2 values for earnings. Two values for hour, one is 360$ and the other is unknown. I can't figure out the other value for drive way. Somebody please guide me. Zulfi.

Hi, I am trying to solve the following: A person shovels driveways to earn money. She can shovel 12 driveways in 6 hours. She earns 18$ for each driveway.The person needs 360$ to buy a computer. How may hours does the person need to work? I am using unity method : 18$----6 hour 1 $----6/18 360$.....6/18 * 360 = 120 hours Some body please guide me. Zulfi.

Hi, Thanks. I got your idea. R, flag stands for only read, M flag means we want to only write and read/write flag means we want to do both read and modify the page. Zulfi.

Hi, Thanks for your response. Do you mean we have 3 flags, R, M and read/write? Please guide me. Zulfi.

Hi, I am trying to understand the concept of NRU from the following link. I have got some problem in understanding the text below: https://www.informit.com/articles/article.aspx?p=25260&seqNum=3 I have bolded the text. I have two problems: Page fault occurs if the page is not in memory but the above text says that (a)the page fault occurs at the time of modifying or writing the page? I can’t understand that. (b) Also I cant understand the text “, allowing the operating system to set the M bit and change the page's mode to READ/WRITE.” What is meant by READ/WRITE? If we are setting the M bit then it should be WRITE mode only? Why the text says READ/WRITE mode. Somebody please guide me. Zulfi.

Hi, I have underlined the words "single center", will this be single site. I can't understand this greedy approach? why its bad? Somebody please guide me. Zulfi.

Hi, I want to create a graph from the following data. Please provide me the steps. Garph1 BS CPU Percentage 12 Memory Usage 15773696 sdiskusage total 9.82901E+11 sdiskusage used 1.41429E+11 sdisk usage free 7.91472E+11 sdisk usage percentage 15.2 virtual Memory 10234679296 rss 15773696 Time 1.026669979 Graph2 SS CPU Percentage 2 Memory Usage 15769600 sdiskusage total 9.82901E+11 sdiskusage used 1.41429E+11 sdisk usage free 7.91472E+11 sdisk usage percentage 15.2 virtual Memory 10545913856 rss 15769600 Time 1.026956081 Graph3 BSBS CPU Percentage 12 Memory Usage 15773696 sdiskusage total 9.82901E+11 sdiskusage used 1.41429E+11 sdisk usage free 7.91472E+11 sdisk usage percentage 15.2 virtual Memory 10234679296 rss 15773696 Time 1.071877241 Problem with the attached graph is that its creating the same graph for all the 3 data. How can I create variation using decimal values?Also it is not considering time? Somebody please guide me.

Hi, I have a text file created on notepad. I want to convert it into GIF. I found the following link: Converting text to gif But the problem is that I can't specify the image resolution in the above link. It works great. I tried paint but it does not accept text file. My visio is very old and I am not satisfied with the quality of gif created by this 2003 version. So I am thinking to write my own converter. Is it possible? Not really, its my personal task. But I want to prefer Python at this point as I am studying this right now. Zulfi.