Hello everyone, my name is Ariyanov and I will present a paper generalized pseudo-random secret sharing and efficient Strangler-Resilient Secure Computation. This is a joint work with Fabrice Milamouda, Edette Boyle, Nibgilboa, Shia Levy and Ivali Shai. So in this work we consider the popular setting of multi-party computation with their own majority. In this setting we have n-parties who wish to compute jointly some functionality over their private inputs without revealing anything about the output. In the presence of t-forrupted parties, where n is larger than 2t. So the reason this setting is so popular is because in this setting we are able to achieve highly efficient protocols that are information-theoretic or only make a black box use of cheap symmetric drift. Now within this setting we can distinguish between two sub-settings. The weak honest majority setting, where n is exactly 2t plus 1, which is the minimum number of parties required to maintain honest majority, and the strong honest majority setting, where n is strictly larger than 2t plus 1. The main question that we ask in this work is what can we gain in terms of concrete efficiency from allowing strong honest majority. Now this question may seem a bit odd at first glance because we are used to think that in cryptographic protocols there is a trade-off between security and efficiency. So if we reduce the security threshold then we will be able to improve efficiency. However, this is not true for the honest majority setting. To see this, consider the task of evaluating an arithmetic circuit over secret shared inputs. If the secret chain is linear then the parties need only to interact to compute multiplication gates. The best semi-honest multiplication protocol to this date is the Darmgren-Nielsen protocol, which has two rounds. In the first round the parties send 2t messages to party p1 or any other designated party, and then party p1 sends back n minus t minus 1 measures s to the other parties. So the communication cost is n plus t minus 1 sends elements and multiplication gates. The recent works have also closed the gap between semi-honest and malicious security in the honest majority setting. This means that we have the same communication cost also with malicious security, both for the strongly and the weak honest majority setting. Now assume that we want to work in the strong honest majority setting. So now we have two options. First to run a protocol in the strong honest majority setting. But the second option is to let the parties share their inputs to a subset of 2t plus 1 parties who will run the protocol for them in the weak honest majority setting. It is straightforward to see that the second option will result with less communication. And so it is not clear what can be gained from working in the strong honest majority setting. A different direction that has been considered in the strong honest majority setting to improve efficiency is to evaluate multiple gates together at the same cost of a single gate. This can be done using actual mere secret sharing where we store l secret in the same polynomial. So now the degree of the polynomials that are used during the computation is t plus l, which we denote by t, and the number of parties must be larger than 2t. Now when evaluating SMD circuits, where you have many copies of the same circuit in parallel, this gives an immediate improvement by a factor of l for both communication and computation, which is of course significant. However, when working over general circuits, previous works could only achieve a synthetic efficiency, but with high concrete cost for routing secrets between blocks when moving from one layer of the circuit to the next layer of the circuit. So the question that we started with remains open. What can we gain in terms of concrete efficiency from working in the strong honest majority setting when evaluating the general circuits? This work will present new techniques for the strong honest majority setting improving communication and computational cost, storage and latency. All of our techniques are based on pseudo-random secret sharing, PRSS, which allows secure and non-interactive generation of pseudo-random Shamir secret shareings from a set of replicated seeds that is distributed across the parties. Now while this method does not require any communication, the computational cost grows very fast with the number of parties and therefore it is only practical for small values of D. Nevertheless, it has many applications beyond the context of MPC and therefore some of our techniques are of interest even beyond the context of secure multi-party computation. Our first contribution is a way to construct useful linear correlations using PRSS to support computation of non-SAMD circuits over packed secret sharing, which avoid the routing mechanism overhead from previous works completely. Our second technical contribution is a new general PRSS construction with reduced number of seeds and reduced computational cost when the polynomial degree T is higher than what is required by the corruption threshold T and the packing parameter L. By achieving this, we are able to extend the range for which the PRSS technique is applicable. Our third and last contribution is cheap stragglers resilience. In particular, we show that if the number of parties N is larger than what is required by the polynomial degree T, namely that N is larger than 2D plus 1, then we can allow the protocol to proceed even if not all messages have arrived in each round. While this is straightforward to achieve with Samarana security, this is much more challenging to achieve with Melissa security because it requires dealing with a subtle attack due to Goyalatal, which we call the double dipping attack, which breaks the privacy of the computation. We present a solution for this attack that requires no additional cost while achieving stragglers resilience. Using our three technical contributions, we obtain the following two results. The first result is a PRSS scheme for sharing the degree D polynomials between N parties with security threshold T, where we make a reduction from the covering design problem and show that given a solution to that problem of size K, our PRSS scheme requires K times D plus 1 times A minus D divided by N, PRF seeds per party, which improves upon the classical result of Goyalatal when D is larger than T. And in the following table, we can see the number of seeds per party in this work and in the work of Goyalatal for two special cases when T equals 1 and any number of parties and when T equals 2 and any number of parties such that N is smaller than 3 times D plus 1. As said before, this result has many applications even beyond the context of general NPC. For example, for threshold cryptography as shown by Goyalatal or for the task of secure aggregation, which is important for secure federated learning, or even for the simple task of secure distributed storage where a dealer wants to store a secret across multiple servers. And with PRSS, the dealer only needs to broadcast the offset between the actual secret and the secret that was generated using PRSS. Our second result is an NPC protocol with malicious security and stragglers resilience. In particular, we show that given a security threshold T, packing parameter L and the number of parties N, which is equal or larger than 2T plus 2L minus 1, then there exists a protocol to compute any arithmetic circuit C over a finite field F with S multiplication gates, which has the following properties. First, the protocol makes only black box use of any pseudo-random function. The protocol achieves malicious security against T corrupted parties, even if tau messages are lost in each epoch, where tau is N minus 2T plus 2L minus 1, and an epoch is defined as the two rounds where P1 sends a message to all the other parties and receives back a message from them. And the third property is that if the parties follow the protocol, then it terminates successfully even if tau messages chosen adductively by the adversary are dropped in each epoch. And finally, the communication cost of the protocol is given in this equation. As can be seen, the communication cost decreases as we increase the packing parameter L, and as we will see, we are able to beat the best previous protocols in this setting while achieving stragglers resilience. So let's go into our first contribution or generalized PRSS to support computation of non-SMD circuits over packed secret sharing. So let's first recall how the dumb garnish in multiplication protocol works. So we use the bucket notation to denote a secret sharing of x via a polynomial of degree T. Now at the beginning of the protocol, the parties hold shares of the two inputs and also shares of a random R using a polynomial of degree D and also using a polynomial of degree 2D. First, the parties locally compute shares of x times y minus R using a polynomial of degree 2D by multiplying the shares of the inputs and subtracting from it the shares of R using a polynomial of degree 2D. And then they send their shares to party P1 who can reconstruct x times y minus R and then share it back to the parties using a polynomial of degree D. Finally, the parties can locally compute their shares of the output by adding their shares of R using a polynomial of degree D. To generate the collet randomness, we can use PRSS without any interaction. So how can we compute non-SMD circuits using packed secret sharing? So to illustrate our method, let's consider the following example. So let's assume that in each block, we encode two secrets and the parties need to multiply a block with x1 and x2 with the block that holds y1 and y2. So the output block should store in the first position x1 times y1 and in the second position x2 times y2. Now let's assume that after this multiplication operation, there are many addition gates and then when the parties reach the next layer of multiplication gates, there is a block which in the first position should store a linear combination of z1 and z2. So our protocol will work as follows. If we give the parties shares of a random block that store random R1 and R2, then the parties can perform the first step of the damgarnese protocol, which will result with party p1 holding z1 plus R1 and z2 plus R2. Now instead of proceeding to the second step of the damgarnese protocol, we will first ask p1 to locally compute all addition gates over the mass values and only when it reaches the next layer of multiplication gates to secret share the masked blocks according to the structure of the circuit. This means that p1 will secret share a block where in the first position there is a linear combination of z1 plus R1 and z2 plus R2. Now if you further give the parties also shares of a random block where in the first position there is a linear combination, the same linear combination of R1 and R2, then the parties will be able to unmask the block that they received from party p1 and obtain the correct blocks that will enable them to proceed with the computation. So if we generalize our example, what we obtain is the following. So the parties first locally multiply blocks of shared values, mask the result and send it to p1 who can reconstruct the masked outputs and then locally compute addition gates over the masked values. Then when party p1 reaches the next layers of multiplication gates, it can secret share a block of masked inputs which will be unmasked by the parties. And what we need to support this process is correlated randomness of the following form. Shares of a random block of L secrets using a polynomial of degree 2d and shares of a random block using a polynomial of degree d for each secret satisfies linear constraints that are induced by the structure of the circuit. And what we show in the paper that we can produce these correlations using PRSS therefore enabling computation over pack secret sharing without any extra overhead. So now let's move to our second contribution which is new designs for reducing storage and computational costs of PRSS. So first let's recall the classical PRSS construction of CDI. So first for each subset of size t we give the complement subset a seed and then to generate the next pseudo random shamir secret sharing for each subset of size t we define the next polynomial where we give all the parties in the subset t the evaluation point zero and an additional point is computed using the seed that is not known to the parties in t. So what we get here is a polynomial of degree t because it is defined by t plus one points and also a polynomial where each party can compute its evaluation point on this on the polynomial. And the final the output share of each party pi is the sum of all these evaluation points iterating over all the subsets of size t. And what we get is a shamir secret sharing of the sum of the secrets that are stored at the point zero in all the polynomials that we defined. So using the CDI construction for generating a degree d polynomial requires storage of n choose t seeds and approximately n choose t times d minus t plus one prf invocations where t is the number of corrupted parties and d is equal or larger than t. This of course limits the practicality of the construction for only small number of parties. What we show it is that if d is strictly larger than t then we can use this gap to achieve drastic improvements both for the storage and the amount of prf invocations. The main technical tool for our construction is covering designs. This problem is defined as follows. So given integers n, m, and t we say that a collection of sets s1 to sk is a n, m, t cover if it satisfies the following properties. So each sj must be of size m and must be a subset of the set one to n and each set of one each subset of one to n of size t must be covered by at least one sj. So in the right side we see an example of six to one cover because we have six items and the size of each set in the cover is two and each single item is covered by at least one set. Now it's almost straightforward to see that covering designs are necessary to achieve general prss. In particular if we have a t secure prss solution for generating the greedy polynomials then we can obtain an ndt cover. To see this consider a solution for t secure prss which consists of k subsets. Each set sj includes parties who receive seed rj. Now each set must be of size n-t in order to generate a polynomial of degree t and the t security property guarantees that each set of t parties must miss at least one seed which means that there exists a set sj such that the intersection between hj and that subset is empty. Now in order to obtain an ndt cover it suffices to simply take the complement subsets of s1 to sk. Now the size of each complement set is t and we are guaranteed that each set of t parties is covered by at least one complement subset so what we get is an ndt cover. However the opposite direction is natural and if we take an ndt cover this does not imply a t secure prss solution for generating the greedy polynomials. To see this consider the following example here we have a four to one cover that consists of two sets s1 and s2. So in order to construct a prss solution we would like to define two polynomials that corresponds to the sets s1 and s2. The first polynomial corresponds to the set s1 and here we will give the parties in the set s1 the evaluation point zero and an additional point will be computed using a seed that will be given to the parties that are not in s1. Similarly the polynomial f s2 will be defined using the set s2 namely the parties in the set s2 will be given the evaluation point zero and the an additional point will be computed using a seed that will be given to the parties that are not in s2. Then the final polynomial will be f1 plus f2 which is indeed a two degree polynomial because it is defined by three points. Now to see that this is not a t secure solution assume that p1 is the corrupted party. Now to learn the polynomial f p1 only misses one piece of information only k1. However if f was a truly random two degree polynomial p1 should have missed two points of the polynomials or in other words it should have missed two pieces of information. This means that f is not pseudo-random therefore the construction is not t secure. What we can prove and we indeed prove in the paper is that given an n d plus 1 t cover of size k we can construct a t secure prss solution for generating the gritty polynomials where the total number of seeds is k times d plus 1 and the total number of prf calls is k times d plus 1 times n minus d. The main idea behind our construction is that we take each set sj in the cover and generate d plus 1 sets of size t from it but each by each time we're moving one party from the set sj and then we use all the sets that we obtain k times d plus 1 sets to generate the prss solution and the security argument says that given a set of corrupted parties of size t there must be a set sj that covers it but from this set sj we generated d plus 1 sets from which d plus 1 minus minus t sets does include t which means that there will be d plus 1 minus t seeds that are unknown to the parties in t which is exactly what we need in order to prove security. In this table we present a comparison between our construction and the cd i construction for multiple data points so here for different n d and t parameters we have obtained the best n d plus 1 t cover size and using it we computed the number of seeds per party in our construction while the number of seeds per party in the cd i construction is simply n minus 1 to sd. As can be seen from this table we get a dramatic improvement over cd i as the gap between d and t grows. In the paper we further extend this result and show that given an n d plus 1 t cover we can use it to construct a prss solution for generating double shamir packed sharrings which means that we can generate block or l random secrets that are shared using a polynomial of degree d and a polynomial of degree 2d which is exactly what we need in order to evaluate s i m d circuits. In addition given an n d plus 1 minus l t covers we can use it to generate a prss solution for shamir packed sharrings with linear constraints meaning that we can generate an uninterrupted block of random secrets l random secrets that are shared using a polynomial of degree 2d and block of l secrets that are shared using a polynomial of degree d and each secret is a fixed linear combination of the secrets that were shared using a polynomial of degree 2d which as we have seen earlier in the talk is exactly what we need in order to support evaluation of non-samd circuits. So now let's move to our third and last contribution which is cheap straggler resilience. So consider an epoch which includes two rounds.  Since x times y minus r is shared using a polynomial of degree 2d this means that p1 only needs 2d messages to arrive in order to reconstruct x times y minus r and therefore even if n minus 2d messages are dropped the protocol can still proceed. In this case we say that a protocol has n minus 2d straggler resilience. In the paper we give also a formal definition for straggler resilience where we allow the adversary to choose adaptably the messages to drop in each epoch and also stress that security should hold not only the presence of an adversary controlling the parties but also if some messages are dropped in each epoch. Finally it is worth noting that feasibility of straggler resilience follows from standard robust npc protocols but there it comes with an extra significant overhead. Here we are interested in straggler resilience npc and not for robustness without any additional overhead. While straggler resilience is straightforward to achieve with semi-mono security it is much more challenging to achieve with malicious security that particular if we allow p1 to use only the first 2d messages that he receives this will completely break the privacy of the protocol. This is due to an attack by Goyalital which we call the double dipping attack and is carried out over two layers of the circuit. So assume we want to multiply x and y and then multiply the result with z. So malicious p1 can work as follows. So when multiplying x times y party p1 will send the correct second round message to all the parties except for one on this parties say pn. Then when multiplying x times y with z party p1 can compute the message that pn shoots up sending using the 2d messages that he first receives from the other parties. This is due to the fact that all the messages are point on a polynomial of degree 2d and so p1 can compute all the other points on the polynomial using the points the first 2d points receives and its own point. Then p1 can use the difference between the message that pn should have sent and the message that pn actually send in order to compute pn share of z which of course is completely forbidden and breaks the privacy of the protocol. The attack is caused by the fact that all the masks lie on a polynomial of degree 2d and therefore once p1 receives 2d shares you can compute the n-2d shares of the remaining parties. Failure solutions to this attack include using a masking polynomial of degree n-1 or adding a consistent check between each two layers of the circuit. While there the first solution leaves no room for starters while the second solution results in increasing the latency. We present a solution where we still can use only 2d messages and therefore strongly resiliency is maintained and also without increasing the latency of the execution. In our solution each party chooses its mask independently and then the masking polynomial is determined by the first 2d messages p1 receives. This means in particular that all the messages sent by the other parties are now independent and cannot be predicted which is what we need in order to prevent the WDPing attack. Now this raises several challenges when we want to unmask the shares in the next multiplication layer. And for this to succeed we need two additional things. First we need p1 to send the set of 2d parties that were used to interpolate meaning the set of 2d parties for which the messages arrived first. And second we need to tweak a little bit the correlation randomness and in the paper we show that we can use our PRSS techniques in a black box way to support this without of course any additional communication. However this requires increasing the amount of correlation randomness by a factor of n. So with our solution we are able to compute the circuit with n-2d resilience and with privacy. However this is not enough and in order to achieve malicious security we also need to show how we can achieve correctness. In our protocol we use distributed zero-knowledge proofs due to bonnetile to verify the correctness of all multiplications with sublinear communication in the size of the computed circuit and constant number of words. Now using this tool in our setting raises several challenges. For example since we use PAC-secret chain now all the secrets are stored in different positions of the blocks and we need to show how we can perform in the verification protocol slot friendly operations meaning operations that are over secrets that are stored in the same position of the block. Another challenge is that the state may be partial for some parties who struggle in the circuit evaluation. To solve this we will need to run the verification protocol several times number of times that is bounded by the circuit's depth. Nevertheless we show that the overall cost remains sublinear for all natural circuits. So finally we examined the communication cost of our protocol for various parameters. So on this table we can see for different number of corrupted parties for different number of struggles and for different packing parameters we present the number of parties computed as 2t plus 2l minus 1 plus tau. The total number of feed elements sent per multiplication gate in our protocol and the ratio between the communication cost of our protocol and the communication cost of the best protocol where we leave no room for struggles and where we don't use packed secret sharing which means that the number of parties is much smaller. As can be seen from the table when we increase the packing parameter and the number of corruptions we are able to beat the previous best protocol while still leaving room for struggles. So to summarize our contribution our first contribution is peer access for packed secret sharing which allows us to reduce communication and computation when computing non-SMB circuits. Our second contribution is new design for peer access which allows us to reduce computation and storage and the final contribution is struggling resilience which allows us to reduce the latency of the protocol. So with this I will end my talk. Thank you very much for listening.


