## html – reliably handles iframes if the web server can only process one request at a time

I'm trying to deploy HTML from a web server created in MS-DOS, which can handle one web request at a time.

I have written HTML into which two iframes must be loaded.
I use iframes because frameset is no longer supported.

I do this because I want to have a control panel on the General Menu Options page and a large main screen control panel.

The problem is that the last ad will not load even though the correct file is requested.
In fact, the web server does not even confirm the last panel request.

To eliminate some confusion, I've inserted my index.htm code:

``````
Test

BODY,#hdr,#f3{background:#000000;color:#FFFFFF}
#f1,#f2{height:79%}
#f3,#hdr{width:100%;left:0;display:block}
#hdr{top:0;height:9%;text-align:center}
#f1{top:10%;left:0;width:24%}
#f2{top:10%;left:25%;width:74%}
#f3{top:90%;left:0;height:10%}
FORM{text-align:center;margin:0.5em;float:right}
INPUT{font-size:1.2em;font-weight:bold}

Big title

``````

In this example, the screen.htm file is not loaded. When I tried it in Firefox, it displays a separate page stating that it can not connect to the server.

Is there a way to solve this without hacking the MS-DOS server without using javascript and without expecting the user to scroll constantly to get the command you want?

## Reference Request – Generalizing King's Lemma

In some recent work, I need a strengthening of King's lemma to "trees" of arbitrary orderly height. Trees in this context are actually only justified, partially ordered quantities. See, for example, page 114 in Jech's Set theory. One has to be careful when modifying the hypothesis of the "finite branching" of King's lemma in this situation due to the existence of arsonzajn trees. The generalization is as follows:

sentence: If $$(S, <)$$ is a well-founded suborder, so for each atomic number $$beta$$ the amount of height points $$beta$$designated $$S ( beta),$$ Finally, there is a branch in $$S$$ with the same height as $$P.$$

Here is my short proof of this result.

proof: To let $$alpha$$ be the height of $$P.$$ We recursively define the desired branch as follows. If $${s_ {i} } _ {i < delta}$$ is defined at height $$Delta,$$ then we choose $$s _ { delta}$$ to be one of the finitely many elements $$t in S ( delta)$$ this majorizes these previous points, and that has the added property of having every atomic number $$j$$.
$$( ast) , , text {if} delta
if such an item $$t$$ exist. Otherwise we finish the recursion.

To let $$beta$$ Be the height of the branch we just defined. Suppose that contradicts $$beta < alpha.$$ Then from the fact that the height of $$S$$ is $$alpha,$$ At least one of the finitely many elements $$t in S ( beta)$$ satisfied $$( ast)$$ With $$Delta = Beta.$$ To let $$t_0$$ be one of them. That's when our recursion ended $$beta$$, We know that $$t_0$$ does not make our industry big. To let $$beta_0$$ be the smallest index so that $$s _ { beta_0} not

Among the finitely many elements $$t in S ( beta)$$ they make the majority $$s _ { beta_0},$$ there is at least one who satisfies $$( ast),$$ since $$s _ { beta_0}$$ self-satisfied $$( ast).$$ To let $$t_1$$ be any such element. To let $$beta_1$$ be the smallest index, so that $$t_1$$ Does not vote $$s _ { beta_1}.$$ Clear $$beta_1> beta_0.$$

If we repeat this process, we get an infinite list of elements $$t_0, t_1, ldots in S ( beta),$$ they are different since the corresponding one $$beta_0, beta_1, ldots$$ are different. This contradicts the finiteness of $$S ( beta). boxed {}$$

My main question is whether there is a good reference in the literature for this result or not. When searching the internet, I found another proof in this blog. The idea is to move to a slightly simpler structure.

In that direction, when we replace $$S$$ with the set of points $$S ^ { ast}$$ which satisfy $$( ast)$$, then $$(S ^ { ast}, <)$$ is a wpo (ie a well-founded, partially ordered set without infinite antichains) that has the same height as $$S$$, So it is enough to prove this sentence for wpo.

