Windows 7 – Unable to register WinzIp Self Extractor license key

I have a Windows 7 computer and a licensed version of Winzip SelfExtratcor 4.0 under "C: Program Files (x86) WinZip Self-Extractor". I could start the Self-Extractor and see the license details.
I have to move this Self-Extractor to a Win 10 computer.
When I try to uninstall the program, it does not appear in Control Panel Programs and Features.

Is there a way to unregister the license key and move it to another computer?

Encryption – import public key with GNU Privacy Assistant (win 10)

So I'm trying to import my public key, which I generated with Kleopatra and GNU Privacy Assistant. First, I generated my public and private keys. I then export my public key and save it to my desktop (Windows 10). So suppose my public key is stored as shaun_pub_key. Then I add the extension (.pgp) so my public key is saved to my desktop as (shaun_pub_key.pgp). I would like to import KeyManager into GNU PA, but it reads that the file is a public key, but not imported. Can anyone tell me what I am doing wrong?

When I try to import the public key, it says that.

1 public key read
0 public keys imported
1 public key unchanged

I tried to import the key with Kleopatra and GNU Privacy Assistant and both give me the same … 1 public key read and 0 imported.

Thank you all for your time …

-Shaun

Database Design – Non-cluster index stores the cluster key instead of the RID

I have read a textbook that says:

Remember that the clustered index defines the actual physical order of the data rows on disk, so if a row is updated so that its cluster key changes, that row must be moved to a page where it is sorted correctly stored in a non-clustered index (as on a heap), the RID for that row would change, and every single nonclustered index would have to be updated. "

I understand the point, but if the cluster key of a row changes, should not the leaf nodes of the non-clustered index also be updated? Is not this the same effort as updating RID?

And when the cluster key of a line changes. Only the leaf nodes (not the root or intermediate nodes) need to be updated with the latest cluster key, right?

reactjs – Conditional Javascript operation with the text key from the javascript object

I am trying to understand the code of this codesandbox. I understood most, but I do not understand this line: return

{Text}

;, Selected is a string, and it is never empty, so the truth about empty strings does not apply. How does this line of code work? Is this also a javascript peculiarity or a React / Jsx peculiarity?

SQL Server – Can not insert a duplicate key row into a non-unique index?

We've encountered this weird mistake three times in the past few days after we've been flawless for eight weeks, and I'm at a loss.

This is the error message:

The execution of the query "EXEC dbo.MergeTransactions" failed with the
The following error: "Can not insert duplicate key row in object
& # 39; # 39 & sales.Transactions; with a unique index
& # 39; # 39 & NCI_Transactions_ClientID_TransactionDate ;. The double key value
is (1001, 2018-12-14 19: 16: 29.00, 304050920).

The index we have is Not unique. If you notice, the duplicate key value in the error message does not even match the index. Strangely enough, I manage to execute the process again.

This is the latest link I could find that has my problems, but I see no solution.

Error: Cannot insert duplicate key row in… a non-unique index?!

A few things about my scenario:
* The process updates the transaction ID (part of the primary key). I think that's the reason for the mistake, but I do not know why? We will remove this logic.
* Change tracking is enabled for the table
* The transaction is read unbound

primary key

    FORCE [PK_Transactions_TransactionID] PRIMARY KEY CLOSED
(
    [TransactionID] ASC
) WITH (PAD_INDEX = OFF, STATISTICS_NORECOMPUTE = OFF, IGNORE_DUP_KEY = OFF, ALLOW_ROW_LOCKS = ON, ALLOW_PAGE_LOCKS = ON, DATA_COMPRESSION = PAGE) ON [Data]
) ON [Data]

Non-clustered index

CREATE AN INDEX NOT COMPLETED [NCI_Transactions_ClientID_TransactionDate] ON [sales],[Transactions]
(
    [ClientID] ASC,
    [TransactionDate] ASC
) WITH (PAD_INDEX = OFF, STATISTICS_NORECOMPUTE = OFF, SORT_IN_TEMPDB = OFF, DROP_EXISTING = OFF, ONLINE = OFF, ALLOW_ROW_LOCKS = ON, ALLOW_PAGE_LOCKS = ON, DATA_COMPRESSION = PAGE)

Example of an update statement

