196,105 research outputs found
INFORMATION SYSTEM FOR CONTROL OF BIOGAS PLANT
No full textV diplomski nalogi je predstavljena izgradnja informacijske rešitve za vodenje bioplinske naprave. Podjetje se ukvarja s predelavo odpadnih surovin in iz njih pridobiva bioplin.
Predstavljene so smernice za nadaljnji razvoj tehnologije vodenja in avtomatizacije na področju bioplinskih naprav, ki so rezultat poglobljene analize procesa iz pogleda avtomatizacije in varnosti. Za olajšanje faze predpriprave in nadzora smo razvili informacijski sistem, za pripravljanje receptur in podatkovno bazo za hranjenje podatkov, ki so za obvladovanje procesa ključnega pomena. Sistem je zamenjal »excelove«
preglednice, ter ročno izpolnjene tabele, kar je olajšalo komunikacijo med zaposlenimi, predvsem pa omogočijo večjo točnost podatkov in s tem izboljšal varnost procesa.In this diploma work we introduce the development of basic information for conduct of biogas plant. A company is involved in processing waste material and producing biogas.
We represent trends for future development of technology of conduct and automation on the area of biogas plants which are the result of process analysis from the view of automation and security. To ease the preparation and control we developed information system to prepare recipes and data base for information storage which are crucial for controlling the process. System has changed excel and manually made tables which made ommunication much easier among employees and what is more important the punctuality of information is better and also with that connected security of the process
Bayes decoding for discrete linear channels with semantic value of information
No full textIn this work we explore the decoding process when information words have different semantic values. In that setting, we introduce a convenient loss function that allows us to express the overall performance of a decoding scheme for discrete channels, switching the usual goal of minimizing the error probability to that of minimizing the expected loss. © 2012 American Institute of Physics.In this work we explore the decoding process when information words have different semantic values. In that setting, we introduce a convenient loss function that allows us to express the overall performance of a decoding scheme for discrete channels, swit14901126134sem informaçãosem informaçãoAnderson, J., Firer, M., (2011) Classification of poset-block spaces admitting MacWilliams-type identity -preprintAsh, R., Information Theory (1965) John Wiley & Sons, Inc.Barg, A., Purkayastha, P., Bounds on ordered codes and orthogonal arrays (2009) MoscowMathematical Journal, 9 (2), pp. 211-243Berlekamp, E.R., Mceliece, R.J., Tilborg, H.C.A.V., On the Inherent Intractability of Certain Coding Problems (1978) IEEE Transactions on Information Theory, 24 (3)Borade, S., Nakiboǧlu, B., Zheng, L., Unequal error protection: an information-theoretic perspective (2009) IEEE Transactions on Information Theory, 55 (12), pp. 5511-5539Brualdi, R., Graves, J.S., Lawrence, M., Codes with a poset metric (1995) Discrete Mathematics, 147, pp. 57-72Cover, T., Thomas, J.A., Elements of Information Theory (2006) John Wiley & SonsFelix, L.V., Firer, M., Canonical-Systematic Form of Hierarchical Codes (2011) pre-printHo, K.P., Kahn, J.M., Imagen Transmission over Noisy Channels Using Multicarrier Modulation (1997) Signal Processing: Image Comunication, 9, pp. 159-169Hyun, J.Y., Kim, H.K., The poset structures admitting the extended binary Hamming code to be a perfect code (2004) Discrete Mathematics, 288, pp. 37-47Hyun, J.Y., Kim, H.K., Maximum distance separable poset codes (2008) Designs, Codes and Cryptography, 48 (3), pp. 247-261Jang, C., Kim, H.K., Oh, D.Y., Rho, Y., The poset structures admitting the extended binary Golay code to be a perfect code (2008) Discrete Mathematics, 308, pp. 4057-4068Juba, B., Sudan, M., Universal semantics of Communication I - STOC'08 Proceedings of the 40th annual (2008) ACM symposium on Theory of computing, pp. 123-132Kim, H.K., Oh, D.Y., A Classification of Poset Admitting the MacWilliams Identity (2005) IEEE Transactions on Information Theory, 51 (4), pp. 1424-1431Kolmogorov, A.N., On the Shannon theory of information in the case of continuous signals (1956) IEEE Transactions on Information Theory, , SeptemberMasnick, B., Wolf, J., On linear unequal error protection codes (1967) IEEE Transactions on Information Theory, 3 (4), pp. 600-607Moura, A.D.O., Firer, M., Duality for poset codes (2010) IEEE Transactions on Information Theory, 56 (7), pp. 3180-3186Panek, L., Firer, M., Kim, H.K., Hyun, J.Y., Groups of linear isometries on poset structures (2008) Discrete Mathematics, 308, pp. 4116-4123Panek, L., Firer, M., Alves, M.M.S., Symmetry groups of Rosenbloom-Tsfasman spaces (2009) Discrete Mathematics, 309, pp. 763-771Panek, L., Firer, M., Alves, M.M.S., Classification of Niederreiter-Rosenbloom-Tsfasman Block Codes (2010) IEEE Transactions on Information Theory, 56 (10), pp. 5207-5216Parmigiani, G., Inoue, L.Y., Decision Theory, Principles and Approaches (2009) Wiley, Cornwall, , UKYu Rosenbloom, M., Tsfasman, M.A., Codes for the m-metric (1997) Problems of Information Transmission, 33, pp. 45-52Sason, I., Shamai, S., Performance Analysis of Linear Codes under Maximum-Likelihood Decoding (2006) A Tutorial - Foundations and Trends in Communication and Information Theory, 3 (1-2), pp. 1-222Shannon, C.E., A mathematical theory of communication (1948) Bell System Tech. J., 27, pp. 379-423Shannon, C.E., Coding theorems for a discrete source with a fidelity criterion (1959) IRE Nat. Conv. Rec., , marchSchröder, B.S.W., Ordered Sets - An Introduction (2003) BirkhäuserTavildar, S., Viswanath, P., Approximately universal codes over slow-fading channels (2006) IEEE Transactions on Information Theory, 52 (7), pp. 3233-3258XI Brazilian Meeting on Bayesian StatisticsSignificant part of this work was developed during the summer of 2011, when M. Firer was at the Centre Interfacultaire Bernoulli at EPFL, Lausanne, Switzerland, supported by the Swiss National Science Foundation, to which he deeply thanks. The second au
Catholic Comments Podcast.
No full textProfessor Christine Firer Hinze of Fordham University discussion the relationship between Catholic Social Teaching and the U. S. Economy
Aspects of nurse responsibilities with consideration of patients\u27 rights and obligations
No full textIzhodišča in namen: V magistrskem delu smo preučevali različne vrste odgovornosti medicinske sestre na delovnem mestu in pravne podlage za varstvo pacientovih pravic. Namen raziskave je bil ugotoviti, kako dobro medicinske sestre poznajo vrste odgovornosti pri svojem delu, v kolikšni meri to upoštevajo in kako svoje znanje uporabljajo za izpolnjevanje pravic in dolžnosti pacientov ter ali se pri tem zavedajo svoje odgovornosti.
Raziskovalna metodologija in metode: Uporabljena je bila kvantitativna metodologija raziskovanja. Podatke smo zbirali s tehniko anketiranja medicinskih sester v kliničnem okolju. Za obdelavo podatkov smo uporabili računalniške programe Microsoft Word, Microsoft Excel in SPSS.
Rezultati: Ugotovili smo, da večina anketiranih medicinskih sester pozna vrste odgovornosti pri svojem delu. Anketirani najbolje poznajo osebno-moralno odgovornost, najmanj pa kazensko odgovornost. Prav tako rezultati kažejo, da večina medicinskih sester pozna vrste odgovornosti pri svojem delu. Glede profesionalne usposobljenosti smo potrdili, da imajo anketirane medicinske sestre z več leti delovnih izkušenj tudi več znanja iz področja odgovornosti. Z raziskavo smo potrdili, da medicinske sestre z višjo izobrazbo bolje poznajo vse vrste odgovornosti. Ugotovili smo, da si anketirane medicinske sestre le v manjšem odstotku želijo več izobraževanj na tem področju.
Diskusija in zaključek: Poznavanje odgovornosti je zelo pomemben vidik pri delu medicinskih sester in drugih zdravstvenih delavcev. Zaradi poznavanja različnih vrst odgovornosti pri delu medicinske sestre zagotavljajo pravice pacientom do kakovostne zdravstvene nege in oskrbe. Ob morebitnih kršitvah pravic pacientov pa je vzpostavljena pot, ki vodi k reševanju le-teh.The starting point and the purpose of the master thesis: In the master thesis, we studied different types of nurse’s responsibilities at the workplace and the legal basis for the protection of patient’s rights. We’ve been figuring out how well nurses know the types of responsibilities, how they use their knowledge to fulfill the rights and duties of patients, and whether they are aware of their responsibilities.
Research methodology and methods: Quantitative research methodology was used. We collected data with the technique of nurse surveys in a clinical setting. We used computer programs Microsoft Word, Microsoft Excel and SPSS to process data.
Results: The results of the quantitative survey show that health professionals know the types of responsibility in their work place and have the best knowledge of personal-moral responsibility and at least criminal responsibility. About professional competence, it has been shown that health professionals with several years of work experience also have more knowledge in responsibility. With research, we confirmed that nurses with a higher education have better knowledge of all types of responsibility. The results of the survey show that health professionals would like in smaller percentage more education in this field.
Discussion and conclusion: Knowledge of responsibility is a very important aspect in the work of nurses and other healthcare professionals. Due to knowledge of different types of work responsibilities, nurses provide patients with the right to quality nursing and care. In the event of possible violations of patient’s rights, a path is in place that leads to their resolution
Covering Number For Reflections In Trees
No full textWe define a reflection in a tree to be an involutive automorphism whose set of fixed points is a geodesic, and we prove that, for the case of a homogeneous tree of even degree, the group of even automorphisms may be covered by at most seven reflections. © de Gruyter 2008.116869877Möller, R., The automorphism groups of regular trees (1991) J. London Math. Soc. (2), 43, pp. 236-252Moran, G., Trees and the bireflection property (1982) Israel J. Math, 41, pp. 244-260Serre, J.-P., (1980) Trees, , Springer-VerlagH. L. Talpo and M. Firer. Trees and reflection groups. Electr. J. Combin. 12 (2005), R. 16Znoiko, D.V., The automorphism groups of regular trees (1977) Math. USSR Sb, 32, pp. 109-11
Canonical-systematic form for codes in hierarchical poset metrics
No full textIn this work we present a canonical-systematic form of a generator matrix for linear codes whith respect to a hierarchical poset metric on the linear space F n q. We show that up to a linear isometry any such code is equivalent to the direct sum of codes with smaller dimensions. The canonical-systematic form enables to exhibit simple expressions for the generalized minimal weights (in the sense defined by Wei), the packing radius of the code, characterization of perfect codes and also syndrome decoding algorithm that has (in general) exponential gain when compared to usual syndrome decoding. © 2012 AIMS.In this work we present a canonical-systematic form of a generator matrix for linear codes whith respect to a hierarchical poset metric on the linear space F n q. We show that up to a linear isometry any such code is equivalent to the direct sum of codes63315328FAPESP - FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULO07/56052-8Alves, M.M.S., Panek, L., Firer, M., Error-block codes and poset metrics (2008) Adv. Math. Commun., 2, pp. 95-111Alves, M.M.S., Panek, L., Firer, M., Classification of Niederreiter-Rosenbloom-Tsfasmanblock codes (2010) IEEE Trans. Inform. Theory, 56, pp. 5207-5216Brualdi, R., Graves, J.S., Lawrence, M., Codes with a poset metric (1995) Discrete Math., 147, pp. 57-72Hardy, G.H., Ramanujan's work on partitions and Asymptotic theory of partitions (1999) Ramanujan: Twelve Lectures on Subjects Suggested by His Life and Work, pp. 83-100+113-131. , Chs. 6and 8 in 3 rd edition, Chelsea, New YorkKim, H.K., Oh, D.Y., A classification of posets admitting the MacWilliams identity (2005) IEEE Trans. Inform. Theory, 51, pp. 1424-1431Niederreiter, H., A combinatorial problem for vector spaces over finite fields (1991) Discrete Math., 96, pp. 221-228Niederreiter, H., Orthogonal array and other combinatorial aspects in the theory of uniformpoint distributions in unit cubes (1992) Discrete Math, 106-107, pp. 361-367Panek, L., Firer, M., Kim, H.K., Hyun, J.Y., Groups of linear isometries on poset struc-tures (2008) Discrete Math., 308, pp. 4116-4123Rosenbloom, M.Y., Tsfasman, M.A., Codes for the m-metric (1997) Prob. Inform. Transm., 33, pp. 45-52Wei, V.K., Generalized Hamming weights for linear codes (1991) IEEE Trans. Inform. Theory, 37, pp. 1412-141
Coding and decoding schemes tailor made for image transmission
No full textIn this work we explore possibilities for coding and decoding tailor made for image transmission. To do so, we introduce a loss function that expresses the overall performace of a coding scheme for discrete channels and exchange the usual goal of minimizing the error probability to that of minimizing the expected loss. In this environment we explore the possibilities of using poset-decoders to make a message-wise unequal error protection (UEP), where the most valuable information is protected by placing in its proximity information words that differ by small valued information. We give explicit examples, done for scale-of-gray images, including visual simulations for the BSMC. © 2013 IEEE.In this work we explore possibilities for coding and decoding tailor made for image transmission. To do so, we introduce a loss function that expresses the overall performace of a coding scheme for discrete channels and exchange the usual goal of minimiziFAPESP - FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULO2007/ 56052-8Barg, A., Purkayastha, P., Bounds on ordered codes and orthogonal arrays (2009) Moscow Mathematical Journal, 9 (2), pp. 211-243Berlekamp, E.R., McEliece, R.J., Van Tilborg, H.C.A., On the Inherent Intractability of Certain Coding Problems (1978) IEEE Transactions on Information Theory, 24 (3)Borade, S., Nakiboǧlu, B., Zheng, L., Unequal error protection: An information-theoretic perspective (2009) IEEE Transactions on Information Theory, 55 (12), pp. 5511-5539Brualdi, R., Graves, J.S., Lawrence, M., Codes with a poset metric (1995) Discrete Mathematics, 147, pp. 57-72Cover, T., Thomas, J.A., (2006) Elements of Information Theory, , John Wiley & SonsFirer, M., Panek, L., Ramos Rifo, L.L., (2011) Coding in the Presence of Semantic Value of Information: Unequal Error Protection Using Poset Decoders, , arXiv:1108.3832 [cs.IT]Felix, L.V., Firer, M., Canonical-Systematic Form of Hierarchical Codes (2012) Advances in Mathematics of Communications, 6 (3), pp. 315-328Po Ho, K., Kahn, J.M., Image Transmission over Noisy Channels Using Multicarrier Modulation (1997) Signal Processing: Image Communication, 9, pp. 159-169Hyun, J.Y., Kim, H.K., The poset structures admitting the extended binary Hamming code to be a perfect code (2004) Discrete Mathematics, 288, pp. 37-47Hyun, J.Y., Kim, H.K., Maximum distance separable poset codes (2008) Designs, Codes and Cryptography, 48 (3), pp. 247-261Jang, C., Kim, H.K., Oh, D.Y., Rho, Y., The poset structures admitting the extended binary Golay code to be a perfect code (2008) Discrete Mathematics, 308, pp. 4057-4068Kim, H.K., Oh, D.Y., A Classification of Poset Admitting the MacWilliams Identity (2005) IEEE Transactions on Information Theory, 51 (4), pp. 1424-1431Kolmogorov, A.N., On the Shannon theory of information in the case of continuous signals (1956) IEEE Transactions on Information Theory, , SeptemberMasnick, B., Wolf, J., On linear unequal error protection codes (1967) IEEE Transactions on Information Theory, 3 (4), pp. 600-607De Oliveira Moura, A., Firer, M., Duality for poset codes (2010) IEEE Transactions on Information Theory, 56 (7), pp. 3180-3186Panek, L., Firer, M., Kim, H.K., Hyun, J.Y., Groups of linear isometries on poset structures (2008) Discrete Mathematics, 308, pp. 4116-4123Panek, L., Firer, M., Alves, M.M.S., Symmetry groups of Rosenbloom-Tsfasman spaces (2009) Discrete Mathematics, 309, pp. 763-771Panek, L., Firer, M., Alves, M.M.S., Classification of Niederreiter-Rosenbloom-Tsfasman Block Codes (2010) IEEE Transactions on Information Theory, 56 (10), pp. 5207-5216Pinheiro, J.A., Firer, M., Classification of poset-block spaces admitting MacWilliams-type identity Information Theory, IEEE Transactions on, PP (99), p. 1Parmigiani, G., Inoue, L.Y., (2009) Decision Theory, Principles and Approaches, , Wiley, Cornwall, UKRosenbloom, M.Y., Tsfasman, M.A., Codes for the m-metric (1997) Problems of Information Transmission, 33, pp. 45-52Shannon, C.E., A mathematical theory of communication (1948) Bell System Tech. J., 27, pp. 379-423Shannon, C.E., Coding theorems for a discrete source with a fidelity criterion (1959) IRE Nat. Conv. Rec., , marchSchröder, B.S.W., (2003) Ordered Sets - An Introduction, , BirkhäuserTavildar, S., Viswanath, P., Approximately universal codes over slowfading channels (2006) IEEE Transactions on Information Theory, 52 (7), pp. 3233-3258Information Theory and Applications Workshop (ITA
Counting Domains In {p,q} Tessellations
No full textFor any given regular {p,q} tessellation in the hyperbolic plane, we compute the number of vertices and tiles to be found as we distance from a given point, enabling a complete characterization of the asymptotic behavior. © 2003 Elsevier Science Ltd. All rights reserved.163323328Forney, Jr.G.D., Geometrically uniform codes (1991) IEEE Trams. Inform. Theory, 37, pp. 1241-1260Beardon, A.F., (1982) The Geometry of Discrete Groups, , Springer-VerlagDa Silva, E.B., Palazzo, Jr.R., Costa, S.R., Improving the performance of asymmetric M-PAM signal constellations in Euclidean space by embedding them in hyperbolic space (1998) Proceedings 1998 IEEE Information Theory Workshop, pp. 98-99. , June 22-26 Killarney, IrelandDa Silva, E.B., Palazzo, Jr.R., M-PSK signal constellations in hyperbolic space achieving better performance than the M-PSK signal constellations in Euclidean space (1999) 1999 IEEE Information Theory Workshop, , June 27-July 1 Metsovo, GreeceDa Silva, E.B., Pallazo, Jr.R., Firer, M., Performance analysis of QAM-like constellations in hyperbolic space (2000) International Symposium on Information Theory and Its Applications, pp. 568-571. , November 5-8 Honolulu, HIFirby, P.A., Gardiner, C.F., (1991) Surface Topology, , Second Edition Ellis Horwoo
Classification Of Niederreiter - Rosenbloom - Tsfasman Block Codes
No full textPoset and block metrics were introduced in recent years as alternative metrics to study error correcting codes. Poset-block codes were introduced in 2008, encompassing both poset and block metrics. In this paper, we study a family of such metrics, the Niederreiter-Rosenbloom-Tsfasman block metrics. In this context, we classify the classes of equivalent codes, describe canonical representatives of each class and develop much of the classical theory of error correcting codes for Niederreiter-Rosenbloom-Tsfasman block codes, including determination of packing radius and classification of MDS and perfect codes, determination of covering radius and characterization of quasi-perfect codes, and the description of an algorithm for syndrome decoding. © 2010 IEEE.561052075216Alves, M.M.S., Panek, L., Firer, M., Error-block codes and poset metrics (2008) Adv. Math. Commun., 2, pp. 95-111Brualdi, R.A., Graves, J.S., Lawrence, K.M., Codes with a poset metric (1995) Discrete Math., 147, pp. 57-72Feng, K., Xu, L., Hickernell, F.J., Linear error-block codes (2006) Finite Fields Appl., 12, pp. 638-652Hyun, J.Y., Kim, H.K., Maximum distance separable poset codes (2008) Des. Codes Cryptogr., 48 (3), pp. 247-261Huffman, W.C., Pless, V., (2003) Fundamentals of Error-Correcting Codes, , Cambridge, U.K.: Cambridge Univ. PressMacWilliams, F.J., Sloane, N.J.A., (1997) The Theory of Error-Correcting Codes, , Amsterdam: North-Holland Math. LibraryNiederreiter, H., Point sets and sequences with small discrepancy (1987) Monatsh. Math., 104, pp. 273-337Niederreiter, H., A combinatorial problem for vector spaces over finite fields (1991) Discrete Math., 96, pp. 221-228Niederreiter, H., Orthogonal array and other combinatorial aspects in the theory of uniform point distributions in unit cubes (1992) Discrete Math., 106-107, pp. 361-367Ozen, M., Siap, I., On the estructure and decoding of linear codes with respect to Rosenbloom-Tsfasman metric (2004) Selçuk J. Appl. Math., 5 (2), pp. 25-31Panek, L., Firer, M., Kim, H.K., Hyun, J.Y., Groups of linear isometries on poset structures (2008) Discrete Math., 308, pp. 4116-4123Rosenbloom, M.Y., Tsfasman, M.A., Codes for the μ-metric (1997) Probl. Inf. Transm., 33, pp. 45-52Wei, V.K., Generalized Hamming weights for linear codes (1991) IEEE Trans. Inf. Theory, 37, pp. 1412-1418Wei, V.K., Yang, K., On the generalized Hamming weights of product codes (1993) IEEE Trans. Inf. Theory, 39, pp. 1709-171
Translation association schemes, poset metrics, and the shape enumerator of codes
No full textPoset metrics form a generalization of the Hamming metric on the space double-struck F q n. Orbits of the group of linear isometries of the space give rise to a translation association scheme. The structure of the dual scheme is important in studying duality of linear codes; this study is facilitated if the scheme is self-dual. We study the relation between self-duality of the scheme and that of the poset. We also give new examples of poset metric spaces and describe the association schemes that arise from linear isometries. © 2012 IEEE.Poset metrics form a generalization of the Hamming metric on the space double-struck F q n. Orbits of the group of linear isometries of the space give rise to a translation association scheme. The structure of the dual scheme is important in studying dual101105sem informaçãosem informaçãoBarg, A., Purkayastha, P., Bounds on ordered codes and orthogonal arrays (2009) Moscow Mathematical Journal, 9 (2), pp. 211-243. , arXiv:cs/0702033Brouwer, A.E., Cohen, A.M., Neumaier, A., (1989) Distance-regular Graphs, , Springer-Verlag, Berlin e. aBrualdi, R.A., Graves, J.S., Lawrence, K.M., Codes with a poset metric (1995) Discrete Math., 147 (1-3), pp. 57-72Dougherty, S.T., Skriganov, M.M., MacWilliams duality and the Rosenbloom-Tsfasman metric (2002) Mosc. Math. J., 2 (1), pp. 81-97+199Kim, D.S., Kim, H.K., Duality of Translation Association Schemes Coming from Certain Actions, , arXiv:1108.4947Kim, H.K., Oh, D.Y., A classification of posets admitting the MacWilliams identity (2005) IEEE Trans. Inform. Theory, 51 (4), pp. 1424-1431Lee, K., The automorphism group of a linear space with the Rosenbloom-Tsfasman metric (2003) Eur. J. Combinatorics, 24, pp. 607-612Martin, W.J., Stinson, D.R., Association schemes for ordered orthogonal arrays and (T,M, S)-nets (1999) Canad. J. Math., 51 (2), pp. 326-346Panek, L., Firer, M., Kim, H.K., Hyun, J.Y., Groups of linear isometries on poset structures (2008) Discrete Math., 308 (18), pp. 4116-4123Park, W., Barg, A., Linear ordered codes, shape enumerators, and parallel channels Proc. 48th Annual Allerton Conf. Commun. Control Comput., Monticello, IL, Sept. 30-Oct. 1, 2010, pp. 361-367Rosenbloom, M.Yu., Tsfasman, M.A., Codes for the m-metric (1997) Problems of Information Transmission, 33 (1), pp. 45-52IEEE International Symposium on Information Theory ProceedingsResearch of this author supported in part by NSF grants CCF0916919 and DMS110169
- …