## Reference request – almost linear ODE

To let $$A, B$$ His $$n times n$$ Matrices. I am interested in the following ODE in $$mathbb {R} ^ n$$

$$frac {dx_t} {dt} = Ax_t + Bx ^ + _ t$$

from where $$x_t ^ + = (x ^ + _ {1, t}, …, x ^ + _ {n, t})$$ and $$( cdot) ^ +$$ is the rectifier: $$r ^ + = max {0, r }.$$

Does this type of ODE have a name? And are there any known stability criteria? Was it generally examined by anyone?

The next thing I found are the "threshold linear networks" we are looking at here. I appreciate every hint that is similar to this system.

## Reference Request – From the Laplace case to the general form of divergence

With some tricks, results for elliptic / parabolic equations in a limited range can be generalized $$Omega$$ with Lapacian $$Delta u$$ to the general deviation form $$text {div} (A (x) nabla u)$$,

Case 1: $$A$$ is a constant matrix. In this case you can use the change of the variables $$v (x) = u (Ax)$$ ($$A$$ symmetric and uniformly elliptic) to obtain the Laplace case. But send this change $$Omega$$ to $$A Omega$$ and you can miss the regularity features of $$Omega$$,

Case 2: $$A$$ is not constant. In this case, the previous change of the variable does not work here.

How can we reserve the regularity of case 1? $$Omega$$ under $$A$$?

Is Case 2 a trick to get the general result directly? Sometimes we have to impose the ellipticity constant of some restrictions $$A$$ (for example, greater or smaller than a given number). Is there a trick to remove these restrictions in this case.

Thanks for any suggestion or hint.

## sharepoint enterprise – Retrieve the message "No user profile application available to process the request. Contact your farm administrator."

I get the message "No user profile application available to process the request. Contact your farm administrator." when enabling Self-Service Site Creation

The user profile application has been created and associated with the web application.

"Use Self-Service Site Creation" has been enabled in "User Permissions"

I also checked the following link, but no luck.
https://www.sharepointdiary.com/2013/03/sharepoint-2010-my-site-creation-error.html

## shorewall – SSH request is blocked by the firewall but logged correctly and the request is working on the server

I use a Shorewall to forward the SSH port 10100 to VM: 22.
The SSH request on the gateway to the VM works (default port 22).
From a client, the SSH request does not work (timeout)

The DNAT rule has logging level 6 (Info) and is logged.

/ etc / shorewall / rules

``````DNAT:6                    net     loc:10.10.10.100:22 tcp 10100  -
``````

in /var/log/kern.log:

``````Aug 17 00:02:55 m4789 kernel: ( 6809.163345) Shorewall:net_dnat:DNAT:IN=eth0 OUT= MAC=0c:c4:7a:99:0c:fc:28:99:3a:4d:23:91:08:00 SRC=217.88.84.61 DST=173.212.192.189 LEN=60 TOS=0x00 PREC=0

tcpdump -i eth0 port 10100 -n -Q inout
...
00:19:44.806518 IP 217.88.84.61.52464 > 173.212.192.189.10100: Flags (S), seq 4236641105, win 64240, options (mss 1452,sackOK,TS val 2752835732 ecr 0,nop,wscale 7), length 0
``````

I expect an answer (flag "<").

Are there any other test steps?

## api – Magento – PUT Request Restapi – Header Problem

I'm using the PUT request to change the product identity ID 1 name to Magento 1.8. I use the following details when using the PUT request:

A. Oauth1.0 – key credentials such as secret key, etc

Content Type: Application / json
Accept: application / json

C. Body:

{"name": "test"}

D. url:
http: // url / api / rest / products / 1

When I use the POST request, the following error is displayed:

``````{"messages":{"error":[{"code":400,"message":"Content-Type header is empty"}]}}
``````

