Commentary on Section 264 of ITAA 1936: commissioner may require information and evidence
Dabner, Justin
2007-01-01
Search results
1,869 records were found.
Web Services and Business Processes for Web Services are the new paradigms for the lightweight integration of business from different enterprises. Whereas the security and access control policies for basic web services and distributed systems are well studied and almost standardized, there is not yet a comprehensive proposal for an access control architecture for business processes. The major difference is that business process describe complex services that cross organizational boundaries and are provided by entities that sees each other as just partners and nothing else. This calls for a number of differences with traditional aspects of access control architectures such as: - credential vs classical user-based access control, - interactive and partner-based vs one-server-gathers-all requests of credentials from clients, - controlled ...
In the last years we have witnessed an impressive advance in the efficiency of boolean solving techniques, which has brought large previously intractable problems at the reach of state-of-the-art solvers. Unfortunately, simple boolean expressions are not expressive enough for representing many real-world problems, which require handling also integer or real values and operators. On the other hand, mathematical solvers, like computer-algebra systems or constraint solvers, cannot handle efficiently problems involving heavy boolean search, or do not handle them at all. In this paper we present the foundations and the basic algorithms for a new class of procedures for solving boolean combinations of mathematical propositions, which combine boolean and mathematical solvers, and we highlight the main requirements that boolean and mathematica...
A new suboptimal search strategy suitable for feature selection in very high-dimensional remote-sensing images (e.g. those acquired by hyperspectral sensors) is proposed. Each solution of the feature selection problem is represented as a binary string that indicates which features are selected and which are disregarded. In turn, each binary string corresponds to a point of a multidimensional binary space. Given a criterion function to evaluate the effectiveness of a selected solution, the proposed strategy is based on the search for constrained local extremes of such a function in the above-defined binary space. In particular, two different algorithms are presented that explore the space of solutions in different ways. These algorithms are compared with the classical sequential forward selection and sequential forward floating selectio...
Given a vector $(\delta_1, \delta_2, \ldots, \delta_{t})$ of non increasing positive integers, and an undirected graph $G=(V,E)$, an $L(\delta_1, \delta_2, \ldots,\delta_{t})$-coloring of $G$ is a function $f$ from the vertex set $V$ to a set of nonnegative integers such that $|f(u)-f(v)| \ge \delta_i$, if $d(u,v) = i, \ 1 \le i \le t, \ $ where $d(u,v)$ is the distance (i.e. the minimum number of edges) between the vertices $u$ and $v$. An optimal $L(\delta_1, \delta_2, \ldots,\delta_{t})$-coloring for $G$ is one minimizing the largest used integer over all such colorings. This coloring problem has relevant application in channel assignment for interference avoidance in wireless networks, where channels (i.e. colors) assigned to interfering stations (i.e. vertices) at distance $i$ must be at least $\delta_i$ apart, while the same chan...
Non disponibile
Questo articolo tratta il prblema di incorporare il rischio specifico nel calcolo del VaR. Il problema viene affrontato ipotizzando che il processo generatore dei dati sia una mistura di tre distribuzioni "normali": la distribuzione relativa ai periodi "normali" genera la maggior parte delle osservazioni, le altre due distribuzioni sono caratterizzate da una media spostata rispettivamente verso il basso e verso l'alto. L'entità di tali salti permette di incorporare il rischio di evento, che si riflette in una distribuzione a code pesanti. La metodologia usata per stimare i parametri, basata sull'algoritmo EM, permette di stimare tutti i parametri a partire dai dati, senza introdurre alcuna ipotesi a priori. Gli esempi presentati confermano, anche tramite un confronto con altre metodologie, l'appropriatezza del modello per la stima del ...
This paper analyse the phenomenon of the evasion of indirect taxes. The attention is focused on the insurgence of phenomena of collusion among tax evaders. The paper reports results from several experiments carried out at the Laboratory of Computable and Experimental Economics of Trento.
We propose a new data model intended for peer-to-peer (P2P) databases. The model assumes that each peer has a (relational) database and exchanges data with other peers (its acquaintances). In this context, one needs a data model that views the space of available data within the P2P network as an open collection of possibly overlapping and inconsistent databases. Accordingly, the paper pro-poses the Local Relational Model, develops a semantics for coordination formu-las. The main result of the paper generalizes Reiter’s characterization of a rela-tional database in terms of a first order theory, by providing a syntactic char-acterization of a relational space in terms of a multi-context system. This work extends earlier work by Giunchiglia and Ghidini on Local Model Semantics.