update t
to adjust
t.transactionid = s.transactionid,
t.[CityCode]= s.[CityCode].
t.[PackageMonths] = s.[PackageMonths].
t.UpdateDate = @UpdateDate
FROM #working transactions s
TO JOIN [DB],[sales],[Transactions] t
ON s.[TransactionID] = t.[TransactionID]
             WO CAST (HASHBYTES (& # 39; SHA2_256 & # 39 ;, CONCAT (p.[BusinessTransactionID], & # 39; & # 39 ;, S.[BusinessUserID], & # 39; & # 39 ;, etc)
<> CAST (HASHBYTES (& # 39; SHA2_256 & # 39 ;, CONCAT (T.[BusinessTransactionID], & # 39; & # 39 ;, T.[BusinessUserID], & # 39; & # 39 ;, etc)

My question is, what's going on under the hood? And what is the solution? For reference, the above link mentions the following:

At this point I have a few theories:

  • Errors related to memory pressure or large parallel update schedule, but I would expect a different kind of error and so far can not establish any correlation
    Low resources become timeframes for these isolated and sporadic mistakes.
  • An error in the UPDATE statement or in the UPDATE data causes an actual duplicate primary key violation, but there is an obscure SQL Server error
    which results in an error message indicating the wrong index name.
  • Bad reads due to uncommitted read isolation, resulting in a large parallel update for the double insert. But ETL developers claim
    By default, read commit is used and it is difficult to pinpoint
    What level of isolation does the process actually use at runtime?

I suspect that if I optimize the execution plan as a workaround
MAXDOP (1) note or use of the session trace flag to disable spooling
Operation, the error will only disappear, but it is unclear how this
would affect performance

execution

Microsoft SQL Server 2017 (RTM-CU13) (KB4466404) – 14.0.3048.4 (X64)
November 30, 2018 12:57:58
Copyright (C) 2017 Microsoft Corporation
Enterprise Edition (64-bit) on Windows Server 2016 Standard 10.0 (Build 14393 🙂

private key – BITCOIN MACHINE

A friend tried to send me Bitcoin with the BTC ATM. She transferred the money without specifying my QR code, but her phone number instead of my QR code to which my wallet address is linked. I have a wallet address, but the bitcoin was sent, and it seems like a wallet address is generating for her has been. We do not know how to get this bitcoin back. Can you help us?

Java – Diffie-Hellman key exchange questions

At the moment I am working on a chat application where more than two clients can communicate at the same time.

I have just started with the encryption.

My goal is to implement end-to-end encryption, so I've done some research and found something about it Diffie-Hellman key exchange, I have a brief idea of ​​how it works, including many questions.

Wikipedia states that it works like this:

  1. We decide on a big prime number, we call it P,
  2. g must be a primitive root of P.
  3. Each client selects an arbitrary private key that meets this condition: 1 <= private_key <= P
  4. They send their private keys, which are generated as follows: (g ^ private_key) mod Pover the server
  5. The secret common key is (User2PublicKey ^ User1PrivateKey) mod Pand vice versa(User1PublicKey ^ User2PrivateKey) mod P

My questions to you are:

  • Does this work in a multi-client chat? I had some attempts on paper to emulate a connection for three clients, and I could not get the same shared key. If so, can you give me an example?
  • I know, it may sound silly, but P, ​​G and the keys are just integers? How could P 139 be, g 37 and so on?
  • Could not I use the secret shared key instead of encrypting the messages with the recipient's public key? To avoid encrypting the message for each connected client.
  • P and g could be generated on the server side?
  • Can someone give me an example of implementation in Java?

Readability – Key functionality recognition

On our website you will find a section with the highest-turnover products of each brand. The sections are marked with a great title, Clicking on each brand's top sale button displays a group of five to ten different products.

Enter image description here

The problem: no one interprets the buttons as such, he navigates on, not knowing that the products of the lower part change by clicking on the individual buttons.

Adding each brand logo worsens the design for the difference in shape and proportions of each:

Enter image description here

What can be done to make this function clearer? I think it's a design problem.

Other data:

  • We can not use different colors for each button
  • We can not show the products with a rollover on every button, it has to be a click.
  • The keys are located in an appealing flexbox

Firebase sends a JWT token after logging in. How do I get the signature key for the token to check JWT in MongoDB Stitch?

I'm trying to use custom MongoDB stitch authentication to check JWT generated by Firebase authentication. When connecting to MongoDB, the following problem occurs
Error: "crypto / rsa: verification error"

I used the public key generated with the method specified in https://firebase.google.com/docs/auth/admin/verify-id-tokens#verify_id_tokens_using_a_third-party_jwt_library

and saved the key in tricks and secrets. In addition, the audience app ID in Stitch was specified by the Firebase app

const stitchClient = Stitch.initializeDefaultAppClient ("stitch application ID");

const credential = new CustomCredential ("firebase_token");

stitchClient.auth.loginWithCredential (credential);