Please tell me where to make mistakes. I have searched in many places, but I am unable to do it.

===

TO EDIT:

Someone advises me to insert Content-Length in the header. So I added it with POSTMAN because RESTClient refused to let me use it.

If I do not use Content-Length in POSTMAN, the same error will be returned, but if I use Content-Length in the header, execution will continue for some time. Finally, I had to manually cancel the request to stop it.

Please indicate how you can make a successful PUT request.

## Reference Request – Seal Levi in ​​\$ operatorname {GSpin} (2n + 1) \$ and image in \$ operatorname {SO} (2n + 1) \$

To let $$T$$ be a maximum torus of the split $$operatorname {SO} _ {2n + 1}$$ with base $$e_1, …, e_n$$, To let $$Delta = {e_1 – e_2, …, e_ {n-1} – e_n, e_n }$$ a set of simple roots of $$T$$ according to a Borel subgroup. To let $$alpha = e_n$$, and let $$alpha ^ { vee}$$ be the coroot to which he is bound $$e_n$$, Then the standard Levi subgroup $$M _ { operatorname {so}}$$ from $$operatorname {SO} _ {2n + 1}$$ corresponding to $$theta = Delta – alpha$$ is isomorphic too $$operatorname {GL} _n$$,

To let $$p: operatorname {spin} _ {2n + 1} rightarrow operatorname {SO} _ {2n + 1}$$ Let be the simply connected double lid of the special orthogonal group. To let $$T _ { operatorname {spin}}$$ be the opposite picture of $$p$$and identify $$alpha ^ { vee}$$ as coroot of $$T _ { operatorname {spin}}$$,

Finally leave $$operatorname {GSpin} _ {2n + 1} = ( operatorname {spin} _ {2n + 1} times mathbb G_m) / {1,1, ( alpha ^ { vee} ( -1), – 1) }$$ This is a reductive group whose derivative group is the spin group. When we identify $$Delta$$ as a set of simple roots of maximum torus $$operatorname {Image} (T _ { operatorname {spin}} times mathbb G_m)$$ from $$operatorname {GSpin} _ {2n + 1}$$It is known by looking at the root date of $$operatorname {GSpin} _ {2n + 1}$$ that the Levi subgroup $$M$$ corresponding to $$theta = Delta – alpha$$ is isomorphic too $$operatorname {GL} _n times operatorname {GL} _1$$,

I'm trying to figure out a few things and wanted to ask if the answers are known or found in the literature.

• 1. Suppose an isomorphism $$M cong operatorname {GL} _n times operatorname {GL} _1$$ is given, there is an explicit description of $$M _ { operatorname {spin}}: = M cap operatorname {spin} _ {2n + 1}$$ as a subgroup of $$operatorname {GL} _n times operatorname {GL} _1$$?

• 2. Suppose also a matrix realization of $$operatorname {SO} _ {2n + 1}$$ is realized, so that $$M _ { operatorname {so}}$$ identified with $$operatorname {GL} _n$$Is there an explicit description of the coverage map?

$$operatorname {GL} _n times operatorname {GL} _1 supset M _ { operatorname {spin}} xrightarrow {p | _ {M _ { operatorname {spin}}}} M _ { operatorname {so}} = operatorname {GL} _n$$

## Reference request – What is a good way to study for math students?

If, as a math student, I want to learn something new in mathematics (curiosity, references, etc.), I look for books or articles that I can read. Mathematics is always "systematic" to me because every statement has an answer (true or false or unprovable) and everything can be traced back to the axioms. However, I find it difficult to learn (non-theoretical) computer science.

