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.
The Standard Generalized Markup Language (SGML) and the Extensible Markup Language (XML) allow authors to better transmit the semantics in their documents by explicitly specifying the relevant structures in a document or class of documents by means of document type definitions (DTDs. Several authors have proposed to regard DTDs as extended context-free grammars expressed in a notation similar to extended Backus--Naur form. In addition, the SGML standard allows the semantics of content models (the right-hand side of productions) to be modified by exceptions. Inclusion exceptions allow named elements to appear anywhere within the content of a content model, and exclusion exceptions preclude named elements from appearing in the content of a content model. Since XML does not allow exceptions, the problem of exception removal has received m...
The model presents a general equilibrium dynamic model of an economy consisting of many regions. Capital is perfectly mobile and labor is immobile across regions. Wages are determined by local unions. There is training on the job and strategic complementarity between investment in physical capital by firms and investment in becoming “trainable” by workers. Structurally similar regional economies preserve forever their differences in per capita output and employment rate, if the workers’ non-labor is equalized across regions by interregional income redistribution operated via central budget. Regional decentralization of income redistribution allows convergence in per capita output and employment rate.
We obtain a simple product formula for the Kazhdan-Lusztig R-polynomials, Ru,v(q)indexed by permutations "u,v" in the case that v is obtained from u applying two transpositions (i,j) and (k,l) for i
An r-graph is any graph that can be obtained as a conic combination of its own 1-factors. An r-graph G=(V,E) is said indecomposable when its edge set E cannot be partitioned as the disjoint union of sets E_1 and E_2 so that (V,E_i) is an r_i-graph for i=1,2 and for some r_1, r_2. We give an indecomposable r-graph for every integer r >= 4. This answers a question raised in 1: [ P.D. Seymour, On multi-colourings of cubic graphs, and conjectures of Fulkerson and Tutte. Proceedings of the London Mathematical Society, Vol. 38, 423--460, (1979)] and 2: [ P.D. Seymour, Some unsolved problems on one-factorizations of graphs. Graph Theory and Related Topics, J.A. Bondy and U.S.R. Murty, Eds., 367--368, Academic Press, New York, 1979] and has interesting consequences for the Schrijver System of the T-cut polyhedron to be given in 3: [ R. Rizzi, ...
Most of the knowledge management systems of complex organizations are based on technological architectures that are in contradiction with the social processes of knowledge creation. In particular, centralized architectures are adopted to manage a process that is intrinsically distributed. In this paper, assuming a Distributed approach to Knowledge Management (DKM), is proposed that technological and social architectures must be reciprocally consistent. Moreover, in the domain of Knowledge Management, technological architectures should be designed in order to support the interplay between two qualitatively different processes: the autonomous management of knowledge of individuals and groups - here called Knowledge Nodes (KNs) -, and the coordination required in order to exchange knowledge among them. Finally a peer to peer architecture ...
The recent technological developments in remote-sensing sensors and satellites (e.g., the increased spatial and spectral resolutions of sensors, the increased rivisitation time of satellites) offer the possibility of addressing new applications related to environmental monitoring and natural-resource management. In particular, applications connected with the analysis of multitemporal remote-sensing images are becoming more and more important, also in relation to the increased awareness of politicians of the necessity for a regular and efficient control of the environment. This chapter deals with a key issue in multitemporal data analysis, namely, the automatic detection of changes in pairs of images acquired in the same geographical area at different times. In particular, unsupervised change-detection methods (i.e., methods that do not...
No anstract available
Detecting the user location is crucial in a wireless environment, not only for the choice of first-hop communication partners, but also for many auxiliary purposes: Quality of Service (availability of information in the right place for reduced congestion/delay, establishment of the optimal path), energy consumption, automated insertion of location-dependent info into a web query issued by a user (for example a tourist asking informations about a monument or a restaurant, a fireman approaching a disaster area). The technique we propose in our investigation tries to meet two main goals: transparency to the network and independence from the environment. A user entering an environment (for instance a wireless-networked building) shall be able to use his own portable equipment to build a personal map of the environment without the system ev...
Abstract: In this paper we criticise the objectivistic approach that underlies most current systems for Knowledge Management. We show that such an approach is incompatible with the very nature of what is to be managed (i.e., knowledge), and we argue that this may partially explain why most knowledge management systems are deserted by users. We propose a different approach - called distributed knowledge management - in which subjective and social (in a word, contextual) aspects of knowledge are seriously taken into account. Finally, we present a general technological architecture in which these ideas are implemented by introducing the concept of knowledge node.
We give a polynomial algorithm to compute shortest paths in weighted undirected graphs with no negative cycles (conservative graphs). We show that our procedure gives a simple algorithm to compute optimal T-joins (and consequently all of their special cases, including weighted matchings). We finally give a direct algorithmic proof for arbitrary weights of a theorem of Sebo characterizing conservative graphs and optimal paths.
