## list manipulation – generate statistical table to complete and then review,How can I generate this exact table?

Good morning everyone

I want to generate a data table model with intervals (between 5 and 15) following Sturges rule
I want to generate a data table model with intervals (between 5 and 15) following the Sturges rule, for school purposes where minimum and maximum random entries between 0 and 999 are generated and distributed in intervals with equal amplitudes and closed on the left and open on the right ( a—-b( and that gives me the frequency for each interval.and all this put it in a table to be filled by the student, the idea is that in each program run a different one is generated.
and below the solution of the solved table, where xi=class mark ,fr = relative frequency ,Fi= cumulative frequency Fr% = cumulative frequency percentage and fr% = relative frequency percentage and also LI—-LS lower and upper limits of each interval.
I would appreciate it very much
I attach an image of the idea

Translated with www.DeepL.com/Translator (free version)

## Nice website with complete setup

Hello webmasters, if you are looking for a simple how-to or list blog please take a look at this nice blog. Very easy to work with. Responsive. Cheap. Set up included. And 3 months after-sale support.

You can make money from this blog using AdSense, direct ads, affiliate marketing. The website comes with a control panel.

Price: \$5 (set up included)

Please note that domain and hosting are not included.

If you are interested please PM me.

Thank you,
Farris

## np complete – How is this reduction of 3-SAT to Half-SAT not valid?

I am studying algorithms and there is a question in CLRS called the Half-SAT problem

We are given a 3-CNF formula with n variables and m clauses where m is even. We wish to determine whether there exists a truth assignment to the variables of f such that exactly half the clauses evaluate to zero and the other half to 1. Prove that the half 3-SAT problem is NP-Complete.

What is to stop me from taking any input f to 3-SAT and adding m clauses (y or y or y) where y is not in the original m clauses. The transformation of input and output is clearly polynomial time.

And, given a solution to 3-SAT, there must be a satisfying solution to Half-SAT (the solver sets y to false). If there is not a solution to 3-SAT this means that one of the original m clauses is not satisfied these clauses are disjoint from the new clause, so either m – 1 or 2m – 1 clauses are True.

Yet all the solutions online are more complicated which makes me think I am missing something obvious.

## blockchain – In case of private data collections how can the nodes that don’t have complete access to the transactions know about the world state?

Hyperledger Fabric offers the ability to create private data collections, which allow a defined subset of organizations on a channel the ability to endorse, commit, or query private data without having to create a separate channel.
In that case, how can the nodes that don’t have complete access to the transactions know about the world state?
Will the world state differ between the organization that has and doesn’t have the access to the private data?

## Help with Sharepoint List Columns – make cell GREEN if value = “Complete”

If you are using a modern SharePoint list and the status column is a choice, you can simply do the following:

• Go the the “Column settings” > “Format this column”:

• Click “Choice pills” > “Advanced Mode”:

Inser the following code:

``````{
"\$schema": "https://developer.microsoft.com/json-schemas/sp/v2/column-formatting.schema.json",
"elmType": "div",
"txtContent": "@currentField",
"style": {
}
}
``````

You’ll get this result

If you want a more fancy format, you can use the following code:

``````{
"\$schema": "https://developer.microsoft.com/json-schemas/sp/v2/column-formatting.schema.json",
"elmType": "div",
"style": {
"flex-wrap": "wrap",
"display": "flex"
},
"children": (
{
"elmType": "div",
"style": {
"box-sizing": "border-box",
"display": "flex",
"height": "24px",
"align-items": "center",
"white-space": "nowrap",
"overflow": "hidden",
"margin": "4px 4px 4px 4px"
},
"attributes": {
"class": {
"operator": ":",
"operands": (
{
"operator": "==",
"operands": (
"(\$Status)",
"Complete"
)
},
"sp-css-backgroundColor-greenLight",
{
"operator": ":",
"operands": (
{
"operator": "==",
"operands": (
"(\$Status)",
""
)
},
"",
"sp-field-borderAllRegular sp-field-borderAllSolid sp-css-borderColor-neutralSecondary"
)
}
)
}
},
"children": (
{
"elmType": "span",
"style": {
"line-height": "16px",
"height": "14px"
},
"attributes": {
"iconName": {
"operator": ":",
"operands": (
{
"operator": "==",
"operands": (
"(\$Status)",
"Complete"
)
},
"",
{
"operator": ":",
"operands": (
{
"operator": "==",
"operands": (
"(\$Status)",
""
)
},
"",
""
)
}
)
}
}
},
{
"elmType": "span",
"style": {
"overflow": "hidden",
"text-overflow": "ellipsis",
},
"txtContent": "(\$Status)",
"attributes": {
"class": {
"operator": ":",
"operands": (
{
"operator": "==",
"operands": (
"(\$Status)",
"Complete"
)
},
"",
{
"operator": ":",
"operands": (
{
"operator": "==",
"operands": (
"(\$Status)",
""
)
},
"",
""
)
}
)
}
}
}
)
}
)
}
``````
• Replace `\$Status` with the name of your column. For example, ff it’s called “Outcome”, then `\$Status` should be replaced with `\$Outcome`

Result

## np complete – A variant of partition problem

I am thinking about the following variant version of partition problem:

Given $$n$$ positive integer numbers $$a_1, ldots, a_n$$ which sum to a even number $$S= sum_{i=1}^n a_i$$. The decision problem of the existence of a subset $$A$$ such that $$sum_{i in A}a_i = S/2 + 1$$ is NP-hard?

Here I’m essentially partitioning the ground set $${1,ldots, n}$$ into two sets whose summation differ by $$textbf{exactly}$$ 2. If this difference is $$textbf{at most}$$ 2 instead, then we can obtain a simple reduction from partition problem by multiplying every numbers by 3.

Before you jump in and create any adverts, it’s important to first think about why you’re advertising and what you’re aiming to achieve. By setting yourself a few goals ahead of going live with ads, you also have something to measure your success against.

• Increase traffic to my website from Facebook
• Increase attendance at my event
• Increase the reach of our content on Facebook
• Boost engagement for our Facebook Page

Once you’re into the Ads manager, you can navigate with the menu on the left-hand side of the page. To get started with your first ad, click the green button in the top-right corner of the page.

When you click to create a Facebook Ad, you’ll go to a page where you choose the objective for your campaign. There are 15 options here for what you might want to achieve:

Step 4: Define your audience and budget

• Location, starting with a country, state, city, zip code, or address, and refining even further with a mile radius
• Age
• Gender
• Languages
• Interests – Facebook looks at a person’s interests, activity, the Pages they like, and closely related topics
• Behaviors – Things like purchase behavior and intent, as well as device usage
• Connections – Choose to show the ad to all people, just those connected to Buffer, or those not connected to Buffer

Once you’ve selected your target audience, you next need to choose how much you’d like to spend on your ad. When you set a budget, it’s important to remember that this figure represents the maximum amount of money you want to spend. You can also set your budget to Daily or Lifetime:

• Daily: A daily budget is the average that you’ll spend every day.

This is where it gets really fun! It’s now time to choose the images (or video), headline, body text, and where your ad will be displayed on Facebook. For the text, you get 90 characters to share a quick message that will appear above your image(s) or video.

There are two ways to create adverts: Using an existing post or creating a new advert. Here’s a quick look at both options.

Facebook recommend using the default placements for the objective you chose, which enables Facebook to optimize placements for you in order to get the best possible results at the cheapest overall average cost.

## On locally complete intersection

Suppose $$Z$$ is a zero dimensional subscheme of $$k$$ distinct closed points on a surface $$S$$ over complex numbers. Is $$2Z$$ (i.e subscheme defined by $$mathcal{I}_Z^2$$) locally complete intersection ?

## np complete – Relevance of depth for \$NP\$-completeness of fan-in \$2\$ and fan-out \$1\$ modest depth circuits?

Circuits with fan-out 1 are called formulas.

Polynomial-size fan-in 2 formulas of arbitrary depth can be rebalanced to depth $$O(log n)$$ by Spira’s lemma, hence they compute exactly nonuniform $$mathrm{NC}^1$$. (The restriction that layers alternate between AND and OR is immaterial, as one can always insert dummy nodes to make it true, while at most doubling the depth.) Thus, your model with $$kge1$$ collapses to $$k=1$$.

Satisfiability is NP-complete already for 3-CNF. These can be written as depth $$O(log n)$$ fan-in 2 formulas by arranging the outer conjunction as a balanced binary tree. (Again, one might insert dummy OR gates to make the connectives alternate if desired.)

For $$k<1$$, the formula only depends on $$2^{(log n)^k}$$ variables, and therefore its satisfiability is computable in time $$2^{O(2^{(log n)^k})}$$. Thus, it cannot be NP-complete unless ETH fails. There is no special complexity class for it, it is just NP scaled down to inputs of size $$2^{(log n)^k}$$.

Better, satisfiability of circuits of depth $$(log n)^k$$ for $$k<1$$ is not NP-complete unless P = NP: if it is NP-complete, then there exists a poly-time reduction $$f$$ of CIRCUIT-SAT to itself that maps a circuit of size $$n$$ to a circuit of size $$2^{O((log n)^k)}$$. Using $$logloglog n/log(k^{-1})$$ iterations of $$f$$ (which are computable in polynomial time), we reduce CIRCUIT-SAT to satisfiability of a constant-size circuit, which is trivial to decide.

## My complete test of 16 video hosts | Proxies-free

As promised in the other thread, I tested these hosts for a couple of weeks on my website with equally distributed videos.
I graded them the following way
Video player = how user friendly the viewing experience is, mainly based on amount of annoying ads/popups, but also video quality and buffering.
Earnings = based on how much money I made in these two weeks.
Website = customization, statistics, functions and clarity of the website from the uploaders point of view.
Total score is next to the name

Playtube.ws – 13/15
Video player: 4.5
Earnings: 4.5
Website: 4

Ninjastream.to – 12.5/15
Video player: 4
Earnings: 4.5
Website: 4

Video player: 3.5
Earnings: 5
Website: 3.5
notes: best earnings

Streamsb.com – 11/15
Video player: 3.5
Earnings: 4
Website: 3.5

Upstream.to – 10.5/15
Video player: 4
Earnings: 3
Website: 3.5

Streamtape.com – 10.5/15
Video player: 3
Earnings: 2.5
Website: 5
notes: best website

Video player: 3.5
Earnings: 3.5
Website: 3

Voe.sx – 10/15
Video player: 4.5
Earnings: 3
Website: 2.5
notes: best video player

Mixdrop.co – 9.5/15
Video player: 4.5
Earnings: 2
Website: 3

Netu.io – 9/15
Video player: 4
Earnings: 2
Website: 3

Vidoza.net – 9/15
Video player: 1
Earnings: 4
Website: 4
notes: worst video player

Okstream.co – 9/15
Video player: 2.5
Earnings: 3.5
Website: 3
notes: host might be dying?

Doodstream.com – 9/15
Video player: 4
Earnings: 1
Website: 4
notes: worst earnings

Vidlox.me – 7/15
Video player: 1.5
Earnings: 3
Website: 2.5

Videobin.co – 7/15
Video player: 2
Earnings: 2.5
Website: 2.5

Streamzz.to – 6/15
Video player: 3
Earnings: 2
Website: 1
notes: worst website