First of all, I would like to thank the organizers for inviting me to present a paper in this very interesting session. My paper will explore the applicability of the concept of low-density urbanism as developed by Roland Fletcher to Iron Age Europe, with examples that range from the early Iron Age first and second to the late Latin opida. This approach has two-fold aims. First, to gain a better understanding of Iron Age agglomerations, and second to place Iron Age urbanism within the broader field of comparative urban studies. Many of the arguments presented in this paper can be found in my article entitled, Urbanization in Iron Age Europe, Trajectories, Patterns, and Social Dynamics, which has just been published a few weeks ago in the Journal of Archaeological Research. Before I develop the concept of low-density urbanism, I would like to make some general remarks and discussions about Iron Age urbanization. The first one concerns the use of the term cities and towns. Thanks to the research carried out in the last decades, it has become increasingly evident that the originality of Iron Age agglomerated settlements. Neither the early Iron Age first and second nor the late Iron Age opida represent a uniform group of settlements, but rather they were centers that could often arise enormously in regard of when they were established, the inner area, the architecture, and the manner in which they function as central places. Thus, rather than making general statements about the urban or non-urban character of Iron Age megasites, we should base our assessments on contextual analysis. The academic distinction between the study areas of classical and prehistoric archeology can sometimes heavily influence interpretations. In this sense, I do not share the reluctance of some colleagues in applying terms such as urban city or towns to Iron Age temperate Europe. When visiting the Honeiburgs some years ago, my American colleague, Michael Smith, said that the discussion on the urban nature of the site reminded him of the debate around the North American megasite of Cahokia. If Cahokia will have been located in Mesoamerica, no scholar will doubt in classifying it as an urban site. But because it is in the middle of the Midwest, there has been an ongoing discussion on the matter. Similarly, if the Honeiburg or Manching will be located in central Italy, I'm pretty sure scholars will have little doubts in regard of the urban character. From my perspective, many of the sites encompassed under the broad terms first in Sician Opida were not urban, but at the same time, we do have good arguments to classify other settlements like the Honeiburg, Manching, Coro and Vibratti as cities or towns on the basis of criteria such as evidence of a preconceived plan, housing a population of several thousand inhabitants and bringing together different categories of population and activities. Moreover, new research is showing that some open agglomerations are closer to a contextual definition of urbanism that many fortified centers. So that we need to acknowledge their importance in iron age settlement, patterns and society. Why do we need comparisons and how to compare? Despite the considerable attention that Hilfords and Opida have attracted since the 19th century, iron age centralization processes have rarely been considered from an anthropological perspective. Obviously, there are some exceptions such as John Coley's book on the Opida, but in general terms, this has not been really approached. Most studies have focused on comparisons with the classical world, particularly with Greek and Roman cities, interpreting the appearance of major settlements in temperate Europe as a barbarian attempt to emulate Mediterranean urbanization. The widespread distinction between prehistoric and classical studies and therefore between civilized south versus barbarian north, carries significant problems for the way iron age urbanization processes have been traditionally understood. This includes the use of checklist approaches in which the urban character of a site is determined by its supposed similarities with the supposed standard model of classical cities. All the maintenance of diffusionist views in which cultural change among central European societies is dependent on stimuli coming from the south. As John Coley's has rightly expressed it, I quote, if we expand our horizons in time and space, looking at urbanization on a worldwide scale, we see a much greater variety in the urban phenomenon of which a classical Greek and Roman cities are just one type, or better said, several types. The urban sites in temperate Europe, as in medieval Europe, are based on different principles and characteristics, quote, end. Rather than seeing urbanization north of the Alps as dependent on the Mediterranean, it is better to envisage two distinct zones evolving in close contact with one another. Having said this, I still consider it useful to establish comparisons and analogies with nucleation processes in the ancient Mediterranean. But in order to achieve a better understanding, it is also helpful to adopt a broader approach based on the comparative analysis of complex societies and the multiple pathways to aggregation in pre-industrial societies. This way we can go beyond colonial dualisms and reductionist perspectives that obscure the rich diversity of urban forms. Recent perspectives on urbanism have emphasized its diverse nature, arguing that it should be measured less on the basis of a particular checklist, such as those exposed by Gordon Child in his famous article of 1950, but on the relationship between sites and their hinterlands and underplays within a wider social context. In this sense, concepts such as Michael Smith's Study of Neighborhoods as universal features of urban life or Roland Fletcher's concept of low-density urbanism can provide fruitful insights. I would like to particularly hide at the work of this last ocelot. In several publications, the Sydney professor, Roland Fletcher, has drawn attention to the widespread existence of low-density pathways to urbanism, which form alternative to Gordon Child's classic model of concentrated high-density urbanism, of the kind typified by early Bronze Age Uruk, classical Rome, and early Byzantine Constantinople. In contrast to these densely occupied settlements, throughout history, many urban sites all around the world have been characterized by the large areas and manifold functions, but also by low-density occupation of often fewer than 15 habitants per hectare. Examples include Angkor in Cambodia, Cahogia in the American Midwest, Gretzin Bahu in Africa, some Mesoamerican cities, such as the Maya Centers, the so-called African giant villages of the Iqbo in Nigeria, or even the first millennium BC, Tripulia, Megasite in Ukraine. These places are clearly very different from Child's high-density in Norn and deserve consideration in their own terms. To name an example, Mayan Aztec cities exhibited a kind of low-density urbanism common in ancient Mesoamerica. The non-monumental components of these cities differed from the high-density cities in the old world that are often considered the norm of pre-modern urbanism. Distinctive features of Maya and some Aztec cities include the practice of intense agricultural cultivation within urban settlements, residential zones that were dispersed and unplanned, and the arrangement of houses into spatial clusters that served as neighborhoods. The residential areas of Maya and Aztec cities resembled modern peri-urban zones and informal settlements. As indicated by Fletcher himself, the late Iron Age Opeda fit well into the notion of low-density urbanism. And the same can be said about earlier centers such as the outer settlement of the Heunenburg or the nature of the late Halstatt and early Latin agglomeration at Bursch. In the first half of the 6th century BC, the outer settlement, the three hectare properties of the Heunenburg in southwest Germany were surrounded to the north and southwest by a large outer settlement of around 100 hectares. Whereas the hilltop of the Acropolis was densely occupied with rows of houses set along an erect linear street network and surrounded by a Mediterranean-inspired madrig wall, the outer settlement was comprised of farmstead-typing closures in distinct blocks. It is tempting to interpret the subdivision of the outer settlement into neighborhoods as evident for the existence of different kinship groups which came together during a process of synarchism which underpined the creation of the agglomeration. During this period, the settlement complex with hilltop, lower town and outer settlement is estimated to have had a population of around 5,000 inhabitants, therefore having a density of about 50 inhabitants per hectare. All in all, the outer settlement appears to reveal a presence of farmstead-like compounds within a larger urban agglomeration. Rather than being the result of a gradual population growth, the honey work seems to have been created within a relatively short period of time, probably as the result of a political decision that would have brought together different population groups that previously were dispersed. However, this large agglomeration lasted for only two or three generations and was largely destroyed by a catastrophic fire around 540, 530 BC. After this traumatic event, most of the exterior settlement was abandoned and the exotic madrigal wall on the plateau was replaced by a wall of earthen timber following traditional patterns. In the case of the early-army site of Gourch in central France, investigations have revealed that the hilltop was contemporary with outer and enclosed agglomerations, one immediately opposite the hilltop enclosure and another in the adjacent valley. This appeared to have been focused on craft production, but also include high status imports from the Mediterranean. In the 5th century BC, the entire settlement complex of Gourch covers several hundred hectares, although the density of settlement in some areas was relatively low. Just as many other early iron age centers, Gourch was a combination of an acropolis on a promontory, suburbs characterized by craft activities, and rich barriers in the surroundings. But the examples of Hoineburg and Gourch are also important on a wider scale, since they show the complexity of existing situations that go beyond simple categorizations into general models. At the Hoineburg, for example, the decision-prone occurrence of a very high density occupation on the hilltop and a low density occupation in the outer settlement. At the same time, neither the Neolithic Tripilla Megasite from Ukraine, nor most of the temperate European Opida, follow Fletcher's model of an urban trajectory in which cities that initially had high densities later became not only increasingly large but also increasingly lower density. Regarding the opida, my Darren Collington Moore has just published an article in the Oxford Journal of Archaeology entitled Beyond Iron Age Towns, examining the opida as examples of low density urbanism. I referred to his excellent paper from more detailed insight into late iron age agglomeration and the application of Fletcher's concept. In any case, I would like to highlight here that the opida enclose large areas but generally present a low population density per hectare. The figures of 5,000 to 10,000 inhabitants proposed for manching and vibracte would result in a population density of 13 to 26 inhabitants per hectare in the case of manching and 37 to 74 for the second fortification phase of vibracte. This means that even this and other opidas such as Titlberg that present a significant internal occupation also include large free areas inside the fortified space. The layout of the walls was often determined by the local topography but in addition, the empty spaces could serve a variety of economic and social purposes from areas for agriculture and cattle breeding to places for assembly and refuge of the rural population in case of danger. The recurring existence of large open areas within the opida suggests that these unoccupied spaces were in fact one of the principal elements playing a fundamental role in the negotiation of control over people and resources. This would have included the periodic assembly of the dispersed rural population for political gatherings and religious ceremonies. Rather than interpreting the existence of open spaces and low density occupation as an indication for unfinished urban places we should recognize that they constitute a defining characteristic of many major settlements. To name only one extra European example even in the Mesoamerican megalopolies of Teotihuacan there were extensive open areas for agriculture. In summary, urban open spaces constitute a widespread characteristic of many ancient and modern cities so that the presence in the opida does not contradict the urban character of at least some of these sites. A final feature of many late iron age centers that I would like to mention is that the basic settlement units were often enclosed farmsets that resembled rural settlement types. The third urban coined by Smith in 1972 encapsulates the idea of the domination of these sites by unbuilt space more similar to farm landscapes that are a traditional notions of urban quarters. These groups of farms with their outbuildings indicate to transfer rural settlement patterns to a more confined area. In other words, a kind of translocated landscape with clustered extended households that would occasionally also perform craft and commercial functions. This phenomenon is similar to the pattern already observed centuries earlier in the outer settlement of the Heuneburg. It suggests the nucleation of part of rural population and a concentration of activities that were previously dispersed more widely in the landscape. But the large settlements were more than a simple collection of farms. Their population would have included non-producers for example full-time specialists and elite members and religious specialists. And we often know about the existence of different functional zones or neighborhoods such as in Manchin and Corot. Finally, an increasing number of public spaces for religious and political gatherings have been identified over the last few decades within the Opida. The fieldwork of the last few decades has expanded our knowledge of iron age central places enormously. The picture that emerges is much more complex and dynamic than traditionally sought and it can be expected that the large-scale application of LiDAR images, drone flights and geophysical service will continue to significantly expand the corpus of known sites particularly open large automations and our understanding of the functions and internal organization. From a theoretical perspective the application of comparative approaches is still seminal and should be expanded in coming years. Such an approach will allow archaeologists working on iron age Europe to draw on the rich variety of concepts and insights of comparative urban studies. Thank you.


