Is it possible to create a Lightroom Smart Collection to include only specific keywords and exclude all others?

In Lightroom, I have marked my photos using keywords of the names of people, say A B C D & E and so on. I want to use smart collections to trap all photos where there are keywords A AND B. However, this traps even those where C and/or D and/or E and/or others may be in the photo. I can write individual conditions to exclude C D & E, but since I have about 100 keywords, this would make the number of excluding conditions too long.

Is there a way where I can trap only keywords A AND B and exclude all other keywords more conveniently than writing individual exclusions?

openssl – Why does it take so much time to create a secret key on a HSM?

I was testing key generation on a Hardware Security Module and I noticed that it takes so much time to generate an AES 256 secret key on the HSM.

I’ve used pkcs11-tool to generate the key and it took about 5 sec to complete the task:

$ pkcs11-tool --module <modules.so> --key-type aes:32 -p <PIN> --token-label SC_TEST --keygen --id 6887513122


Secret Key Object; AES length 32
  VALUE:      622650851419537140e20f58570bf1815d523d7a673dbbfd34d04a635326bb12
  label:
  ID:         6887513122
  Usage:      encrypt, decrypt, wrap, unwrap

real    0m4.847s
user    0m0.022s
sys     0m0.015s

OpenSSL on the other hand is very fast (does not use a HSM):

$ touch file
$ openssl aes-256-cbc -pbkdf2 -nosalt -P -in file -pass pass:testpassphrase


key=4E1F51BCB47608C267B9AE35E4648926D8A9E671521747E942857FC9671FC52B
iv =F773521265678AB0F4D6AA9AFED6912A

real    0m0.026s
user    0m0.023s
sys     0m0.004s

So I wanted to know why does it take so long to generate keys on the HSM ? or am I doing something wrong ?

Note that this is high end and expensive HSM.

design – Which is preferred: subclass double or create extension methods to test (relative) equality due to floating point differences?

I am writing financial calculation software using .NET C#, which needs to be blazingly fast. There is a lot of fractional math. So using decimal type is pretty much out of the question, given its poor speed relative to using double. But of course double has its problems testing for equality, with floating point rounding issues.

My options seem to be subclassing double and overriding ==, < and >; versus creating extension methods for double equivalent to these. My tendency is to go with the latter – less code to change and maybe it will be less confusing to others reading the code later? Is there another option? What are other good reasons to choose one over the other?

Create 800 High quality DoFollow backlinks for $5

Create 800 High quality DoFollow backlinks

100% Do-Follow – 100% verified

A do-follow link is a link that will pass on the SEO benefits of the website where it is built from to the hyperlinked site. This is the type of backlink that link builders will create for SEO purposes. Backlinks created at high PR sources will pass on the link juices towards the hyperlinked blog, thereby significantly improving its ranking position among the search engines.‚Äč

Rank your website for your desired keywords, and increase the number of positive actions on your website when you show up first in Google!

We will submit 800 backlinks for your URLs, with Keywords, for only $5

  • All backlinks are Do-Follow.
  • Natural Mix of Anchored and non anchored backlinks
  • Penguin Safe!
  • All niches allowed.
  • Daily detailed Submission Report.

No music/adult/nudity/dating/gambling related stuff please!

.

openssl – Why does it take so much time to create a secret key on an HSM?

I was testing key generation on a Hardware Security Module and I noticed that it takes so much time to generate an AES 256 secret key on the HSM.

I’ve used pkcs11-tool to generate the key and it took about 5 sec to complete the task:

$ pkcs11-tool --module <modules.so> --key-type aes:32 -p <PIN> --token-label SC_TEST --keygen --id 6887513122


Secret Key Object; AES length 32
  VALUE:      622650851419537140e20f58570bf1815d523d7a673dbbfd34d04a635326bb12
  label:
  ID:         6887513122
  Usage:      encrypt, decrypt, wrap, unwrap

real    0m4.847s
user    0m0.022s
sys     0m0.015s

OpenSSL on the other hand is very fast (does not use an HSM):

$ touch file
$ openssl aes-256-cbc -pbkdf2 -nosalt -P -in file -pass pass:testpassphrase


key=4E1F51BCB47608C267B9AE35E4648926D8A9E671521747E942857FC9671FC52B
iv =F773521265678AB0F4D6AA9AFED6912A

real    0m0.026s
user    0m0.023s
sys     0m0.004s

So I wanted to know why does it take so long to generate keys on the HSM ? or am I doing something wrong ?

Note that this is high end and expensive HSM.

javascript – Create HTML input fields dynamically SharePoint hosted-app

I want to create a custom html elements from page1 and submit it into page1, for example:

 $('.add').click(function () {
        $('#t3 tr:last').after('<tr id="row' + r + '" class="item">' +
            '<td><input name="station" class="form-control" type="text"/></td>' +

            '<td><button type="button" name="remove" id="' + r + '" class="btn_remove btn-danger">X</button></td>' +
            '</tr>').html();
        $(document).on('click', '.btn_remove', function () {
            var button_id = $(this).attr("id");
            $('#row' + button_id + '').remove();
        });

foreign key – Postgresql Create ForeignKey with repeated table name in value of ref contrain key

I am working on a database which does not contain any foreign key. When i open table I see strange format key because table of parent reference is stored in the value.

exemple

CREATE TABLE foo 
  ( 
  id SERIAL,
  name text
  );

CREATE TABLE bar
  ( 
  id SERIAL,
  foo_id text,
  name text
  );

INSERT INTO foo("name")
VALUES ('john');

INSERT INTO bar("foo_id","name")
VALUES (CONCAT('foo.'|| 1),'doe');
INSERT INTO bar("foo_id","name")
VALUES (CONCAT('foo.'|| 1),'kelly');

Can I create an FK with this type of structure? I have never seen this before