Repeat elements in list, but the number of times each element is repeated is provided by a separate list

I’m trying to repeat each element of a list x number of times, where x is the corresponding element of the same position in another list.

For example, I have list A = {1,2,3,4} and another list B = {3,1,4,2} and I’m trying to get C = {1,1,1,2,3,3,3,3,4,4}.

How do I get C from A and B?

Thanks.

Summing all the times of a column

It is possible to add a last row in the table where I can show the sum of the times of the last column.

data = {    {"Caixa Pokémon", DateObject[{2019, 8, 27}], 22.41,      TimeObject[{2, 35}]},    {"Cortador Lindinha", DateObject[{2019, 8, 28}], 3.91,      TimeObject[{0, 41}]},    {"Suporte Principal do Carretel Maior", DateObject[{2019, 9, 01}],      12.28, TimeObject[{2, 00}]},    {"Cortador Woody", DateObject[{2019, 9, 01}], 5.62,      TimeObject[{1, 01}]},    {"Suporte-Trava Carretel Maior", DateObject[{2019, 9, 06}], 2.08,      TimeObject[{0, 22}]},    {"Suporte-Tampa Carretel Maior", DateObject[{2019, 9, 06}], 1.67,      TimeObject[{0, 16}]},    {"Suporte-Trava Carretel Maior", DateObject[{2019, 9, 06}], 2.05,      TimeObject[{0, 21}]},    {"Jogo de Hóquei do João Pedro", DateObject[{2019, 9, 06}], 6.48,      TimeObject[{0, 55}]}}; Text@Grid[Prepend[data, {"Projeto", "Data", "Metros", "Tempo"}],    Background -> {None, {Lighter[Yellow, .9], {White,        Lighter[Blend[{Blue, Green}], .8]}}},    Dividers -> {{Darker[Gray, .6], {Lighter[Gray, .5]},       Darker[Gray, .6]}, {Darker[Gray, .6], Darker[Gray, .6], {False},       Darker[Gray, .6]}}, Alignment -> {{Center, Center, {Center}}},    ItemSize -> {{10, Full, 5, Full}}, Frame -> Darker[Gray, .6],    ItemStyle -> 14, Spacings -> {15, .8}] 

enter image description here

How should Thaumaturgy’s “three times as loud as normal” be interpreted?

This may be a bit of a silly question, but it came up during playing and left me wondering. The spell description states that your voice booms “three times as loud as normal”, but it leaves open how the volume of a voice is measured.

Two common ways to measure the volume of sound is to measure the pressure difference the sound causes as it travels through air and optionally to transform this level on a logarithmic scale (the Decibel scale). This table lists several things to reference. For example the upper end of a normal conversation sits at 0.02Pa or 60Db.

Now if we mean “three times as loud” on the linear pressure scale, that elevates a normal talking voice to the volume of a TV set. Not very impressive. If we mean “three times as loud” on the logarithmic scale, that comes out above the volume of a stun grenade. Very impressive, though probably a bit unbalanced for a cantrip.

Obviously neither of these interpretations is what the spell creator had in mind. But, then what is?

Can Metamagic Song be used multiple times on the same spell?

Metamagic Song from Races of Stone allows you to expend Bardic Music uses in place of increasing the level of the spell when applying metamagic. It comes with the stipulation that

You cannot use the Metamagic Song feat to add metamagic feats that would make the spell’s effective level higher than the highest level of spell that you can cast normally.

Assuming I can cast 5th level spells (but not 7th level spells), can I cast an empowered, maximized Sound Burst using a 3rd level spell, and expending 5 bardic music uses?

Compare the difference in bus transfer times

Suppose we are given a 2-byte-wide bus that supports single-byte, dual-word (same clock cycle) and burst transfers. The overhead of the single-byte or dualbyte transfer is 1 clock cycle. Now we want to send a 1080P video frame at a resolution of 1920 X 1080 pixels with 3 bytes per pixel.

What will be the difference in bus transfer times if the pixels are packed vs. sending a pixel as a 2-byte followed by a single-byte transfer?

Auto-enroll pop up..how many times should this show?

I work for a healthcare company. We offer the opportunity for patients to auto-refill their prescriptions, but not everyone knows that it exists. Business wants to add a pop-up after an online order is confirmed to help enroll patients in the auto-refill program and there’s a hard drive from business to have this appear every time, however we believe that would be a bad experience and want to show through testing why that would be.