An inventor claims to have developed a heat engine which receives 700 kJ of heat from a source at 500 Kelvin and produces 300 kJ of network while rejecting the waste heat to a sink at 290 Kelvin. Is this a reasonable claim? Why or why not? Well, we have a heat engine, and we know that the high-side temperature is 500 Kelvin and that the low-side temperature is 290 Kelvin. It receives 700 kJ of heat transfer in and produces 300 kJ of network. Because these are magnitudes, I will get rid of the dots. And the way that we can evaluate if it's a reasonable claim or not is to compare the thermal efficiency to the theoretical maximum that could occur if everything were perfect. Remember, thermal efficiency is the network out divided by heat transfer in, and that can be on a specific basis or a magnitude or a rate of work and heat transfer. Since we're producing 300 kJ of network and consuming heat transfer at a rate of 700 kJ, that gives us a thermal efficiency of 3 7s, thank you calculator, of 0.428 or 42.86%. The theoretical maximum that could occur if everything were perfect comes from treating this heat engine as a Carnot heat engine, in which case our thermal efficiency is going to be 1 minus the low-side temperature divided by the high-side temperature, which is 1 minus 290 Kelvin divided by 500 Kelvin. And calculator says that represents a thermal efficiency of 0.2150, thank you calculator, of 42% on the nose. So we compare our thermal efficiency to the theoretical maximum and we see that our thermal efficiency is higher than the theoretical maximum. We are producing more work from this amount of heat transfer than is possible if there were no losses and everything were perfect. Therefore, this efficiency cannot occur, which means this is not a reasonable claim. Because it's not violating the first law, I mean, we don't know what the heat rejection is, we're not saying energy isn't conserved, we're just saying that we are converting energy with more efficiency than we can theoretically convert energy. Therefore, we are violating the second law.


