## How to set maximum resolution in a notebook?

I want to know if my notebook GPU is well configured with the maximum resolution.
I read this question to know the current monitor resolution:

It shows that maximum is 8192 x 8192 (is it monitor or GPU maximum resolution).
The GPU is a GM107M (GeForce GTX 960M) (10DE:139B). Its website shows it supports 4K.

How can I know if it is configured with the maximum resolution?

## linear algebra – Primal and Dual infeasibility

I have the following relationship for the primal and dual problems listed below.

$$Max: c^{T}x$$

$$s.t: Axleq-c$$

$$xgeq0$$ where $$c in mathbb{R}^{m}$$ and $$A^{T} = -A$$.

I have formulated the dual as the following:

$$Min: -c^{T}y$$

$$s.t: -Aygeq c$$

$$ygeq0$$

I am trying to show that there are only two possibilities to this system. Either the Primal and Dual are infeasible or the optimal value is 0. I have tried to use the following relationship: $$Ax+cleq 0$$ (from primal) and $$c-Aygeq 0$$ (from dual) then $$Ax+c leq c-Ay$$ which gives $$Axleq -Ay$$. Suppose that $$x >0$$ then this would imply that $$y<0$$ which cannot be true since the dual defines $$ygeq0$$, and the same vice versa. If an optimal solution exists it must be 0. Is this a valid argument for the two possibilities?

## webcam – How to disable autofocus in Zoom Windows?

I have a Microdia Sonix 1080p webcam (a Logitech knockoff, pretty much all that was available) and although the picture is quite good when it focuses properly, the autofocus constantly goes back and forth between my face and the background in my office. If I use the Windows Camera app and set the manual focus, that works only within the Camera app, but as soon as I start Zoom for videoconferencing, autofocus takes over and there is no way to set it back to manual focus. Has anyone found a solution to this?

## Google Sheets: How can I Set the Order on Items in a Chart Legend?

I have these two charts which pull the same data from the same table. The legend items appear in reverse order in the second chart. Anyone know how to make those match?

Reference: https://imgur.com/a/FbLRdyX

## haskell – Find a n x m binary matrix with exactly a 1’s in all rows and b 1’s in all columns

