Does anyone know the answer the following questions on converting logical – physical addresses

Due to the unforeseen pandemic, I am unable to speak to my tutor about the following question. I have emailed him, but I have not had an answer for weeks. Can someone please enlighten me.

Image and question to be answered below. Please provide an explanation, as I am struggling to find an answer:

enter image description here

I came across this question that my friend sent me and I cannot figure out how to answer it

let’s say the keyword “Superman” has a search volume of 250k per month. Other related search terms can be “Superman Logo” (55k), “Batman vs Superman” (60k), “Superman returns” (50k) etc. using which users search for a certain topic in Google in a country (say US). However, there may be thousands of keywords with the word “Superman” in it, and we don’t always have exact data for many of these keywords with low volume (less than 1000). In order to find the volume of these topics we use predictions based on the data that we already have for high volume keywords. For example, we may say that the term “Future Superman” will not be searched by a lot of people and its volume can be medium (close to 300). Similarly, terms “Superman image” and “Superman jacket” will have medium volume and terms that people rarely search will have low volume like “Long Sleeve Superman Shirt” (100) and then there are terms like “cheap superman shirt” or “Superman college” which will have very low volume. Can you think of an approach on how you can classify keywords into “Medium”, “Low” and “Very Low” by using some logic when we only know the high volume keywords. Your answer should be descriptive and backed by reason. (Hint- your approach may be to classify certain words which if present will make the keyword “low” volume or “very low” volume. Or your approach can be based on number of words in a keyword, spellings, where exactly a term appears in a phrase and other common human psychology that works during a search)

Computation of “maximal” answer sets in First-order resolution without contraints

I am not familiar with logic programming but I would like to know if the following setting have been studied and if it corresponds to a known system in logic programming.

  • I work with first-order resolution where we have clauses $ c = \{p_1(t_1), …, p_k(k_k), \lnot p_{k+1}(t_{k+1}), …, \lnot p_n(t_n)\}$ : we have a disjunction of (positive or negative) first-order predicates (for instance $ p(f(x, y))$ ).
  • When we have a program $ P = \{c_1, …, c_n\}$ , using Robinson’s resolution between two clauses $ c_i$ and $ c_j$ , we would like to compute all the predicates we can infer from $ P$ . We can obtain different sets of predicates depending on how we connect the predicates but we would like all such sets.
  • We would like all these connections to be maximal in the sense that it we connect predicates in $ P$ until no more predicates in $ P$ can be added. It should represent a “full computation”.

For instance, let’s $ $ P = \{add(0,y,y)\} \quad \{\lnot add(s(x),y,s(z)), add(x,y,z)\} \quad \{add(s^2(0),s^2(0),s^4(0))\}$ $ be a program with $ s^n(0)$ being $ n$ repetitions of the unary predicate $ s$ . If the clauses are labelled $ c_1, c_2, c_3$ , the unique way of constructing such “maximal connections” is to do $ c_1-c_2^m-c_3$ for any $ m$ but only one is correct: $ c_1-c_2^2-c_3$ corresponding to checking $ 2+2=4$ .

To give more context, I work in another field with a system with (at first) no connections to logic programming but which later showed strong similarities (for instance with answer sets) so I wanted to connect it to known concepts in logic programming.

Why Mathematica can’t return the answer for this integrand?

When I run Integrate command for an expression it doesn’t return nothing, as you can see in the following screenshot. What’s the reason? enter image description here

My input:

Integrate[  1/(2 Sqrt[sp] \[Beta]) E^(-re^2 (se - \[Beta]^2/(4 sp)))    Sqrt[\[Pi]] (-2 +      Erf[(2 (re + rep) sp - re \[Beta])/(2 Sqrt[sp])] +      Erf[(-2 re sp + 2 rep sp + re \[Beta])/(2 Sqrt[sp])] +      Erfc[(2 (re + rep) sp + re \[Beta])/(2 Sqrt[sp])] +      Erfc[(2 rep sp - re (2 sp + \[Beta]))/(2 Sqrt[sp])]), {re,    0, \[Infinity]}] 

Can someone in Cyber Security or IT help answer this basic question on the change of today’s malware? [closed]

1.) Before the most common types of malware were usually trojan horses and various other types of viruses derived from one’s own e-mail on a desktop. Given the timespan since those days, the game has changed. Today ways of breaching a user’s data have changed drastically. What are the most prevalent methods that an average person should be aware of today?

How do I stop a “more senior” user, that seems to dislike my logic, from harassing every answer I give on StackExchange-RPG [migrated]

How do I stop a “more senior” user, that seems to dislike my logic, from harassing every answer I give on StackExchange-RPG?

I’m starting to feel very pushed away by certain user(s), who seem to enjoy claiming ‘I cant follow your logic”

Insinuating I’m “stupid” & trying to push me away from explaining my logic with thinly veiled “pokes”

Is there an effective way to have it delt with other than burning this account and making a new “fake-user” to escape them

Most of the issues are interpretations of RAW in DnD_5e

when connecting to someones wifi without using it, can they see search history from the past? Please answer it’s important for my work

We visited a friend who’s working as a programmer, And he told me to connect my phone to his wifi so he could send me a picture, however he didn’t send it and I left my phone connected to his wifi for an hour without using it. He caused me a lot of problems in the past but we forgot about it.

I really suspect what happened and I wanna ask you of he can see my search history, notes, pictures, messages, passwords? Or install a spyware in my phone? Just via wifi even if i didn’t use it to open anything?

Please answer my work depends on this.

Please check my answer to a pseudocode CASE statement question

This is a pseudocode question in my IGCSE CompSci textbook:

Use a CASE statement to display the day of the week if the variable DAY has the value 1 to 7 and an error otherwise.

This is my answer to it:

CASE Day OF     1 : OUTPUT "Monday"     2 : OUTPUT "Tuesday"     3 : OUTPUT "Wednesday"     4 : OUTPUT "Thursday"     5 : OUTPUT "Friday"     6 : OUTPUT "Saturday"     7 : OUTPUT "Sunday"     OTHERWISE OUTPUT "Day invalid" ENDCASE 

Is this answer correct?

(I realise this is a very rudimentary question for a Year 10/11 CompSci class but I’m homeschooled with no teaching guidance whatsoever. So a big cheers to anyone who would take the time to check my answer for me.)

Trying to contact Red Orca for permission to print an answer in a book [migrated]

I apologize in advance for breaking protocol. I’m just looking to get an official okay on rewriting and publishing Red Orca’s answer in this thread in an upcoming book about Magic Items. I looked for alternative ways to contact them but fell short. It’s an incredible answer and I’d love to make it more widely known to people out there looking to categorize their own items.

They can reach out over reddit to u/griff-mac or Discord to griffmac#9421, if that’s more appropriate. Thanks in advance, and again, I hope I’m not breaking rules too egregiously.

Cheers!