search for: satisfyingly

Dear R helpers, I'm trying to recode an ordered factor to reverse its scale, but I can't figure out how to make it. I am using the Recode function provided by the Car package. I've created an ordered variable: data$o.var1 <- ordered(data$var1, levels=c(1,2,3,4), labels =c("very satisfied", "fairly satisfied", "not very satisfied", "not at all

Thank you for the great CentOS. When trying to update from 5.0 to 5.1, I get an error regarding the centos.plus kernel and headers, "[Errno -1] Package does not match intended download". What'd I do? The end of the yum update results below: Transaction Summary ============================================================================= Install 11 Package(s) Update

Hi, I am not sure if this the right place for the question. Sorry if not ... My System: SuSE 9.2 OpenSSH 3.9p1 I have trouble to use a Smartcard with openssh. If i try to connect directly to the Smartcard, it fails: ssh -I 0:45 localhost card-etoken.c:175:etoken_check_sw: required access right not granted card-etoken.c:631:do_compute_signature: returning with: Security status not satisfied

I'm trying to do realize the following: I have 4 condtions. If all conditions are satisfied I will paste("PASS") If any of these is not satisfied I will paste("FAIL"). But I have to paste the corresponding failure. ifelse is a good solution but for a 2 conditions. Maybe switch or something like this. Does anyone have an idea how to do? Thanks in advance. Adel -- View

Dear List Members, Is there a way to prevent a kernel from being upgraded unless a list of given dependencies are satisfied? What I am getting at is sometimes updated kernels are available before the upgraded versions of the kernel modules in 'extras' are (ie drbd). If there were a way to list these modules as dependencies that must be satisfied before a kernel upgrade can be

Hi, I am trying to use ConfBridge application, but it throws "Failed to find a bridge technology to satisfy capabilities 0x4 (ulaw)" error. Please see console output below. -- Executing [501 at services:9] ConfBridge("SIP/OpenSER-00000005", "1001") in new stack [May 19 13:36:05] DEBUG[7452]: app_confbridge.c:404 join_conference_bridge: Trying to find conference

Hello, ?With SCL and epel repositories enabled, some dependencies for the package name 'nodejs' get satisfied with libs from SCL which are placed in paths that are not part of my user's environment. Is there a method to make sure that nodeJS from epel dependencies are only satisfied from epel? For example, the http parser dependency gets satisfied by

Hello, I have a question that is not directly related to R ... but I try to do it in R ;-) : I would like to generate a matrix Q satisfying (for a given Z, X and W) the two following conditions: t(Q)%*%Q=Z (1) XQ=W (2) where: Q is m rows and r columns X is p rows and m columns D is p rows and r columns C is r rows and r columns with m>p,r e.g: m=6, p=2 r=3

Hi All, I have a very simple question. Suppose I had a data frame with 100 columns, now I wanted to select rows with the values of some columns satisfying the same condition, like all equal to "Tom". I know I can use the 'and' operator "&", but it's painful if there were many columns. Can anyone give me some advice? Thanks in advance, FD [[alternative HTML

Hello, we're looking at packaging up our current NetDirector bug fix release and we want it available as .rpm at this moment, the maintainers don't have a test environment for Centos does anyone know whether the latest versions of and Centos can satisfy Tomcat 5 and Java 1.4 JDK as dependencies? thanks in advance! -- Greg Wallace Project: www.netdirector.org Blog:

Hi all, I want to show the rows of a matrix (100x3) of which some of its elements satisfy a certain condition. In particular, how can I display the 2 rows of my matrix one after the other and not all all elements of column 1 first, then column 2 and so on. See the following. > finest[finest[,1] > 10^3] [1] 4.960632e+13 3.612619e+04 7.668204e+12 1.001911e+04 8.886153e-01 [6]

You're missing a comma in the subscript. The comma tells it that your test is for the appropriate rows. You want: finest[finest[,1] > 10^3,] Hope this helps, Matt Wiener -----Original Message----- From: Edmond Ng [mailto:Edmond.Ng at lshtm.ac.uk] Sent: Monday, March 24, 2003 2:40 PM To: r-help at stat.math.ethz.ch Subject: [R] how to show a section of a matrix neatly (or row by row)

Hello, Considering 5 points in X-Y plain. Data is a 5*2 matrix (5 rows for samples & 2 columns for X and Y) With a distance from the origin, if a distance < 7, remove the row from the Data. After calculating the distance for each point, I can't forward because of this "Removing" problem. Anyone can help me? Data=matrix(1:10,5,2) a=rep(0,5); b=rep(0,5); for (i in

Hello everybody Sorry if such a question has already been posted somewhere, but I wasn’t able to find an answer yet. I’m trying to generate random numbers for illustration purposes. The random numbers should satisfy a multiple regression equation, for example: z = 0.3 + 0.05 * x + 1.5 * y + 3 * xy I was playing around with mvrnorm (MASS), but since I’m still a newbie to R and not an educated

Dear List, I'm trying to solve this simple optimization problem in R. The parameters are the exponents to the matrix mm. The constraints specify that each row of the parameter matrix should sum to 1 and their product to 0. I don't understand why the constraints are not satisfied at the solution. I must be misinterpreting how to specify the constrains somehow. library(alabama) ff <-

Hi, I am new to Ruby and Rails programming and am having difficulty with the following scenario... Consider the following model: class Studio < ActiveRecord::Base has_many :movies has_and_belongs_to_many :actors end class Movie < ActiveRecord::Base belongs_to :studio has_and_belongs_to_many :actors end class Actor < ActiveRecord::Base has_and_belongs_to_many :studios

Hello all, I'm trying to find all combinations of 4 numbers that satisfy 4 criteria, inside of a matrix (62 x 25). I've found a way to do this using for loops, but it is extremely slow because it involves checking every possible combination of numbers (567300) to see if the criteria are satisfied. Do you think there is a faster method of doing this? Or some functions that might help me

I've updated two 5.2 systems without a hitch. But this third one is giving me some grief. See errors below. Googling for "Package does not match intended download" turns up a bunch of hits, but none of them (that I've seen) offers any working solution. Can someone suggest how to overcome the following error(s) Thanks a bunch! Downloading Packages: (1/1): kernel-2.6.18-128.

I have a huge matrix and need to delete certain rows. What I need to do is: 1.In each row, calculate the sum of jth column and (J+2)th column 2. If the sum is greater than 2 then that row needs to be deleted. I have a sample matrix and my codes here. It does remove some rows but when it does, it skips the next row and each time it deletes a row, the dimension changes so it gets out of bound. I