The article deals with the draft of Act on the Management and Control of Public Finances which is nowadays prepared by Ministry of Finance of Czech Republic. It is an important act of management and control of public budgets. The article presents the positive changes of the public finance management system for the municipalities. In the Czech Republic there are more than 6 000 municipalities. Many of them are too small to have appropriate personal resources to ensure the adequate control of public finance. The draft tries to simplify the system to helps the smallest municipalities and to ensure the minimum level of the public finance protection.
{"title":"Draft of the Act on the Management and Control of PublicFinances","authors":"Damian Czudek","doi":"10.15290/ACR.2015.08.03","DOIUrl":"https://doi.org/10.15290/ACR.2015.08.03","url":null,"abstract":"The article deals with the draft of Act on the Management and Control of Public Finances which is nowadays prepared by Ministry of Finance of Czech Republic. It is an important act of management and control of public budgets. The article presents the positive changes of the public finance management system for the municipalities. In the Czech Republic there are more than 6 000 municipalities. Many of them are too small to have appropriate personal resources to ensure the adequate control of public finance. The draft tries to simplify the system to helps the smallest municipalities and to ensure the minimum level of the public finance protection.","PeriodicalId":7334,"journal":{"name":"Advances in Computing Research","volume":"19 1","pages":"23-25"},"PeriodicalIF":0.0,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79393631","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The 14th International Scientific Conference devoted to the issue of Tax Law and its Possibilities of Prevention of Tax Evasion and Tax Frauds was held on 14-16 September 2015 in Štrbské Pleso in the High Tatras. Previous annual conferences bringing together representatives of the science and practice of public finance of Central and Eastern European countries took place in Bialystok, Brno, Vilnius, Košice, Grodno, Voronezh, Paris, Lviv, Prague, Győr, Bialystok, Omsk and Mikulov.
{"title":"Report on the XIV International Scientific Conference “Tax Law and its Possibilities of Prevention of Tax Evasion and Tax Frauds” (14-16 September 2015, Štrbské Pleso, Slovak Republic)","authors":"Piotr Woltanowski, Ewa Lotko, A. P. Chociej","doi":"10.15290/acr.2015.08.07","DOIUrl":"https://doi.org/10.15290/acr.2015.08.07","url":null,"abstract":"The 14th International Scientific Conference devoted to the issue of Tax Law and its Possibilities of Prevention of Tax Evasion and Tax Frauds was held on 14-16 September 2015 in Štrbské Pleso in the High Tatras. Previous annual conferences bringing together representatives of the science and practice of public finance of Central and Eastern European countries took place in Bialystok, Brno, Vilnius, Košice, Grodno, Voronezh, Paris, Lviv, Prague, Győr, Bialystok, Omsk and Mikulov.","PeriodicalId":7334,"journal":{"name":"Advances in Computing Research","volume":"610 1","pages":"43-44"},"PeriodicalIF":0.0,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86672051","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-01-01DOI: 10.1016/S0065-2458(03)60002-1
G. Cybenko, A. Giani, Paul Thompson
{"title":"Cognitive Hacking","authors":"G. Cybenko, A. Giani, Paul Thompson","doi":"10.1016/S0065-2458(03)60002-1","DOIUrl":"https://doi.org/10.1016/S0065-2458(03)60002-1","url":null,"abstract":"","PeriodicalId":7334,"journal":{"name":"Advances in Computing Research","volume":"324 1","pages":"255-287"},"PeriodicalIF":0.0,"publicationDate":"2004-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73154827","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We present four results on the complexity of VLSI computations: a) We further justify the Boolean circuit model [Vu, Sa, LS] by showing that it is able to model multi-directional VLSI devices (e.g. pass transistors, pre-charged bus drivers). b) We prove a general cutting theorem for compact regions in R^{d} (dgeq2) that allows us to drop the convexity assumption in lower bound proofs based on the crossing sequence argument. c) We exhibit an Omega(n^{1/3}) asymptotically tight lower bound on the area of strongly where-oblivious chips for transitive functions. d) We prove a lower bound on the switching energy needed for computing transitive functions.
我们提出了关于VLSI计算复杂性的四个结果:a)我们进一步证明了布尔电路模型[Vu, Sa, LS]，表明它能够模拟多向VLSI器件(例如，通过晶体管，预充电总线驱动器)。b)我们在R^{d (d}geq 2)中证明了紧域的一般切割定理，该定理允许我们放弃基于交叉序列论证的下界证明中的凸性假设。c)我们在传递函数的强无关芯片的面积上给出了Omega (n^{1/3})渐近紧下界。d)证明了计算传递函数所需的开关能量的下界。
{"title":"Four results on the complexity of VLSI computations","authors":"Thomas Lengauer, K. Mehlhorn","doi":"10.22028/D291-26447","DOIUrl":"https://doi.org/10.22028/D291-26447","url":null,"abstract":"We present four results on the complexity of VLSI computations: a) We further justify the Boolean circuit model [Vu, Sa, LS] by showing that it is able to model multi-directional VLSI devices (e.g. pass transistors, pre-charged bus drivers). b) We prove a general cutting theorem for compact regions in R^{d} (dgeq2) that allows us to drop the convexity assumption in lower bound proofs based on the crossing sequence argument. c) We exhibit an Omega(n^{1/3}) asymptotically tight lower bound on the area of strongly where-oblivious chips for transitive functions. d) We prove a lower bound on the switching energy needed for computing transitive functions.","PeriodicalId":7334,"journal":{"name":"Advances in Computing Research","volume":"93 1","pages":"1-22"},"PeriodicalIF":0.0,"publicationDate":"1983-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84400318","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：