I'mma have it one day, one day, we gon' get it one day.  What is something that she'll get a lot of hate for if you say it out loud? Women who don't have their husbands or their boyfriends in their bio or in their caption or not even a picture or host, I said what the f*** I said.  If you haven't been abused, have had a real serious encounter with the man and you're saying you hate men, but have brothers, good fathers, good men in your life. It makes no f***ing sense, make it make sense.   Ma'am, how about you stop doing that? Cause you hate men so f*** much, live by that. Women lie just as much as men, probably ten times better. They just won't tell you that, but I will.  Baby, guess what?  You wish. Correction on the whole part, y'all just don't like your man, that's why you don't post. I know this is gonna be a hot take, so everyone stay with me. Men who work out, y'all get a lot of hate, especially on TikTok I feel like, cause some of you are douchebags, but men who work out are way more accepting of women's bodies than men who don't work out. And I feel like people think it's the opposite, maybe because the guy has a great body and so maybe you think he'd be more picky and choosy about the girl's body that he dates. No, I mean he might want to go after a girl who also lives because of shared interests, but it's not about her body. Honey, the men who work out, they are the closest to understanding what it's like to be in a woman's body in today's society than any other man I've ever met because they know what it's like to have body dysmorphia. They know how hard it is to like meet physique goals and expectations. And so those men, man you give them a chance. Like those feminist lifters, I see you. You get, you go. Getting educated tonight. HSV1 and 2 are both spread the same way through skin to skin contact. They are not tested for generally in a normal STD-STI panel. You have to ask specifically for a herpes test because the way that they test for it is either in the blood or an active breakout. You have to have an active breakout for them to test for it to know which location and which strain. If they do a blood test, they will see HSV1 or HSV2 or none, but it will not tell you the location because you can have either in either location. You can shed the virus at any time, even if you do not have an active breakout but it is a lot less likely to spread it if you are not having an active breakout. You can take an antiviral called a cyclovir to keep you from shedding the virus and getting breakouts and spreading it. But you don't need to take them every day unless you're getting breakouts really often. Usually most people only get them like two to three times a year so it's better to build up antibodies and immunity so you get them less.    You won't do s**t! Yeah, I will! I'm choosing violence today.    See, there is this misconception that I hate all men is something thrown around by angry feminists. No, men are continuously overdoing it. They have been doing it for decades and centuries even.  New rule, if you're going to say not all men, I want to see the time that you defended women against f**king men being toxic. Unless I see that I'm going to assume you're just a f**king enabler. You may not personally do that and your friend may not personally do that, but not holding others accountable, you are enabling that s**t.   This is f**king disgusting, you all need to get to f**king... Okay, so what are some things you've noticed that are blatantly sexist but are so normalized within society? I'll take the bait and go first. The fact that it's so normalized for women to change their last name after getting married is beyond me. Like this is the name you got your degree with.  And the fact that so many men out there expect their significant other to change their last name for them. And I understand all the arguments for why you would want to change your last name to be a part of the family and it's easier for the kids and all that BS but the fact that the pressure is solely put on women? My last name is a huge part of my identity and I ain't changing it for no one but y'all stay safe out there. His hands look like that, so hers can look like that. His hands also look like that, so hers can look like that. Well I applied for that. So then my first can look like that. Don't you know me? Okay we need to normalize the amount of people that women actually sleep with. I went on a first date with this guy last week and he goes, yeah I always judge a girl if she sleeps with me on the first date. I'm sorry Frank but aren't you sleeping with her on the first date too? Somebody please tell me why it is okay for men to sleep with as many women as they want but yet women cannot sleep with as many men as they want. I'm so confused as to why women are called flat and men aren't. So I have some college sorority friends. They all decided that they would challenge each other and see who could sleep their way through the alphabet first as in hook up with a guy beginning with each letter of the alphabet. I mean seriously what could go wrong? They just started this challenge two months ago. One of the ladies already made it to letter K last night and then found out today that she is pregnant with a child born in the oven and not with one, not with two, but with three babies. Well someone was fertile and she doesn't know who the dad is. It could be Alex, Ben, Caleb, Darren or the other six guys but on the bright side she hooked up with letter K last night. Therefore Kevin from Arkansas State University you are not a father champ. Congratulations bro. As for the rest of the letters, it's a guessing game. Who's about to be a dad of three? You know it never ceases to amaze me when the mother of a child refuses to allow the father to have a role in the child's life. And this could happen before or after a court order. If it's before a court order then the mom's pretty much in charge anyway and can deny father parenting time. If it's after a court order then I have seen mothers do everything in their power to make it so difficult for a father to have a role in a child's life that the father just gives up finally. What mothers don't understand in those situations is that without a father in the child's life the child is much more likely to get in trouble before they turn 18. If it's a little girl there's an 80% chance she will become pregnant or drug addicted before she's 18. If it's a little boy there's an 80% chance that he will become a juvenile delinquent and get in trouble. If the father and mother are both involved in the child's life that reverses, it's only a 20% chance that a child will become a delinquent or get in trouble.