Exact call to action of the pop-up is still being figured out, probably something along the lines of “Yes, enroll me” and “Not now, thanks” (with another option that you can select “Don’t ask me again”). Obviously, if someone doesn’t select that “Don’t ask me again” but also X’s out or says “Not now, thanks” more than once, it’s not a good experience to continually ask them over and over if they want to enroll in auto-fill every time they order (typically every 90 days).

Is there a best practice or any research on how many times a dialog like this can be shown before it becomes way too annoying?

Question about the lower bound for $k \times k$-clique (under ETH) shown in “Slightly Superexponential Parameterized Problems”

I am reading the paper Slightly Superexponential Parameterized Problems at the moment and have two questions about it:

First question: The paper gives a proof of the following statement

Theorem 2.1: Assuming ETH, there is no $ 2^{o(klogk)}$ time algorithm for $ k \times k$ -Clique.

They prove this statement by sophisticated reduction from $ 3$ -coloring. They then state that this construction runs in time polynomial in $ k$ . They state:

The graph $ G$ has $ k^2$ vertices and the time required to construct G is polynomial in $ k$ . […] Therefore, the total running time is $ 2^{o(k \log(k)} \cdot k^{O(1)}$

Why is this not $ 2^{o(k \log(k)}) + k^{O(1)}$ instead? As far as I can see, we have only have to construct the graph once, and then we can run the presumed $ 2^{o(k \log(k)}$ algorithm.

Second question: From this theorem, it follows that $ k \times k$ -Clique can not have a $ k^{o(k)}$ algorithm under the Exponential Time Hypothesis. This follows from the abstract, which states that $ k^{O(k)} = 2^{O(k \log(k))}$ . What is a good way to proof this statement?

Specific keys on keyboard stop responding at random times

For a while I’m struggling to figure out and fix this issue on my portable laptop (Asus TP200SA, intel atom, 2GB) running ubuntu 18.04 and Linux Mint 19.2. Kernel 4.10.0-38

At random times, a particular set of keys i.e. w, 3, ->(arrow), s stops working. Even a reboot/shutdown doesn’t help.

Is there a way:

I can get some diagnostic information so that I can get an idea whats the underlying issue?

  • restart the builtin keyboard/driver, if possible?

  • I’ve searched around a lot on internet and couldn’t find anyone with similar issue. At best people have encountered issue of certain keys not working at all but my case is random cease in their functions.

Initially I suspected low free memory (200Mb/2Gb) was somehow responsible but in that case a clean reboot should get rid of it, however, it wasn’t the case and didn’t solve.

I also suspect there maybe some X11 underlying bug responsible, intercepting the key input however, not processing it but I don’t know how to debug and get diagonistic information about X11.

Any helpful tips, suggestions and insights will be looked forward. Thanks in advance fellows!

SharePoint 2013 On-Premise getting an error while accessing subsite java.net.ProtocolException: Server redirected too many times (20)

SharePoint 2013 On-Premise getting an error while accessing subsite java.net.ProtocolException: Server redirected too many times (20)

It is working fine when I try to load subsite again with the same session.

It is working for SharePoint on-premise 2010 but the issue only for SharePoint on-premise 2013

and there issue only for accessing subsite URL http://schemas.microsoft.com/sharepoint/soap/GetAllSubWebCollection

following is the error message:

(AxisFault): java.net.ProtocolException: Server redirected too many times (20) at sun.reflect.NativeConstructorAccessorImpl.newInstance0(Native Method) at sun.reflect.NativeConstructorAccessorImpl.newInstance(Unknown Source) at sun.reflect.DelegatingConstructorAccessorImpl.newInstance(Unknown Source) at java.lang.reflect.Constructor.newInstance(Unknown Source) at sun.net.www.protocol.http.HttpURLConnection$ 6.run(Unknown Source) at sun.net.www.protocol.http.HttpURLConnection$ 6.run(Unknown Source) at java.security.AccessController.doPrivileged(Native Method) at sun.net.www.protocol.http.HttpURLConnection.getChainedException(Unknown Source) at sun.net.www.protocol.http.HttpURLConnection.getInputStream(Unknown Source)