The paper argues that an effective solution to information and knowledge management (KM) needs of practitioners in the construction industry can be found in the provision of an adapted knowledge environment that makes use of user profiling and document summarization techniques based on information retrieval sciences. The conceptualization of the domain through ontology takes a pivotal role in the proposed knowledge environment and provides a semantic referential to ensure relevance, accuracy, and completeness of information. A set of KM services articulated around the selected ontology have been developed, using the Web services model, tested, and validated in real organizational settings. This provided the basis for formulating recommendations and key success factors for any KM project development. 相似文献
The migration from circuit-switched networks to packet-switched networks necessitates the investigation of related issues such as service delivery, QoS, security, and service fraud and misuse. The latter can be seen as a combination of accounting and security aspects. In traditional telecommunication networks, fraud accounts for annual losses at an average of 3%–5% of the operators’ revenue and still increasing at a rate of more than 10% yearly. It is also expected that in VoIP networks, the situation will be worse due to the lack of strong built-in security mechanisms, and the use of open standards. This paper discusses the fraud problem in VoIP networks and evaluates the related available solutions. 相似文献
In this paper, we present a new irradiance caching scheme using Monte Carlo ray tracing for efficiently rendering participating media. The irradiance cache algorithm is extended to participating media. Our method allows to adjust the density of cached records depending on illumination changes. Direct and indirect contributions can be stored in the records but also multiple scattering. An adaptive shape of the influence zone of records, depending on geometrical features and irradiance variations, is introduced. To avoid a high density of cached records in low interest areas, a new method controls the density of the cache when adding new records. This record density control depends on the interpolation quality and on the photometric characteristics of the medium. Reducing the number of records accelerates both the computation pass and the rendering pass by decreasing the number of queries to the cache data structure (Kd-tree). Finally, instead of using an expensive ray marching to find records that cover the ray, we gather all the contributive records along the ray. With our method, pre-computing and rendering passes are significantly speeded-up. 相似文献
The problem of reconstructing a pattern of an object from its approximate discrete orthogonal projections in a 2-dimensional grid, may have no solution because the inaccuracy in the measurements of the projections may generate an inconsistent problem. To attempt to overcome this difficulty, one seeks to reconstruct a pattern with projection values having possibly some bounded differences with the given projection values and minimizing the sum of the absolute differences.
This paper addresses the problem of reconstructing a pattern with a difference at most equal to +1 or −1 between each of its projection values and the corresponding given projection value. We deal with the case of patterns which have to be horizontally and vertically convex and the case of patterns which have to be moreover connected, the so-called convex polyominoes. We show that in both cases, the problem of reconstructing a pattern can be transformed into a Satisfiability (SAT) Problem. This is done in order to take advantage of the recent advances in the design of solvers for the SAT Problem. We show, experimentally, that by adding two important features to CSAT (an efficient SAT solver), optimal patterns can be found if there exist feasible ones. These two features are: first, a method that extracts in linear time an optimal pattern from a set of feasible patterns grouped in a generic pattern (obtaining a generic pattern may be exponential in the worst case) and second, a method that computes actively a lower bound of the sum of absolute differences that can be obtained from a partially defined pattern. This allows to prune the search tree if this lower bound exceeds the best sum of absolute differences found so far. 相似文献
Tea is the second most consumed beverage in the world and its consumption has been associated with numerous potential health benefits. Factors such as fermentation methods, geographical origin and season can affect the primary and secondary metabolite composition of tea. In this study, a hydrophilic interaction liquid chromatography (HILIC) method coupled to high resolution mass spectrometry in both positive and negative ionisation modes was developed and optimised. The method when combined with principal component analysis to analyse three different types of tea, successfully distinguished samples into different categories, and provided evidence of the metabolites which differed between them. The accurate mass and high resolution attributes of the mass spectrometric data were utilised and relative quantification data were extracted post-data acquisition on 18 amino acids, showing significant differences in amino acid concentrations between tea types and countries. This study highlights the potential of HILIC chromatography combined with non-targeted mass spectrometric methods to provide a comprehensive understanding of polar metabolites in plant extracts. 相似文献