Get video length in hours:minutes:seconds round result to second

Right now I am using the following command to get the output of a videos duration

ffprobe -v error -show_entries format=duration -of default=noprint_wrappers=1:nokey=1 -sexagesimal 'video file.mp4' 

The result is 0:33:29.410000

I need this result changed with the following

  • An additional 0 must be at the front 0:33:29.410000
  • The seconds must be rounded up or down. The final output should be 00:33:29

Passport queue length in UK in relation to arrival method

If an EU citizen arrives to the UK, would there be any difference in relation to passport queue length if different arrival methods (i.e. transportation) were used? For example, would the passport queue be typically longer at the airport than at the land border or sea port? Or does it entirely depend on the season and not on the means of transportation?

“Could not do normal boot invalid kernel length”

My G935F shows “Could not do normal boot invalid kernel length” when attempting to boot into TWRP or turn on the device normally. The only thing I can access is ODIN. This happened after attempting to update TWRP and LineageOS. From looking online, I believe I can get a kernel and select the AP option in ODIN and flash a kernel as long as it is in .tar format. I was previously using PRIME kernel…1-4-0-t3678159 so I looked in the latest download from there but there are no .tar files, only a bootimg.tar.xz and a ramdisks.tar.xz. I tried extracting bootimg.tar.xz to a bootimg.tar and flashing that, but ODIN says it failed: Added!! Odin engine v(ID:3.1210).. File analysis.. SetupConnection.. Initialzation.. Get PIT for mapping.. Firmware update start.. NAND Write Start!! SingleDownload. g930eur-aosp-Image-r12p0 Unassigned file Complete(Write) operation failed. All threads completed. (succeed 0 / failed 1)

I also tried flashing the zip from but ODIN gave me: Added!! Enter CS for MD5.. Check MD5.. Do not unplug the cable.. Please wait.. CF-Auto-Root-hero2lte-hero2ltexx-smg935f.tar.md5 is valid. Checking MD5 finished Sucessfully.. Leave CS.. Odin engine v(ID:3.1005).. File analysis.. SetupConnection.. Complete(Write) operation failed. All threads completed. (succeed 0 / failed 1)

I don’t know what I’m doing and I’m afraid to mess up my phone beyond repair with ODIN. Can someone please help me? XDA forums has no answer and I don’t know who else to ask.

Word length zeta function

Let $ G$ be a group with a finite symmetric set $ S$ of generators. Let $ \ell_S(x)$ denote the word-length of a given $ x\in G$ . For $ s\in\mathbb C$ set $ $ Z(s)=\sum_{x\in G^*}\ell_S(x)^{-s}, $ $ where $ G^*=G\smallsetminus\{1\}$ . It may happen that this sum converges for some $ s$ . It does not converge for free groups but does converge for abelian groups. In the few simple cases I have computed, it turned out to be a linear combination of Riemann zeta functions with shifted arguments.

My question is a reference request: Has this kind of Dirichlet series been investigated? If so, I would like to have references.

Thank you.

Is there a limit on the length of a Google doc I can save as a Word doc?

I have a 600-page document on Google Doc which I would like to save on my desktop as a Word doc, as a back-up. Your instructions are easy to follow, but unfortunately only the first 48 pages of my document get transferred. Perhaps there is a limit as to how much one can convert? If that is not so, can you please advise how to fix this problem. Thank you very much in advance for your help. Arlette (NL)

haproxy, capture length, and redirect

I have an haproxy instance that 301 redirects certain GET requests. Unfortunately, those requests are being truncated at 1024 bytes.

After much reading and experimenting, I believe the issue is the length of what is captured by capture.req.uri, which is 1024. But I’ve not succeeded in increasing that number. I’m quite open to pointers.

Here are the most relevant snippets from my haproxy.cfg:

global     tune.bufsize 131072         tune.maxrewrite 65536  defaults  frontend www-https     bind ssl crt /etc/haproxy/ssl/      declare capture request len 16382     declare capture response len 16382     http-request capture capture.req.uri len 16382      acl redirect_canonical ssl_fc_sni -i     http-request  redirect  code 301  location[capture.req.uri]  if\  redirect_canonical 

Many thanks for any suggestions.

how to set the minimum length of a single line text in sharepoint online?

I have already set the maximum length, but now i need the user to enter not less than a certain amount

This is the script im using

function PreSaveAction() { var control = getElementByID(“IBAN(24 Digits Alpha Numeric)”); if(control.value.length < 24) { alert(“The length in this field should not be less than 24 chars”); return false; // Cancel the item save process } else { return true ;} }

Very fast method to find hamming distance between two Strings of equal length in Java?

I have a private class that I want to be able to find the shortest Hamming Distance between two Strings of equal length in Java. The private class holds a char[] and contains a method to compare against other char arrays. It returns true if there is only a hamming distance of one.

Is there a way to make the isDistanceOne(char[]) method go any faster?

private class WordArray {    char[] word;    /**    * Creates a new WordArray object.    *    * @param word The word to add to the WordArray.    */   private WordArray(String word) {      this.word = word.toCharArray();   }    /**    * Returns whether the argument is within a Hamming Distance of one from    * the char[] contained in the WordArray.    *    * Both char[]s should be of the same length.    *    * @param otherWord The word to compare with this.word.    * @return boolean.    */   private boolean isDistanceOne(char[] otherWord) {       int count = 0;       for(int i = 0; i < otherWord.length; i++) {         if (this.word[i] != otherWord[i])            count++;      }       return (count == 1);   } } 

Cycles of length $8$

There is a construction of a bipartite graph $ G=(V_1 \cup V_2, E),$ where $ |V_1|=|V_2|=n,$ $ |E| \geq \Omega(n^{6/5}),$ such that $ G$ does not cotain any cycle of length $ 8.$

I was wondering if someone knows this construction or introduce me a reference for that?

SQL – Dividing a sum value into multiple rows due to field length constraint

I am migrating financial data from a very large table (100 million+ of rows) by summarising the amount and insert them into summary table. I ran into problem when the summary amount (3 billions) is larger than what the field in the summary table can hold (can only hold up to 999 millions.) Changing the field size is not an option as it requires a change process.

The only option I have is to divide the amount (the one that breach the size limit) into smaller ones so it can be inserted into the table.

I came across this SQL – I need to divide a total value into multiple rows in another table which is similar except the number of rows I need to insert is dynamic.

For simplicity, this is how the source table might look like


acct_num   |      amt -------------------------------    101         125.00    101         550.00    101         650.00    101         375.00    101         475.00    102          15.00    103         325.00    103         875.00    104         200.00    104         275.00 

The summary records are as follows

select acct_num, sum(amt) from account_table group by acct_num

Account Summary

acct_num   |      amt -------------------------------    101        2175.00    102          15.00    103        1200.00    104         475.00 

Assuming the maximum value in the destination table is 1000.00, the expected output will be

Summary Table

acct_num   |      amt -------------------------------    101        1000.00    101        1000.00    101         175.00    102          15.00    103        1000.00    103         200.00    104         475.00 

I am only able to write a query that shows the total amount and the number of rows I expect to insert.

How do I create a query to get the expected result? Thanks in advance.