Abstract:
Wheat, rice and maize are the most widely consumed food grains in the world. Wheat, the most widely grown crop, is immensely diverse, with more than 25,000 different cultivars having been produced by plant breeders worldwide. Much of the world's production of wheat is consumed after it has been processed into bread, other baked goods, pasta and noodles, and, in the Middle East and North Africa, bulgur and couscous. In addition, the wide availability of wheat flour and the functional properties of gluten proteins provide the rationale for their wide use as an ingredient in food processing.Gluten is the main structural protein complex of wheat with equivalent toxic proteins found in other cereals, including rye and barley. The toxic protein fractions of gluten include gliadins and glutenins, with gliadins containing monomeric proteins and glutenins containing aggregated proteins. Possibly the introduction of gluten-containing grains, which occurred about 10,000 years ago with the advent of agriculture, represented an evolutionary challenge that created the conditions for human diseases related to gluten exposure, the best known of which are mediated by the adaptive immune system: wheat allergy (WA) and celiac disease (CD). In both conditions the reaction to gluten is mediated by T-cell activation in the gastrointestinal mucosa. However, in WA it is the cross-linking of immunoglobulin (Ig)E by repeat sequences in gluten peptides (for example, serine-glutamine-glutamine -glutamine-(glutamine-)proline-proline-phenylalanine) that triggers the release of chemical mediators, such as histamine, from basophils and mast cells [1]. In contrast, CD is an autoimmune disorder, as demonstrated by specific serologic autoantibodies, most notably serum anti-tissue transglutaminase (tTG) and anti-endomysial antibodies (EMA).Besides CD and WA, there are cases of gluten reactions in which neither allergic nor autoimmune mechanisms are involved. These are generally defined as gluten sensi

Abstract:
Many new challenges and opportunities have arisen for Slovenia since May 2004 when it became a full member of the EU. On the one hand we have some successful economic players who can definitely gain from new opportunities, on the other hand some structural changes still have to be accomplished. One of the most demanding tasks is related to higher education and in particular to harmonization of EU and global educational systems. The paper presents the results of the international framework for a Master degree curriculum in manufacturing strategy and an example of the integration of competence in technology and business. A good example of meeting Bologna goals is to establish a system of easily recognisable and comparable educational degrees and to accelerate the employment of EU citizens as well as the competitiveness of the European higher educational system.

Abstract:
Low efficiency, negative impacts on the environment and non-profitable operations are the main
shortcomings of out-dated industrial processes. Such systems can be reconstructed and improved
in the direction of multi-product operations. The study of this article focuses on the development
of a method for multi-product operations by reconstructing out-dated industrial processes. This
article contains the theory of a developed method that enables the updating of existing process
units and integrated systems on the basis of reconstruction scenarios and pathways. The goals of
the set out method are: 1) to maintain the existing process units and chemical plants to a greater
extent, 2) to enable the potential for finding new process alternatives and technological solutions,
3) to provide a streamlined operation for all subsystems and total systems, 4) to promote environmental
and social responsibilities, and 5) to apply the concept of the presented reconstruction
method to non-profitable industrial processes. In regard to multi-product operations, a conceptual
model is a suitable tool for the reconstruction of industrial processes. It connects several
software tools and so enables quick decision-making between process alternatives. A reconstruction
method provides foresight into the possible improvements to existing industrial processes. In
comparison with the indirect synthesis of DME (simple reconstruction pathway), the lower operating
costs from the direct synthesis of DME (complex reconstruction pathway) were confirmed.

Abstract:
A motorway Razdrto–Podnanos is being built across Rebrnice area in Vipava valley. There is limestone scree material deposed on flysch rocks.Limestones creeis unstable and gradually slides downslopes because of slope inclination, underground water and clayey zones. Clayey zones have been created on the contact between scree and flysch rocks. Material movements can be observed on the surface but they were also measured in wells. Limestone scree composition and reasons for landslides were described in this article.