My name is Vinod. I work for IPG. In case you've not heard of IPG, this is how you spell it, because a lot of people have a confusion on how to pronounce that, OK? Can't hear? OK. I'll keep as near as possible. How's it now? So today, I'm going to talk about something called Zeta. This is not completely going to blow you away, but I think it's going to be worth for your five minutes. So what is Zeta? Zeta actually is something that we have open sourced last week. It is actually a platform which is built completely on Node.js. And this is for Internet of Things. How many of you guys know what IoT is? So first time when I spoke with my friend and asked what this IoT is all about, he said IoT is like Internet of Things. He said what Internet of Things? He said everything is connected to internet. What do you mean by that?  I said what the crap? Why should we connect everything to internet? Then he said, of course, we can draw a lot of analytics out of it. We can increase the, we can draw some insights and then make the world a better place. I asked him to give an example, OK? So he said, OK, everything at your home is connected to internet. Let's take an example of a flush tank.  Really? You're going to take data from my flush tank and then put it in the cloud. So interesting.  So at last I got sold. OK, fine, you can do something interesting with taking data from my home. So can you guys hear me? Because like, OK. So what we thought was to support this noble cause of taking your private data from home and then put it somewhere, we thought of building something called Zeta. So what it does is, this is actually a platform which allows you to talk to a lot of sensors and devices in your home. Yesterday, Ajun gave a talk on TESL. How many of you attended that talk? Well, almost all of you. So very interesting stuff. So what Ajun did was, initially, when he asked, how many of you guys are interested in hardware? Like six or seven folks raised their hands. But at the end, when he made an LED blink, a lot of people clapped. And he made LED blink. And then it was so interesting. And then you guys clapped like anything. So what was it? Why was it so different? In any cases? Exactly, right? All these days, all these embedded folks, right, have been fooling us saying that you cannot enter the area. So once you guys saw Node.js or JavaScript, which is very, very familiar for us, once you saw that Node.js can be used to control hardware, there was something new, right? We have not seen that. All these days, there's not been happening. So whether you like it or not, in a couple of years, down the line rate, we all are going to work some way or the other with Internet of Things, either on the hardware side, or it's going to be on the server side, or it's going to be in the cloud. You never know. But we're all going to be part of this whole Internet of Things stuff, whether you like it or not. So this platform allows you to basically connect all the sensors in your home, pick data, and then send it to the cloud. Can you move to the next tab? Yeah. Yeah, this one. Free your phone. OK, so this is something like very quickly I put up. So this is in a nutshell what Zeta does. Zeta is actually a software that can be run in a computer or a Raspberry Pi. And it has inbuilt drivers in it, which can inherently make it connect to already knows any sensor at your home. Because today, if you were to build a home automation system in my home, there are different protocols. They talk ZigBee, they talk Zedway, Wi-Fi, a lot of things. So today, it's very, very impossible. It's so impossible, actually, to connect agnostic to all these kinds of sensors. Of course, Google is working on Thread and Apple is working on MMI. But till then, it's going to be extremely tough for all the hardware in your home, like fridge washing machine, to AC, all these kind of things. For you to go and talk to them and collect data and then do some interesting applications on top of it, it's going to be extremely tough. So what we did is we came up with this platform where we had built a lot of drivers in that. It's still open source. You can also go and then contribute a lot in that. But till now, it has a capability to talk to Adino, Tessel, and all these kind of things. Not only that, Zeta has a counterpart which runs in Hiroku or Node.jitsu. So what it does is we've done some beautiful stuff. So once you define the devices at your home, the AP is already available for you in the cloud for you to push the data for the devices. For example, I have a refrigerator at home. Zeta pulls the data from the refrigerator. And then if you have an ID given for that refrigerator, the AP call is already available in Hiroku for you to go and then push some data about that particular fridge. So and it talks web sockets, talks APIs. So what you can do is make use of this platform, build some interesting use cases. It could be home automation, logistics, whatever it is, collect the data and then put it into Hiroku. And then draw some interesting analytics over it or do some interesting applications. So now that's all Zeta is. Don't ask me why we named it as Zeta. We were searching for a good name. We didn't get any. And the interesting stuff is we started from here. Almost all the names have been taken for JavaScript frameworks. At last, we ended in Zeta. And then this is something catchy that was there. So we thought we'll keep Zeta as the name. So I don't think I can take questions right now because I think I'm already out of time. But in case if it feels interesting, just cast me around. I'll be somewhere there. We can always talk. Thank you.


Spring Cleaning is here and Appalachian Wireless has the deal to get you started. Get a Samsung Galaxy S8 for a penny or a Galaxy S8 Plus for only $89.99 on the region's best network. Better service, bigger savings, that's today's Appalachian Wireless. To your agreement required, see store for details. We first told you about Project Snooze before Christmas when students at W.R. Castle Elementary School in Johnson County raised money to purchase beds for 26 of their fellow students who didn't have one. But once word spread about what the students were doing, Project Snooze started growing. Just, you know, we really thought, okay, we're finished. We've got it. Then we were fortunate enough to receive substantial donations from Chris Stapleton and Citizens National Bank. So we're like, hey, let's open it up to all of Johnson County. And they didn't stop with just Johnson County as beds are now in homes in five surrounding counties and some of the recipients haven't even started school yet. The parent that's supposed to pick up a bed this afternoon says, I have a three-month-old baby who's never had a crib. We just left Walmart a few minutes ago when we got the crib. Project Snooze's sponsor, second grade teacher Galena Burchett says that each bed set given away is worth about $200. And the students and their parents have worked nonstop to raise the money. We've held fundraisers such as car washes, bake sales. And so probably a total for this fundraiser would be, if we've probably invested probably $25,000 since we started in September of last year. Monday afternoon, the final 25 beds were given away, carrying Project Snooze over the 100 bed mark, 103, to be exact. And the students say it was worth all the work they put into it. Most of the kids just thought, oh well they're just playing video games all night or they just stayed up all night and they didn't get enough sleep. But now all these kids are seeing that these kids really didn't have beds and that they made fun of them for no reason. It kind of tugs at your heartstrings when you listen to the stories behind these and see the smiles of the pictures that we have. And that's all we ask from the parents. If you can, once you get the bed set up and the kids get the bed ready, just send us one picture. In Johnson County, I'm Shannon Deskins, EKB News.


Comic and kids tell him you if you like comic and kids make sure and hit that subscribe button for more content All right guys, so I'm here with my son Duke say hi dude. Hi, and While we were at Walmart today. He wanted to get a smaller version of The black line that daddy got yesterday, right?  They come in the blister packs. They're open however The tail is stuck inside They are very difficult to cut because they do have these twist ties around the smaller limbs And then they got a zip tie really tight around the waist I had to use a flat head screwdriver to pry up the zip tie in order to get some scissors through there to cut them not much say this is the The action feature ferocious slashing claw attacks pilot Shiro primary attack wings of Wraith Primary formation Voltron head and torso battle mode Teleportation and massive firepower to lead the battle. It's got a little bio here of Voltron Then you've got the other lions as well as a row beast and at two different versions of Voltron So let's go ahead and take a look at this lion The Duke has can I see your lion a minute buddy? Yeah, all right, so what we have here is You'll see it's a lot smaller Than the other black line Which I will do a comparison between the two at the end of this But as you can see you push his wings together and he does the claw attack The jaw does move up and down opens and closes There is a little bit of head movement up and down The ears do not fold out There is no neck movement whatsoever. There's a little bit of Waste movement not too much. It's on a slight It's on a slight rocker joint so it does rock back and forth a little bit You can't get the hips to kind of rock back and forth slightly not much The Knees are on a ratchet joint Pretty tight ratchet joint That's the only part of the legs That are on a ratchet these joints here Remain into the set in place. They don't move at all. No articulation The hips in here squeak. They do move. I believe it's a full They will rotate all the way around The tail is a very flimsy Plastic, but it is capable of snapping off. So I wouldn't move it too much It moves. That's about how high up it will move That's about how far down it'll move. So not a lot of movement The wings only do that flapping feature with for the claws And it looks like that's about it for articulation The paint quality doesn't look too bad.  Okay so Other than that, there's a little bit of paint bleeding, but it's not too bad Oh The knees here on these legs are ratchet join it as well So you can move those so you can move all four knees But those are the only four joints the rest of them are non-articulated But the rest of the paint quality isn't too bad. This this is like a If you play too rough with it, it will snap It's not top quality. It is meant for Kids to play with of course. So now let's go ahead and compare it with the 16-inch black line You want to hold this buddy? All right, let me grab mine. All right, so As you can see this is quite of a bit of a size difference this one is about Half the size of this one here This one has a lot more Articulation and whenever I did the review on this one yesterday. Hold that a minute. I was wrong these joints on the front paws Do move they're just very tight at first So you may want to play with them a bit Yeah, the John moves up and down I told them How do you like that toy? You give it a thumbs up Two thumbs up. Yep. Very playable for kids. Yep. All right This one's playable for grown-ups And that one's for kids, right? Yep.  I give this two thumbs up Highly recommend it for other kids to play with Yeah This runs about nine dollars at Walmart's This runs about thirty dollars So For myself and Duke this is comic getting and we'll see you next time Yeah Hey guys, if you like this video, make sure you hit that like button Maybe put a comment below and hit that subscribe button and be sure to head on over to our Facebook page links are in the description below You


