http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Inserting the mass proportional damping (MPD) system in a concrete shear-type structure
Silvestri, Stefano,Trombetti, Tomaso,Ceccoli, Claudio Techno-Press 2003 Structural Engineering and Mechanics, An Int'l Jou Vol.16 No.2
This paper presents an illustrative example of the advantages offered by inserting added viscous dampers into shear-type structures in accordance with a special scheme based upon the mass proportional damping (MPD) component of the Rayleigh viscous damping matrix. In previous works developed by the authors, it has been widely shown that, within the class of Rayleigh damped systems and under the "equal total cost" constraint, the MPD system provides best overall performance both in terms of minimising top-storey mean square response to a white noise stochastic input and maximising the weighted average of modal damping ratios. A numerical verification of the advantages offered by the application of MPD systems to a realistic structure is presented herein with reference to a 4-storey reinforced-concrete frame. The dynamic response of the frame subjected to both stochastic inputs and several recorded earthquake ground motions is here analysed in detail. The results confirm the good dissipative properties of MPD systems and indicate that this is achieved at the expense of relatively small damping forces.
Semantics-aware Obfuscation for Location Privacy
Maria Luisa Damiani,Claudio Silvestri,Elisa Bertino 한국정보과학회 2008 Journal of Computing Science and Engineering Vol.2 No.2
The increasing availability of personal location data pushed by the widespread use of location-sensing technologies raises concerns with respect to the safeguard of location privacy. To address such concerns location privacy-preserving techniques are being investigated. An important area of application for such techniques is represented by Location Based Services (LBS). Many privacy-preserving techniques designed for LBS are based on the idea of forwarding to the LBS provider obfuscated locations, namely position information at low spatial resolution, in place of actual users' positions. Obfuscation techniques are generally based on the use of geometric methods. In this paper, we argue that such methods can lead to the disclosure of sensitive location information and thus to privacy leaks. We thus propose a novel method which takes into account the semantic context in which users are located. The original contribution of the paper is the introduction of a comprehensive framework consisting of a semantic-aware obfuscation model, a novel algorithm for the generation of obfuscated spaces for which we report results from an experimental evaluation and a reference architecture.
Semantics-aware Obfuscation for Location Privacy
Damiani, Maria Luisa,Silvestri, Claudio,Bertino, Elisa Korean Institute of Information Scientists and Eng 2008 Journal of Computing Science and Engineering Vol.2 No.2
The increasing availability of personal location data pushed by the widespread use of location-sensing technologies raises concerns with respect to the safeguard of location privacy. To address such concerns location privacy-preserving techniques are being investigated. An important area of application for such techniques is represented by Location Based Services (LBS). Many privacy-preserving techniques designed for LBS are based on the idea of forwarding to the LBS provider obfuscated locations, namely position information at low spatial resolution, in place of actual users' positions. Obfuscation techniques are generally based on the use of geometric methods. In this paper, we argue that such methods can lead to the disclosure of sensitive location information and thus to privacy leaks. We thus propose a novel method which takes into account the semantic context in which users are located. The original contribution of the paper is the introduction of a comprehensive framework consisting of a semantic-aware obfuscation model, a novel algorithm for the generation of obfuscated spaces for which we report results from an experimental evaluation and reference architecture.
Salvatore Orlando,Renzo Orsini,Alessandra Raffaeta,Alessandro Roncato,Claudio Silvestri 한국정보과학회 2007 Journal of Computing Science and Engineering Vol.1 No.2
In this paper we investigate some issues and solutions related to the design of a Data Warehouse (DW), storing several aggregate measures about trajectories of moving objects. First we discuss the loading phase of our DW which has to deal with overwhelming streams of trajectory observations, possibly produced at different rates, and arriving in an unpredictable and unbounded way. Then, we focus on the measure presence, the most complex measure stored in our DW. Such a measure returns the number of distinct trajectories that lie in a spatial region during a given temporal interval. We devise a novel way to compute an approximate, but very accurate, presence aggregate function, which algebraically combines a bounded amount of measures stored in the base cells of the data cube. We conducted many experiments to show the effectiveness of our method to compute such an aggregate function. In addition, the feasibility of our innovative trajectory DW was validated with an implementation based on Oracle. We investigated the most challenging issues in realizing our trajectory DW using standard DW technologies: namely, the preprocessing and loading phase, and the aggregation functions to support OLAP operations.
Trajectory Data Warehouses: Design and Implementation Issues
Orlando, Salvatore,Orsini, Renzo,Raffaeta, Alessandra,Roncato, Alessandro,Silvestri, Claudio Korean Institute of Information Scientists and Eng 2007 Journal of Computing Science and Engineering Vol.1 No.2
In this paper we investigate some issues and solutions related to the design of a Data Warehouse (DW), storing several aggregate measures about trajectories of moving objects. First we discuss the loading phase of our DW which has to deal with overwhelming streams of trajectory observations, possibly produced at different rates, and arriving in an unpredictable and unbounded way. Then, we focus on the measure presence, the most complex measure stored in our DW. Such a measure returns the number of distinct trajectories that lie in a spatial region during a given temporal interval. We devise a novel way to compute an approximate, but very accurate, presence aggregate function, which algebraically combines a bounded amount of measures stored in the base cells of the data cube. We conducted many experiments to show the effectiveness of our method to compute such an aggregate function. In addition, the feasibility of our innovative trajectory DW was validated with an implementation based on Oracle. We investigated the most challenging issues in realizing our trajectory DW using standard DW technologies: namely, the preprocessing and loading phase, and the aggregation functions to support OLAP operations.