(Base on https://codeforces.com/contest/1360/problem/G)

So my logic is to process each column at a time and find `b` rows such that the total 1s in them is less than a and if there are many candidates I take the rows with least 1s.

``````import           Data.List
import           Data.Array
-- import           Debug.Trace

-- debug = flip trace

main :: IO ()
main = do
t <- read <\$> getLine -- testcases
replicateM_ t \$ do
n : m : a : b : _ <- (map read . words <\$> getLine) :: IO (Int)
mapM putStrLn \$ case solve n m a b of
Just mat ->
"YES"
: ( concatMap show ( mat ! (i, j) | j <- (1 .. m) )
| i <- (1 .. n)
)
Nothing -> ("NO")

-- solve :: Int -> Int -> Int -> Int -> Maybe (Array (Int, Int) Int)
solve n m a b = go
(array (1, n) . zip (1 .. n) \$ repeat 0) -- rowcnts
(array ((1, 1), (n, m)) ( ((i, j), 0) | i <- (1 .. n), j <- (1 .. m) )) -- matrix
1 -- column
where
go rowcnts mat c
| length idxs /= b = Nothing -- not enough rows
| c == m = if all (== a) (elems rowcnts') then Just mat' else Nothing -- last column to process
| otherwise = go rowcnts' mat' (c + 1) -- recurse for next column
where
idxs = take b . filter (i -> (rowcnts ! i) < a) \$ sortOn
(rowcnts !)
(1 .. n) -- candidate rows
rowcnts' = accum (+) rowcnts . zip idxs \$ repeat 1 --`debug` show (elems rowcnts)
mat'     = mat // ( ((idx, c), 1) | idx <- idxs )
``````

I wish to ask how can I write better code which might be concise and cleaner.

## php – Retorno de um webservice de objectos e arrays

Estou a aceder a um webservice, com o retorno faço um print_r da variavel e aparece a estrutura seguinte sendo que (contactosPessoa) e (matriculas) aparece o tipo em vez do conteudo.
Como posso fazer para ver/aceder ao seu conteudo?

``````stdClass Object (
(return) => Array ( (0) => stdClass Object (
(aluNumestudante) => 12345
(contactosPessoa) =>
Array ( (0) => stdClass Object ( )
(1) => stdClass Object ( )
(2) => stdClass Object ( )
(3) => stdClass Object ( ) )
(diNumero) => 14548711
(matriculas) => Array ( (0) => stdClass Object ( )
(1) => stdClass Object ( ) )
``````

Este é o código que estou a usar…

``````foreach ( \$results as \$data)
{
foreach ( \$data as \$data1)
{
echo "Número de aluno : ".\$data1->aluNumestudante. "</br>";
echo "Contactos : ".\$data1('contactosPessoa'). "</br>";

foreach ( \$data1->contactosPessoa as \$data2)
{
echo "valor :".\$data2."n";
foreach ( \$data2 as \$data3)
{
echo "ITEM DE CONTACTOn". print_r(\$data3)."n";
}
}
}
}
``````

## unity – How to sample from six cubemap images for a skybox in Shader Graph?

I’m trying to update a skybox shader to URP and reimplement it in Shader Graph. The shader code itself is pretty straightforward, but I don’t know enough about Shader Graph yet to set up the basic skybox.

It’s a standard cubemap skybox made up of six textures for +x, -x, +y, -y, +z, and +z.

Trying to Google different variants of “unity shader graph cubemap skybox” turns up tons of noise and nothing actually useful that I can see.

Does anyone know what the basic node setup is I would need to input six images and output a skybox?

## caching – why do my cache entries all double up with a #cache_redirect item?

I’m caching a piece of render array by adding cache keys to it. It’s getting cached correctly, but I see two rows for every instance of it.

One looks normal — contains the render array, with a cid that looks like:

``````CACHE_KEY:[languages:language_interface]=en:[languages:language_url]=en:[theme]=MYTHEME:[user.permissions]=HASH
``````

The other one had data that starts like:

``````a:2:{s:15:"#cache_redirect";b:1;s:6:"#cache";a:5:{s:4:"keys";a:1 ...
``````

and its CID is:

``````CACHE_KEY:[languages:language_interface]=en:[theme]=MYTHEME:[user.permissions]=HASH
``````

It looks like this is something to do with language negotiation, but why, and is this normal? The page I am loading when I am testing this is using the language prefix, so I’m not getting redirected.

## hiking – Booking Kilimanjaro Trek in advance?

I’m planning to climb the Kilimanjaro in September. I’ll arrive on the 29th of August, stay in Moshi for two or three days, then start the hike. What I’m wondering now is whether I should book the tour in advance or whether I can just walk around in Moshi, check some agencies and decide spontaneously.

My main concerns are:

• Will there be available places if I book two or three days before the tour starts? Or are the tours usually booked out by then?
• How likely is it to fall for a scam when looking for tour operators?
• Is it cheaper to book in Moshi directly than booking in advance? And closely related to the point before: how can I distinguish between a good priced offer and a scam?

EDIT: After some research, I decided to book the trek in advance. As this is rather a gut feeling I don’t feel this would qualify as an answer. I’ll extend the question by the information I gathered instead:

• Tanzania has risen the tourist VAT by 18% by the 1st of July, this means prices are generally higher (1, 2).
• Prices from different travel agencies range between 1500€ and 2000+€
• wikitravel.org states (emphasize mine):

You can either organize your trek up the mountain from your home country through a travel agency, but you’ll pay a lot more for this convenience, or, if you’ve got a bit of time, hop on a plane and save some money by organizing it in Arusha, Moshi or in Dar. Be advised that there are as many incompetent and dishonest trek organizers as there are good ones. Ask around to make sure your guide will deliver on his promises.

I’ll happily gather some information locally and post an answer if this question hasn’t been answered until my return.

## co.combinatorics – Are complete regular linear hypergraphs on \$omega\$ isomorphic

If $$H_i = (V_i, E_i)$$ are hypergraphs for $$i=1,2$$ then we say they are isomorphic if there is a bijection $$f: V_1 to V_2$$ such that for $$A subseteq V_1$$ we have $$Ain E_1 text{ if and only if } f(A) in E_2.$$

We say that $$H=(omega, E)$$ is a complete regular linear hypergraph on $$omega$$ if

1. $$e, fin E implies |ecap f| = 1$$ and
2. for all $$nin omega$$ we have $$|{ein E: n in e}| = aleph_0$$.

Are there complete linear hypergraphs $$H_i = (omega, E_i)$$ for $$i = 1,2$$ such that $$H_1, H_2$$ are not isomorphic?