In this training video, we're going to look at inserting a sub-process in Visio. So I've got an organizational chart here for a management structure team and I want to link the one shape for Joomki to the information services which is her own section with her own management team and structure. So from the main management organizational chart, I'd like to create the sub-process which in effect is a link which will then go straight to the information services. So I can do this by clicking on the shape that I want in this case the Joomki shape on the process. So within the process tab, it's a section called sub-process and we can click link to existing and I want to link to the information services and we've now linked. So if I now I've now clicked off the Joomki shape, if I hover over it I can see a hyperlink shape and all it tells me to do is click control and click. So control and click and there we go and it now links to the information services diagram page. If I wanted to remove the link, I can click on it and the sub-process can be removed so I can again link to existing, edit link and I can delete it. Now there is no link against it. I can also link it to other different documents or it could be two other different Visio documents or diagrams. So I could click on the shape, go to link to existing and browse to other documents. In this case I'm going to put the link back on to the information services and we'll test it again. So I'm going to link to information services, click off the shape, hover over it to look at the globe, click and control and click. There's the hand. When the hand comes then the hyperlink works and this is how sub-processes can be added to different types of diagrams. So here in this example with this high-level structure management team there could be sub-processes to all kind of all these different shapes. So I've just picked them and happened to pick in one and we've looked at removing the sub-processes as well and I've now finally put it back on but this could be applied to the whole of this organizational chart. So you could have sub-processes to every single shape if required but this completes the training video on sub- processes within Visio, whereby we inserted it, we tested it and we removed it. If you enjoyed this video make sure you like and subscribe to our channel. Hope to see you for the next tutorial and thanks for watching.


Common English verbs have. There are two ways to make the negative form of the verb have. Don't have or doesn't have, and haven't and hasn't. When have is the main verb meaning possession, then the negative form is don't have and doesn't have. For example, I have a car. I don't have a car. It's incorrect to say I haven't a car. Here's an example with has. She has a dog. She doesn't have a dog. It's incorrect to say she hasn't a dog. When have is the auxiliary verb, like in the present perfect, then use haven't and hasn't. I haven't finished my homework. She hasn't spoken to me for three weeks. Now let's learn the difference between have and have got. Either one can be used when have is the main verb in the case of possession. For example, do you have a pencil? Have you got a pencil? She has a lot of work to do. She's got a lot of work to do. These sentences are all correct. Have got can only be used in the case of possession when you own an object. You can't use have got in expressions like have breakfast or have fun because these are not objects that you possess. I have breakfast at 6 a.m. I had fun at the party. Thanks for watching English Tips from Espresso English. If you liked this video, please share it.


So, before we get started, sorry about the delay. We had a bit of a hiccup, but then the guys from ASA really helped us. Thank you very much for that and for rescuing the day. And I'll start by talking a bit about myself. Well, I'll only spend one minute talking about myself, really, and then go to the presentation. But my background is in computing. I work full-time as a software engineer at Intel. And my job mainly revolves around optimizing applications to run based on our platforms. And on the other side, I want to be an artist, but I feel like I don't yet have it. So I jump at every opportunity that I have to just speak with artists, spend time with artists, and hopefully one day I'll also be able to become an artist and develop cool stuff. So today I'm going to talk about Krita. Some of you might have interacted with the Krita application upstairs already. So Krita is open source free drawing application, painting application rather, but you can also use it for drawing. And we've done some work with Krita around HDR. And it's unfortunate that Krita guys are not here today, they were here yesterday, but I'm very pleased to say that this is one of the first worldwide leading applications to offer full HDR experience. And this has been recognized by VESA as well. So if you have time and you want to check it out, you can check out VESA's website. And a little bit about HDR, this might not be new. Most of people already here know what HDR is about. So it's about a combination of bright colors and deep blacks and wide color gamuts going away from the limited color range that Trivolis had in the past. And it sounds like it has been there for a long time, but that's not the case. When you start getting deeper into HDR, you discover there are a lot of fake HDR surround. And this is not one of those fake HDRs. And that's why we are very excited and happy to have worked with Krita on this. And I'll just quickly go into a quick distinction between HDR and HDR. So if you look at the picture being projected, on top we have HDR and below we have HDR. So HDR really strives to bring realism to art. So if you look at the steps involved in HDR, from capture, production and display, the final output looks almost the same as the original input. And that's what HDR really strives to do. And if you look at the top portion of the presentation, it's HDR. We see that the colors are dull, it's not a real replica from the original scene. So what we're trying to do is, you know, help artists to come up with artwork that is as real as technology can support today. And that's why we're having this discussion about HDR. And this is just, you know, a sample HDR versus HDR picture.  Projector is traditionally HDR. And this can just give you a hint of what it would feel like to experience true HDR. And later during the presentation, we will, you know, try to come up with something on the software itself. And then you guys can see it straight from the screen. But this just helps to give you a hint of how different HDR is from HDR.  And I now want to talk a little bit more about Krita in depth. And I've already, you know, interacted with a few guys in the room, and people, most people know Krita. How many people don't know Krita? Just by show of hands. Okay, so this specific slide is tailored for you guys. So Krita, you know, is a free open source painting application. You can download it from Krita.org. And it's made by artists for artists. And you know, just like most open source software, we have different people contributing to Krita code base. And in that sense, it has really become a popular painting application because the intended users participate in authoring of the software itself. And it's available on OS X right now. We have installation for Windows as well, and Linux. But then for this specific demo that we have today, the HDR bit, unfortunately only works on Windows at the moment. But we do have, you know, ongoing efforts to make it possible in Linux. And Intel is heavily focused on this. So it's just a matter of time we'll be having this in Linux as well. And what makes Krita so cool is that it supports different formats.  And these different file formats can be, you know, used or imported from other softwares, for instance Blender. And you know, you carry on from that point. And you can also just, you know, save them for the purpose of viewing them with any image viewer that is true HDR capable. So once you've done the HDR bit, it does not end there. You know, you still have the leeway to play with a file, port it, use it in other third party softwares, ETC, ETC. So this slide is just, you know, well HDR is there, so what about it? So I've been interacting with a few artists in the room. And some of you might see stuff on the slide that have come from you guys. And this is, you know, real feedback collected over the last two days from the artists who are interacting with Krita on the ASA stand-up sales. And you know, in the past, really, artists were limited. And because everything was in SDR. So what we're trying now to do is to move away from that and support it from a technology point of view. And right now, as an artist, you've got wider range of colors that you can play with. You don't have to compromise in the, you know, the tone of the blue you want. So for instance, if you want a specific blue that has specific light component, you should be able now to get that thanks to the application.  And there's so much new flexibility afforded by this.  And the one that strikes me the most is the one that came from an artist called Wolfera. She said that it feels like you're painting with new colors. So that's really cool because, you know, in the past, this was not possible, but this is now being made possible. And it can only mean that if you have several colors, new set of colors to play with, then the quality of your artwork improves dramatically. And then the other one that also really struck me is another one coming from an artist who says you can paint with the exact color that you want. So you don't have to compromise on the shade of color that you want. And yeah, you just get it done. So this also is another HDR sample. It doesn't look what it's supposed to look like because the setup is all HDR. But shortly I'll be showing you how it looks like on the display over there. And in terms of hardware support, I'll only talk about, there are different hardware out there that support HDR, full HDR experience, but I only talk about what I know and it happens to be what I know is what I've worked on most and it's on Intel platforms. So on Intel platforms, you could, you know, experience true HDR from our seventh generation processors and above. And just using the latest Intel graphics and Intel graphics drivers, you should be able to, you know, experience true HDR. So I'm going to shift gears a little bit and, you know, show you these. Or rather, I think the best thing will be to have an artist do it. Anyone who's volunteering, please. Thank you very much. Just paint on the screen. Lefties here. Are you guys able to see? So the idea is that, you know, you have different shades available of different colors, full HDR and, you know, you can play around with them. So I'll just, you know, make a few comments and some of the, you know, some of the challenges that we've encountered and how, you know, the open source community has been of great help to, you know, mitigate against those challenges. So for instance, you know, we bumped into the challenge of we could not be able to render OpenGL, you know, canvases on HDR, but then thanks to an open source library that is maintained by Google. It's called Angle. Maybe some of you have already, you know, played with it already. So this, you know, this library just translates OpenGL calls to direct 3D calls. And that's how we are able to make it possible in Windows. And yeah, I mean, it's just amazing that different pieces contributed by different persons result into the whole application working from end to end.  And it helps to untap a lot of unlocked potential. And, you know, that's how some of these things are possible today. So thank you very much for the guys contributing to open source projects.  So I'll open it up to questions. If anyone has a question they would like to ask. I'm happy to answer. So that's a good question. So the question is, he does not have a HDR display, but he would like to, you know, create content that is HDR. So I would love to say yes, it's possible. But with the current technologies that we have in Prita, for you to be able to, you know, to be able to even get to the point that you are doing work in HDR, the way that the, you know, the Windows operating system works is that it should be able to fast detect there is availability of HDR in your setup that you're working with. So if that availability is not there, then the HDR features are not turned on. So you cannot assume that, you know, since I just have an HDR display and I'm just working and I don't want to see it, I will get HDR features. So it's not yet possible. And probably because the solution itself is also in its infancy stages. But hopefully, you know, in the near future, these are some things that should be possible. What's possible is that if you have HDR content, if you have the problem, which is also a problem to some people, they, you know, artists will be like, okay, I want to make HDR content, but how would people in SDR environment view my content? So thanks to technology, that bit is handled.  So the HDR content, you know, fits to the, adapts to the current environment that you are running on. But the other way it's not yet possible. Yeah?  But if you go to the details, the devil is the details, if you go to the details, it does not adhere to HDR standards. For instance, you'll find the color space is using is not REC 2020, for instance. You'll find the beat of the, the beat is below 10 beat, and it looks like HDR, it's very good to the eye, but then it's not HDR. So for those kind of, when you capture something in your image, with your camera, if it's, like most cameras, I've seen phone cameras, that kind of image you are able to at least manipulate with Krita and import it. And what I've seen in the past, Krita guys are working on right now, is if you could take an officially SDR image and sort of translate it to sort of HDR to allow a user to be able to add HDR effects to an existing SDR image, that is possible, and then at the end, you know, it would be a new image in HDR. So that is still, you know, work in progress, something they are doing. But you know, a direct answer to your original question was like, there's no neat way to do it on Krita right now. Yeah. Yeah. Right now, when I try to merge HDRs, a lot of times, the problem I run into is there's no free open source tool that does the merge well. I think PT GUI is one of the commercial packages. The closest I've found is using PictureKnot, which is like an old, old one. And I think there might be some others, I don't know. Do you know if Krita is ever going to get like HDR merging, kind of like what Photoshop has, but that would actually work? To be honest, yeah, so the question was, does Krita support merging of HDR images so that in the end, what do you have? So you have different HDR images, and then you want to have one HDR image at the end. Yeah. Oh, I see. I don't know how Krita handles this, to be honest, but maybe this is something we can have a chat with the board, the Krita guys, and then we can ask. You know, the good thing about most of the feedback and most of the features that they implemented in Krita, they just come from people. Someone will say, can we do this, and they're working on it. So yeah. Is there any other question? Yes, sir. You are able to open the Krita file in your setup without the HDR display, and you're actually able to manipulate it how you want it. It's just that you are not able to add HDR effect to it. As much as it's HDR image with all the properties adhering to HDR standards, your environment has no way to detect that you have HDR capabilities, and as such, you will not see the HDR capabilities that Krita offer on that platform. But everything else will be, like for instance, if you received it and then saved it exactly, and then give it to someone who has got a HDR display, they should be able to steal, you know, experiences as it was done from a guy who had a new shell setup. You have another question? Yeah? If you're looking for open source HDR merging, then look for Greg Zaal HDR merge. He has a repository on GitHub, and he made a script with a nice simple user interface in Python that uses luminance HDR and uses Blender, and those two combine to give you a merged HDR output in EXR file. Last time I checked it worked for me, so it... Anyone who has a question? Okay. I think that's it. So if you want to see more cool HDR demos, and if you want to, you know, play with the application on your own, I welcome you to visit the ASA stand upstairs, and you can get the full experience. So thank you very much for your time, and see you shortly in a while in the corridors and everywhere.


Looks like the battle's been going on for a while the front wall still hold Some IELTS forces will be drawn there weakening his defenses elsewhere Hey, are you suggesting we sneak in good call? It's strategic right


I'm making respect How's it going everybody dots and I hear back with some more dragon ball fighters ranked matches this time playing a team of Tien Goku and Bardock, and we are already in the neutral sit down. I am Tien I'm just going to click buzz but this was a suggested team and I'm actually really excited to play some Bardock Tien is out front just because that was the order of the team, but I would not oh No, wait what oh Now when somebody hits you with a two H's and sparks, bro, that is that is never a good son.  I I thought I was dead. I thought I was cooked. Oh, I am cooked. All right, hold on.  I Blocked the wrong. I got crossed. I got crossed up. I blocked the wrong way. No, Tien. Okay, Tien's dead That's fine. I was I was looking forward to playing God Bardock a little bit more Damn, I can't believe I got crossed up there. That is fine though Because we're gonna take a two M starter a little bit a little bit rough for the damage Let's see if I can't get him in the corner. I'm gonna go for another one. Why not why not?  Ah That was a nice tag. It was a good tag. I wanted to try to catch him off guard with the EX Well, I thought I was getting I thought I was getting mixed they're not gonna lie. Oh Wait the tag from the EX cross it didn't end up working, but I actually I like what he was going for there I like the intuition. Let me try a little something like that That was I mean that was kind of cool. That was kind of cool The idea was cool Goku going behind me and then him switching out in a pain It's like I had panicked that would have been really cool Unfortunately, I literally think I'm too dumb to panic because I just didn't react at all But it is it was really cool, I will give it that while we block that no mash on time That's the one thing I'm good at all I have to do is hit square in that situation ABB gonna do what it has to do to get me back to the ground. I'm back to the ground again I'm just gonna land with a button. I That should have been a punish on my part. Damn. I Know I was sick. I was gonna say no way, but I gotta give it up. I'm dead right the scaling on that Yeah, oh no that actually scaled pretty harsh. I'm gonna spark here That was sick. I had it. I had it. I had to give it up I was about to be like what but I know I know if I was him.  Oh damn. I'm just gonna go for it Spin on him. Why not? Bardock oh We're still alive. Hey, we're dead. I didn't think I didn't think we were living in any way Okay, Bardock did more than enough dude Goku Goku can lock this up if Goku can't lock it up Then I unfortunately just have failed, but I have faith in Goku We're gonna keep corner with the level three here. So you're gonna see me stay base Super Saiyan I know it does less damage, but I want the corner. I want him to feel the pressure He needs to I want him to think oh man I got a match to get out of this because when he matches that's when I hit him over the head and I wrap it up Dude, that's just when I wrap it up So we're gonna take game one with the suggested team Goku not gonna get to do the thumbs up Unfortunately, I do hear the see you later. We're moving on to the next one I want to do more with the TN knee Into mix. That's kind of what a high-low pressure. Anyway, that's kind of what I'm gonna go for here in this second one Bardock nah, okay. We're just gonna get a clean hit then that's fine. I will take a clean hit I'm not gonna complain back down to the ground back up Chow Choo do your thing. Oh Don't why am I doing that? What?    I should have been more ready My help are kind of leaking right now. Wait a minute wait a minute TN did not deserve all of this. I Was mashing it's true the rumors true. I was mashing. I did deserve this TN didn't deserve it though TN didn't Ah TN don't say that TN saying he's no match, bro. That was my bad TN. Oh The charging elbow. I did not think he'd start it off with the heater. Oh Wow, okay. All right. All right To touch scenario to touch an area. Do we let him get the two touch? Nah nah, we kind of we cut him off mid-sentence there.  I'm terrible Nice Maybe again seen it before I'm just holding down tech at this point. I'm trying to catch a wake-up mass All right, just get them off me reset I'll take it man. I remember what I used to know the Bardock spark me back in the day I was not gonna go for that there. That was that was not happening. Oh wait.  Just take the 6m. Okay. I'll just take the follow-up to the 6m Oh, I would have choked if he didn't die right there. I would have choked. I'll take it though. Oh Keyblast I should have expected it for some reason. I thought he would try to read me with the jumping grab I was not gonna give that to him. I wanted to back away. I just wanted personal space using TN against me Oh, no My own teammate not TN. Dude. He didn't even deserve to go out.  Yeah, I'll match against my own son. I don't even know who that guy was Yeah, look at me mash it. Come here.  Come here. Oh Now Bardock doesn't spare anybody Let's go I'm Bardock. I'm just playing Bardock right now. We just Bardock II. I just mashed against my own son I'll take out super baby two for all I care. He's gonna spark. Oh, no He was supposed to why did I do that? Man? It wasn't even worth the read wasn't even worth The read wasn't even worth it wouldn't it wouldn't even have killed. No, it probably would have killed But still not worth it. We drop it. Drop it. Drop it.  I'm not gonna hold it against myself. You know, I Wanted the big plays I wanted the dreams. I try to mash there. I'm going for it Let's go. I'm taking it. I'm taking it all the way to the bank. I'm taking it all the way to the bank Okay, that's a Anime, let's go. I love a bit of anime in the morning Let's go a bit of anime with my dragon ball fighters. I'll take a chaotzu hold them down. Okay. That's fine Don't on rain. I I can't believe I dropped that. I thought I had that don't on rain, man man, Tina's My health bar be nothing, bro. I don't even know where my health bar be I don't know where I'd be spending my health bar budget at we're gonna switch to you and out here with the the super Probably with Bardock honestly, well, I just want to play Bardock today Everything top it off with a bit of everything. You know, you got to have just a Smidge of everything. All right now. Let's get super baby. I'm just jumping up in the air.  I'm done being afraid of the reeds. Oh Oh Man, it was such a good bit though Nice heavy. I I don't even know why I stuck my leg out there. I was clean level three on top of it all Throwing the orb Do I wake up mash? I'm doing it. I'm doing it, dude. I'm playing Bardock I don't feel like losing today. That's just that's just a little Bardock word of wisdom I feel like dropping combos though. I could I could drop combos all day. I Could drop combos and never get tired of it I'm just mashing. Let's go. We are out here bar dog. Let me get a bit more of the Bardock in my system That's all I needed a dash of Bardock. Who's next Broly? Who's next Broly? Come here jump. Oh No, oh No, he hit me again too quickly. I tried it. I try to do another I try to do another round of Bardock I'll be over here if you need me That's fine Bardock was he I was I was doing it up with Bardock Violent a 2 ms. He dead Not like that. He's not oh It worked that time it worked the EX catch them off guard strategy You know normally you just get hit out of it, but I'll take it when it works Great gate there. I'm excited for the next one. I feel dude the Bardock is coursing through my veins today I'm ready dude. I got the squares in my eyes and we are back. I'm just gonna yeah I'm just gonna switch in a bar. Oh, I thought I had it. I thought I had it Get down here get down here right now young man All right, well, we're just gonna have to block string this one out. Yeah, let him take his turn Nothing we could do there. Oh we dropped it Why I did that instead of anything else I will never truly know I'm gonna do it twice. I'm gonna do it twice in that scenario if I go quiet Just know I'm thinking about doing it twice.  It's TN that good. Oh TN you just packed a yee. Oh my good TN just does damage for no reason Why did you did not have to do that much? I mean, I'm happy you did don't get me wrong. I I ruin that I did not mean to fat-finger the EX out Gallagun the blue Gallagun. All right. Oh, I'm getting I'm getting what in the what oh my I'm just getting tossed out of the air today Wow, I am I am just getting taught. All right. All right another six M Wow Man, that was I had the opportunity to click a button there, too But I wanted to go low so I held back, but then I got kicked in the face We are dead here one spirit sword is gonna clean this up and now we're actually behind And we threw away a good lead with that one threw away a good lady. I thought he was gonna jump at me.  Oh, man. I didn't know you were gonna get hit if I would have known that I would have mixed up the whole strategy I'm keeping corner. I'm keeping corner. You're just getting the normal super saying you're getting the normal super calm Yeah, all right. He lost parking. He's in the corner. I'm gonna go low. Oh Beautiful, baby. Beautiful. Let me just drop the combo because I'm I'm gonna do it again.  I'm not doing it again. I'll just do the normal combo this time I'm not doing I can't I can't fail again. No way Okay, I couldn't fail again. I was done. I was done. I was cooked. All right. All right. We're moving on We're moving on. We're moving on. Hold on. Do you want to jump jump? Oh Oh, I still got tossed out of the air. Damn. I can't I can't fly for two seconds. Ah That was that was good. I should have expected it. He didn't go for one all game. I Was I was do a dragon rush. I was do a dragon rush. All right, Super Saiyan Goku coming in Kind of just want to keep the peace just stay back. Oh No He thought I was plus there. I was negative. I was I was way out of line, dude I just held back. I was just hoping he didn't hit me in time I did not think he would commit to the reflect, but I'll take it.  I know what it feels like to whiff a reflect. Thank you that that was a weird That's an aggressive. Thank you stamp. Is he powering up? Oh I'll take the conversion a little loose.  So you don't punch me. Thank you Go for the grab. That's fine, too.  I didn't expect it that time. I was already going for my setup on block. I Was already oh wait I'm a banished into the Jito. I you guys didn't let me finish my sentence. I Accomplished what I wanted to do. I Jump I should have done bar doc first. Oh Still managed to get the best out of it though All right No You woke up tech for that No, just let me switch out with go-koo damn it. I was trying to do a a special tag in the go-koo That's why you kept seeing me throw out the do it on rain. I was gonna do it on rain doc a go-koo tag Yeah docu tag. Oh, man Damn this guy. Okay. Okay. Okay. I get it. I get it My face is more than bruised enough. I've learned I will stop throwing things out after I hit you I go-koo Oh my god, don't yank me out of the air. He tried it. He tried it though. I'm doing it again I'm literally doing it again. I'm just doing it at this point. I'm just I'm just all over it Damn it. I knew that combo drops. I was going for the reset. Oh Why'd I duck I should not have crouched I should have blocked that overhead that one should have come naturally We're cooked here. We are cooked here. Wait. No, we're not Don't yank me out of the air. Oh, why did I switch out? Why did I switch out? No the blue health It was out of fear if we're being honest. It was out of fear. You know what? I actually gained a decent bit of it back Well, you thought I was gonna switch out. No, he didn't okay And go GD. You kind of got a hitbox on you. I gotta stop jumping Okay, that was kind of that was kind of quick. That was kind of quick.  That was kind of man. He was fast. He was fast Hey, I didn't get killed for that that time. I was plus I He was like, all right, well last time I got punished so No, that time I was plus The reason I wasn't plus last time is because I hit him at too high so I had longer to fall But that time I was oh I thought he was going for command grab. I got hit by that super dash. Wow. We're extending that.  Does that hit? I was gonna say that combo went on for like eight.  Oh, no, and then I got punched and my lights went out And that's how I got hit with two. Thank you stamps. He is powering up, dude. I knew it was a bad omen That wouldn't pun not intended on that one Cousy just hold him down Just hold them down. We're just play it. This is classic fighters This is vintage put a VHS filter over this. This is a vintage as it gets All right, you I go who's dead. Thank goodness. We I was getting cooked get him out of here. I was getting cooked That was a bit cheaper than I expected to I guess TN hit him a lot harder. Whoo. All right, does he start with the kick on this? I Knew he would start with a Vegeta assist. That's why I superdash very quickly because I was like nah If you think I'm getting a block what what is wrong with me? Let's go chow-chew always on the lookout Chow-chew assist. I love running that guy. Chow-chews. This is so good.  I got you for three minutes. I Got you for three minutes. I'm gonna use all three of them. Oh my goodness decent bit of Dragon Balls in sight and we got it to oh my This could have been bad, dude I could I could I cook them and what I wanted to do there was landed to a spark and then go into a double super But that wasn't that wasn't the play. Oh I'm vanishing then don't all right I'll do it again. Don't on right. Yeah, I hit you with the tag. Oh Don't don't test me. I will mash. I will mash like nobody's business. I'm out of their ejector button I'm gonna make you respect it Did that was chow-chews fault? That was chow-chew. Haha chow-chew No chow-chew why? Chow-chew why dude?   We had to get Chow-chew You can't do that. I could I didn't even think of that as an outcub I was like, oh, I got him now and then chow-chew came along dude That's you got to make up for this dude You know how to do that up never mind chow-chew games over you don't have to do it We all know what I was gonna say but just in case we don't I'm gonna leave it at that Hopefully you enjoyed this video Let me know any more suggested teams you'd like to see in fighters down below in the comment section Make sure to like button and subscribe to the channel if you like videos like this and want to see keep coming out You'd also check out more videos on your screen right now other than that I have been doubted away, and I will see you in the next one