I was once interested in IOS programming and was very motivated to develop a program that I could use myself. I looked up online and downloaded Xcode on my MacBook. But first, I found it very hard to find the right book to start learning Object-C programming. All the books I have found, including the phrase "Object-C programming," have told you how to use somethingFor example, some simple functions that define a class or an object, but I have no idea what they really are, nor do I know the limitations for each of these concepts that are not clearly defined. In other words, I do not know how to find them definitions for the commands in a higher-level programming language using a lower-level programming language. I would like a reference that contains the following all definitions of the commands For example, use C, assembler. I would like to know how to find a thorough reference with implementations for each command for all current programming languages. I can then trace them back to the logical gates. In addition, I can theoretically detect any software bugs in my program.

As a second part of my question, I would like to have a reference for compilers or programming environments (like Xcode). Here I personally find no readable hint. For example, I would like to design a button to go to a specific page for an iOS application. I've looked up the internet and every book I can find. There are several commands to accomplish the goal, but when I tried each of them and ran the program there, some error messages came up and I can not even understand them.

I really hope that there is a good answer that can solve my question as it has worried me for months. Thank you in advance.

## java – Error loading the image in the application according to json request

I'm developing an application that captures images that are sent to the server and stored in the bank. If the user so wishes, he can download these photos again to his mobile phone.

Also saving on the bank is fine. The problem is to convert the image from the URL String database to an image file. I use Spring Framwork to develop the API.

``````@RestController
@RequestMapping(value = "/api")
public class Services {

@Autowired
private PacienteRepository pr;

@GetMapping("/pacientes")
public List listaPaciente() {
return pr.findAll();
}
}
``````

Mobile App:

``````public static final String TAG = "LOG";
public static final String URL = "http://192.168.1.15:8080/api/pacientes";
private List pacientes;
private ListView lvPalheta;
private ProgressDialog progressDialog;
private ImageView iv_capa;

@Override
protected void onCreate(Bundle savedInstanceState) {
super.onCreate( savedInstanceState );
setContentView( R.layout.activity_galery );
lvPalheta = findViewById(R.id.listview_pacientes);
iv_capa = findViewById(R.id.tv_qtd);
listarPacientes();
}
protected void listarPacientes() {
progressDialog = ProgressDialog.show(Galery.this, "Aguarde um momento", "Carregando pedidos ...", true, false);
final StringRequest stringRequest = new StringRequest( Request.Method.GET, URL, new Response.Listener() {
@Override
public void onResponse(String response) {
progressDialog.dismiss();
Gson gson = new Gson();
Type usuariosListType = new TypeToken>(){}.getType();
pacientes = gson.fromJson(response, usuariosListType);
@Override

}
});

}
}, new Response.ErrorListener() {
@Override
public void onErrorResponse(VolleyError error) {
progressDialog.dismiss();
Toast.makeText( Galery.this, error.toString(), Toast.LENGTH_LONG ).show();
}
}){

};
RequestQueue requestQueue = Volley.newRequestQueue(this);

}

private List pacientes;
Context context;
public CustomAdapter(Context context, List pacientes) {
this.context = context;
this.pacientes = pacientes;
}

@Override
public int getCount() {
return pacientes.size();
}

@Override
public Object getItem(int i) {
return pacientes.get(i);
}

@Override
public long getItemId(int i) {
return i;
}

@Override
public View getView(final int i, View view, ViewGroup viewGroup) {

View v = getLayoutInflater().inflate(R.layout.card_view_pacientes, null);
ByteArrayOutputStream baos = new ByteArrayOutputStream();
Bitmap bitmap = BitmapFactory.decodeResource(getResources(), R.drawable.person);
bitmap.compress(Bitmap.CompressFormat.JPEG, 100, baos);
byte() imageBytes = baos.toByteArray();
String imageString = Base64.encodeToString(imageBytes, Base64.DEFAULT);
imageBytes = Base64.decode(imageString, Base64.DEFAULT);
Bitmap decodedImage = BitmapFactory.decodeByteArray(imageBytes, 0, imageBytes.length);
iv_capa.setImageBitmap(decodedImage);
return v;
}

}
``````

The output states that the conversion returns a null bitmap: