发布求助
文献互助 智能选刊 最新文献

Advances in Computing Research最新文献

筛选
英文 中文
Draft of the Act on the Management and Control of PublicFinances 公共财政管理和控制法草案
Advances in Computing Research Pub Date : 2015-01-01 DOI: 10.15290/ACR.2015.08.03
Damian Czudek
{"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}
引用次数: 0
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) 第十四届国际科学会议“税法及其预防逃税和税务欺诈的可能性”报告(2015年9月14-16日，Štrbské Pleso，斯洛伐克共和国)
Advances in Computing Research Pub Date : 2015-01-01 DOI: 10.15290/acr.2015.08.07
Piotr Woltanowski, Ewa Lotko, A. P. Chociej
{"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}
引用次数: 0
Cognitive Hacking 认知黑客
Advances in Computing Research Pub Date : 2004-01-01 DOI: 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}
引用次数: 8
Communication Complexity 沟通的复杂性
Advances in Computing Research Pub Date : 1997-01-01 DOI: 10.1016/S0065-2458(08)60342-3
E. Kushilevitz
{"title":"Communication Complexity","authors":"E. Kushilevitz","doi":"10.1016/S0065-2458(08)60342-3","DOIUrl":"https://doi.org/10.1016/S0065-2458(08)60342-3","url":null,"abstract":"","PeriodicalId":7334,"journal":{"name":"Advances in Computing Research","volume":"13 1","pages":"I-XIII, 1-189"},"PeriodicalIF":0.0,"publicationDate":"1997-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83451713","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}
引用次数: 717
Four results on the complexity of VLSI computations 关于VLSI计算复杂度的四个结果
Advances in Computing Research Pub Date : 1983-01-01 DOI: 10.22028/D291-26447
Thomas Lengauer, K. Mehlhorn
{"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}
引用次数: 6
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信