Abstract:
In this article, the author observes and discusses the questions of national identity in the context of Czech and Slovenian music at the turn of the 19th to the 20th century. The Italian and German influences dominating Slovenian music in the past began from the mid 19th century onward to be replaced by predominantly Czech elements as the consequence of the numerous Czech musical immigration in Slovenia. Many of Czech musicians were naturalized in Slovenia and can therefore be included among Slovenian musicians. Although they actively supported the building of a Slovenian national style, they did not feel the need for the repeated аesthetic evaluation of traditional frames.

Abstract:
Let A_n (n >= 1) be the set of all integers x such that there exists a connected graph on n vertices with precisely x spanning trees. In this paper, we show that |A_n| grows faster than sqrt{n}exp(2Pi*sqrt{n/log{n}/Sqrt(3)} This settles a question of Sedlacek.

Abstract:
Let $G_1$ and $G_2$ be simple graphs and let $n_1 = |V(G_1)|$, $m_1 = |E(G_1)|$, $n_2 = |V(G_2)|$ and $m_2 = |E(G_2)|.$ In this paper we derive sharp upper and lower bounds for the number of spanning trees $\tau$ in the Cartesian product $G_1 \square G_2$ of $G_1$ and $G_2$. We show that: $$ \tau(G_1 \square G_2) \geq \frac{2^{(n_1-1)(n_2-1)}}{n_1n_2} (\tau(G_1) n_1)^{\frac{n_2+1}{2}} (\tau(G_2)n_2)^{\frac{n_1+1}{2}}$$ and $$\tau(G_1 \square G_2) \leq \tau(G_1)\tau(G_2) [\frac{2m_1}{n_1-1} + \frac{2m_2}{n_2-1}]^{(n_1-1)(n_2-1)}.$$ We also characterize the graphs for which equality holds. As a by-product we derive a formula for the number of spanning trees in $K_{n_1} \square K_{n_2}$ which turns out to be $n_{1}^{n_1-2}n_2^{n_2-2}(n_1+n_2)^{(n_1-1)(n_2-1)}.$

Abstract:
Let D be the distance matrix of a connected graph G and let nn(G), np(G) be the number of strictly negative and positive eigenvalues of D respectively. It was remarked in [1] that it is not known whether there is a graph for which np(G) > nn (G). In this note we show that there exists an infinite number of graphs satisfying the stated inequality, namely the conference graphs of order> 9. A large representative of this class being the Paley graphs.The result is obtained by derving the eigenvalues of the distance matrix of a strongly-regular graph.

Abstract:
Can a non self-complementary graph have the same chromatic polynomial as its complement? The answer to this question of Akiyama and Harrary is positive and was given by J. Xu and Z. Liu. They conjectured that every such graph has the same degree sequence as its complement. In this paper we show that there are infinitely many graphs for which this conjecture does not hold. We then solve a more general variant of the Akiyama-Harary problem by showing that there exists infinitely many non self-complementary graphs having the same Tutte polynomial as their complements.

Abstract:
In $2013$ a novel self-assembly strategy for polypeptide nanostructure design which could lead to significant developments in biotechnology was presented in [Design of a single-chain polypeptide tetrahedron assembled from coiled-coil segments, Nature Chem. Bio. 9 (2013) 362--366]. It was since observed that a polyhedron $P$ can be realized by interlocking pairs of polypeptide chains if its corresponding graph $G(P)$ admits a strong trace. In the present paper we characterize graphs which admit closed walk which traverses every edge exactly once in each direction and for every vertex $v$, there is no subset $N$ of its neighbors, with $1 \leq |N| \leq d$, such that every time the walk enters $v$ from $N$, it also exits to a vertex in $N$. This extends C. Thomassen's characterization [Bidirectional retracting-free double tracings and upper embeddability of graphs, J. Combin. Theory Ser. B 50 (1990) 198--207] for the case $d = 1$.