727 research outputs found
MoguÄnosti kontrole i reguliranja soljenja sira kaÄkavalja
Izvjesna ispitivanja soljenja kaÄkavalja pokazala su da se fiziÄko-kemijski procesi kao i izvjesne promjene u siru pri soljenju odvijaju po odreÄenim zakonitostima. TakoÄer se pokazalo da bi se izvjesne utvrÄene zakonitosti mogle praktiÄno primijeniti u cilju kontrole i reguliranja soljenja sira
Osvrt na kvalitetu i asortiman mlijeÄnih proizvoda na XXXI. meÄunarodnom poljoprivrednom sajmu u Novom Sadu
Na tradicionalnom ocjenjivanju mlijeÄnih proizvoda povodom XXXI. MeÄunarodnog poljoprivrednog sajma u Novom Sadu uÄestvovalo je 25 mljekarskih organizacija s preko 30 raznih vrsta mlijeÄnih proizvoda. Ukupno je ocijenjen 141 uzorak
Razvoj i unapreÄenje tehnologije somborskog sira
U asortimanu domaÄih mekanih sireva somborski sir zauzima veoma interesantno mjesto s obzirom na moguÄnosti proÅ”irenja njegove proizvodnje i unapreÄenja njegove tehnologije. Ako se izuzmu beli mekani sirevi onda su u naÅ”oj zemlji asortiman i obim proizvodnje mekanih sireva priliÄno oskudni. Zbog toga je znaÄaj somborskog sira oÄit iako ne toliko po obimu proizvodnje koliko po tome Å”to bi mogao poslužiti kao polazna baza za razradu nekog modernijeg varijeteta ovog sira
Reguliranje tehnoloŔkog procesa kod prerade silažnog mlijeka u sireve
TehnoloÅ”kim mjerama može se samo djelomiÄno poboljÅ”ati kvaliteta silaznog mlijeka i poveÄati njegova pogodnost za preradu. TakoÄer i reguliranjem tehnoloÅ”kog režima prerade takvog mlijeka u sireve ne mogu se ispraviti svi njegovi nedostaci
Erratum to āInteger Codes Correcting Burst and Random Asymmetric Errors within a Byteā [J. Franklin Inst. 355 (2018) 981ā996] (S0016003218302722) (10.1016/j.jfranklin.2018.04.034))
An equation appearing on page 992 of the article is incorrect. The incorrect equation appearing thus: [Formula presented] Should in fact appear thus: [Formula presented] Also, a sentence appearing on page 922 is incorrect. The following statement: [Formula presented] Should read thus: ā¦one code with code rate 0.9922 has theoretical throughput above 32 Gbps. Thus, it could be candidate for use in ONWOAs operating at 32 Gbps (e.g. 32G Fibre Channel network). Ā© 2018The contribution corrects an equation from the paper: Maharajan, C., Raja, R., Cao, J., Rajchakit, G., 2018. Novel global robust exponential stability criterion for uncertain inertial-type BAM neural networks with discrete and distributed time-varying delays via Lagrange sense. Journal of the Franklin Institute 355, 4727ā4754. [https://doi.org/10.1016/j.jfranklin.2018.04.034
Integer Codes Correcting Spotty Byte Asymmetric Errors
In short-range optical networks, channel errors occur due to energy losses. Upon transmission, they mostly manifest themselves as spotty byte asymmetric errors. In this letter, we present a class of codes that can correct these errors. The presented codes use integer and lookup table operations, which make them suitable for software implementation. In addition, if needed, the proposed codes can be interleaved without delay and without using any additional hardware
Integer Codes Correcting High-Density Byte Asymmetric Errors
In optical networks without optical amplifiers, the number of received photons never exceeds the number of sent ones. Hence, upon transmission, only asymmetric (1 ā 0) errors can occur. Motivated by this fact, in this letter, we present a class of integer codes capable of correcting high-density asymmetric errors within a b-bit byte. Unlike classical codes, these codes use integer and lookup table operations. As a result, they can be implemented āfor free,ā i.e., without modifying the network hardware.This is the peer-reviewed manuscript of the article: Radonjic, A., Vujicic, V., 2017. Integer Codes Correcting High-Density Byte Asymmetric Errors. IEEE Communications Letters 21, 694ā697. [https://doi.org/10.1109/LCOMM.2016.2644661
Logarithmic time encoding and decoding of integer error control codes
One of the most important characteristics of all error control codes (ECCs) is the complexity of the encoding/decoding algorithms. Today, there are many ECCs that can correct multiple bit errors, but at the price of high encoding/decoding complexity. Among the rare exceptions are integer ECCs (IECCs), whose serial encoding/decoding algorithms run in O(n) time, where n is the codeword length. In this article, we show that IECCs can be encoded/decoded even faster, that is, that their parallel encoding/decoding algorithms have O(log2n) time complexity
Kvalitet i asortiman mlijeÄnih proizvoda na XXX. MeÄunarodnom poljoprivrednom sajmu u Novom Sadu
Na ovogodiÅ”njem ocjenjivanju mlijeÄnih proizvoda povodom XXX. MeÄunarodnog poljoprivrednog sajma u Novom Sadu uÄestvovale su 24 mljekarske organizacije sa 35 vrsta mlijeÄnih proizvoda
- ā¦