Hey guys one of the worst things about being a budget rider is actually you never have time to keep your bike with Maintenance as it should and one of the worst things that I still have to do on my bike and I think since I got it is remove the axle from the swing arm and Change the bearings because they are completely busted and It's gonna be a real joy to actually try to take it out. So let's see how hard it's gonna be I Take just a note out. I Can only imagine how well it's going to come out the axle Yeah, there's always one wanker of a bolt that ruins everything one thing that people actually this regard Quite often is when does this assembling anything on a bike take advantage and clean everything like right now? I'm just cleaning like everything with a little d4e just to take the grid out Just to keep it nice and clean You take a bath once in a while. So does the bike should And since I'm at it, I'm gonna take apart all the bushings from the swing arm and as well from the bike The linkages they seem to be well, they should get some treatment and these ones From the prox bearing kit And I'm gonna loop the loop up all of these Since I'm at it. So let's go since these are Needle bearings. It's always interesting to see if there are no needles actually broken and coming out from the bearing So luckily there's none broken And so I'm just kind of sweeping the old grease out to Get the new one Don't hesitate on putting too much So we're here. She's driven and they will help me To get you pretty much have to use one of these to take them out And to put them back again Okay changing for the prox ones Never tried them before first. I'm gonna try them. So let's see how they will Let's see if they are any good. So after going to she's driven to put the new any grease on it So that's what I'm going to take care of right now. Like the other one Put as much as you can It's never too much For the portuguese fans We said As simple as just like changing the bearings can be really time consuming But it's always worth it when you have the bike ready for the weekend. So now Let's rip. I was just Tightening the whole bike to be ready for the weekend and this happened used bikes