期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到239篇文章
< 1 2 … 12 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
New Results on One Modulo N-Difference Mean Graphs 认领 引用
1
作者 Pon Jeyanthi Meganathan Selvi Damodaran Ramya 《Open Journal of Discrete Mathematics》 2023年第4期100-112,共13页
A graph G is said to be one modulo N-difference mean graph if there is an injective function f from the vertex set of G to the set , where N is the natural number and q is the number of edges of G and f induces a bije... A graph G is said to be one modulo N-difference mean graph if there is an injective function f from the vertex set of G to the set , where N is the natural number and q is the number of edges of G and f induces a bijection  from the edge set of G to given by and the function f is called a one modulo N-difference mean labeling of G. In this paper, we show that the graphs such as arbitrary union of paths, , ladder, slanting ladder, diamond snake, quadrilateral snake, alternately quadrilateral snake, , , , , friendship graph and admit one modulo N-difference mean labeling. 展开更多
关键词 Skolem Difference Mean Labeling One Modulo N-Graceful Labeling One Modulo N-Difference Mean Labeling and One Modulo N-Difference Mean Graph
暂未订购 下载PDF
Constructing Collective Signature Schemes Using Problem of Finding Roots Modulo 认领 引用
2
作者 Tuan Nguyen Kim Duy Ho Ngoc Nikolay A.Moldovyan 《Computers, Materials & Continua》 SCIE EI 2022年第7期1105-1122,共18页
Digital signature schemes are often built based on the difficulty of the discrete logarithm problems,of the problem of factor analysis,of the problem of finding the roots modulo of large primes or a combination of the... Digital signature schemes are often built based on the difficulty of the discrete logarithm problems,of the problem of factor analysis,of the problem of finding the roots modulo of large primes or a combination of the difficult problems mentioned above.In this paper,we use the new difficult problem,which is to find the wth root in the finite ground field GF(p)to build representative collective signature schemes,but the chosen modulo p has a special structure distinct p=Nt0t1t2+1,where N is an even number and t0,t1,t2 are prime numbers of equal magnitude,about 80 bits.The characteristics of the proposed scheme are:i)The private key of each signer consists of 2 components(K1,K2),randomly selected,but the public key has only one component(Y)calculated by the formula Y=Kw11 Kw22;w1=t0t1 and w2=t0t2;and ii)The generated signature consists of a set of 3 components(e,S1,S2).We use the technique of hiding the signer’s public key Y,which is the coefficientλgenerated by the group nanager,in the process of forming the group signature and representative collective signature to enhance the privacy of all members of the signing collective. 展开更多
关键词 Computing roots finding roots modulo collective signature signing collective signing group
暂未订购 下载PDF
On the Line Graph of the Complement Graph for the Ring of Gaussian Integers Modulo n 认领 引用
3
作者 Manal Ghanem Khalida Nazzal 《Open Journal of Discrete Mathematics》 2012年第1期24-34,共11页
The line graph for the complement of the zero divisor graph for the ring of Gaussian integers modulo n is studied. The diameter, the radius and degree of each vertex are determined. Complete characterization of Hamilt... The line graph for the complement of the zero divisor graph for the ring of Gaussian integers modulo n is studied. The diameter, the radius and degree of each vertex are determined. Complete characterization of Hamiltonian, Eulerian, planer, regular, locally and locally connected is given. The chromatic number when is a power of a prime is computed. Further properties for and are also discussed. 展开更多
关键词 Complement of a Graph Chromatic Index Diameter Domination Number Eulerian Graph Gaussian Integers Modulo n Hamiltonian Graph Line Graph Radius Zero Divisor Graph
暂未订购 下载PDF
Collective Signature Schemes Problem of Finding Roots Modulo 认领 引用
4
作者 Hailyie Tekleselassie 《Journal of Electronic & Information Systems》 2022年第1期1-9,共9页
Digital signature schemes in general and representative collective digital signature schemes,in particular,are often built based on the difficulty of the discrete logarithm problem on the finite field,of the discrete ... Digital signature schemes in general and representative collective digital signature schemes,in particular,are often built based on the difficulty of the discrete logarithm problem on the finite field,of the discrete logarithm problem of the elliptic curve,of the problem of factor analysis,of the problem of finding the roots modulo of large primes or a combination of the difficult problems mentioned above.In this paper,we use the new difficult problem,which is to find Wththe root in the finite ground field to build representative collective signature schemes,but the chosen modulo has a special structure distinct p=Nt0t1t2+1,where is an even number and t0,t1,t2are prime numbers of equal magnitude,about 80bits.The characteristics of the proposed scheme are:i)The private key of each signer consists of 2 components(K1,K2),randomly selected,but the public key has only one component(Y)calculated by the formula Y=KW11KW22;and t0t2;and ii)The generated signature consists of a set of 3 components(e,S1,S2).We use the technique of hiding the signer’s public key Y,which is the coefficientλgenerated by the group manager,in the process of forming the group signature and representative collective signature to enhance the privacy of all members of the signing collective. 展开更多
关键词 Computing roots Finding roots modulo Collective signature Signing collective Signing group
暂未订购 下载PDF
Designs of four universal architectures for multi-valued quantum adders 认领 引用
5
作者 Si-Jun Lu Jing-Wen Ai +1 位作者 Ting-Yan Zhang Ming-Qiang Bai 《Communications in Theoretical Physics》 SCIE CAS CSCD 2026年第2期25-34,共10页
Multi-valued quantum adder circuits,based on multi-valued logic,are significant components in numerous quantum algorithms.Their low-cost implementations can enhance the efficiency of these algorithms.In this paper,inn... Multi-valued quantum adder circuits,based on multi-valued logic,are significant components in numerous quantum algorithms.Their low-cost implementations can enhance the efficiency of these algorithms.In this paper,innovative universal architectures for d(d>3)-level quantum half-adder,full-adder,parallel adder,and parallel adder/subtractor circuits are designed using d-level 1-qudit(quantum digit)and M-S gates.To demonstrate the effectiveness of these architectures,quaternary adder circuits derived from them are displayed and compared with several existing counterparts.Judging by the results,these circuits exhibit reductions in quantum cost(QC),hardware complexity(HC),number of constant inputs(NCIs),and number of garbage outputs(NGOs). 展开更多
关键词 multi-valued quantum logic quantum adder circuit generalized Toffoli gate modulo addition gate
暂未订购 下载PDF
增量SAT/SMT问题的求解与应用综述 认领 引用
6
作者 李博涵 蔡少伟 《软件学报》 EI CSCD 北大核心 2026年第8期3229-3256,共28页
命题可满足性问题(propositional satisfiability problem,SAT)和可满足性模理论问题(satisfiability modulo theories problem,SMT)是重要的计算机科学基础问题,其在电路设计,软件分析验证等领域都有着重要应用,并且目前已有大量工作... 命题可满足性问题(propositional satisfiability problem,SAT)和可满足性模理论问题(satisfiability modulo theories problem,SMT)是重要的计算机科学基础问题,其在电路设计,软件分析验证等领域都有着重要应用,并且目前已有大量工作对其求解技术进行研究.在实际应用场景中,SAT/SMT求解器通常需要求解一系列互相紧密联系的公式.相比于每次都调用独立的求解器重新求解,增量求解技术可以复用之前搜索得到的信息,包括之前的求解结果以及学习子句等,从而有效提高了求解效率.目前,增量SAT/SMT求解已经受到广泛重视与研究,并成功应用于有界模型检测,符号执行,最大可满足性问题等领域中.对增量SAT/SMT的求解技术进行详细综述与梳理,涵盖了完备与非完备算法.此外,详细总结增量SAT/SMT求解技术在实际场景中的主要应用.最后,对该领域的发展方向进行总结和展望. 展开更多
关键词 命题可满足性问题 可满足性模理论问题 增量求解
暂未订购 下载PDF
一种基于混淆模分量的全同态加密算法研究 认领 引用
7
作者 李晓东 窦一萌 +2 位作者 官里 赵若云 岳浩 《信息安全研究》 CSCD 北大核心 2026年第4期311-318,共8页
随着云计算、大数据和物联网技术的迅速普及,数据隐私与安全问题日益突出,而传统的数据处理方法在保障数据安全方面存在局限.同态加密(homomorphic encryption,HE)是一种隐私保护方法,允许数据在处于加密状态下直接进行运算.尽管理论上... 随着云计算、大数据和物联网技术的迅速普及,数据隐私与安全问题日益突出,而传统的数据处理方法在保障数据安全方面存在局限.同态加密(homomorphic encryption,HE)是一种隐私保护方法,允许数据在处于加密状态下直接进行运算.尽管理论上同态加密具有巨大潜力,但现有方案普遍存在计算复杂度高、密文膨胀严重及资源消耗大的问题,从而制约了其实际应用.为此,提出了一种高效的基于混淆模分量的全同态加密(efficient confused modulo projection-based fully homomorphic encryption,EffiCMP-FHE)算法.该算法利用中国剩余定理对原始消息进行多模冗余编码,并设计了高效的加密、同态计算及解密流程降低运算开销.同时,针对大规模数据处理需求,构建了批处理机制,将多个消息合并为单一大整数进行并行运算,有效缩短了处理时间.为了使该算法易于使用,还设计并实现了一个基于EffiCMP-FHE的通用同态加密库,并与主流全同态加密(fully homomorphic encryption,FHE)库进行了比较.实验结果表明,该库在运算速度上具有显著优势.该研究为同态加密技术在数据隐私保护、云计算和安全多方计算等领域的应用提供了一条高效且实用的技术路径. 展开更多
关键词 隐私保护 混淆模分量 同态加密 云计算 批处理机制
暂未订购 下载PDF
Leakage-Aware Modulo Scheduling for Embedded VLIW Processors 认领 引用
8
作者 关永 薛京灵 《Journal of Computer Science & Technology》 SCIE EI CSCD 2011年第3期405-417,共13页
As semi-conductor technologies move down to the nanometer scale, leakage power has become a significant component of the total power consumption. In this paper, we present a leakage-aware modulo scheduling algorithm t... As semi-conductor technologies move down to the nanometer scale, leakage power has become a significant component of the total power consumption. In this paper, we present a leakage-aware modulo scheduling algorithm to achieve leakage energy saving for applications with loops on Very Long Instruction Word （VLIW） architectures. The proposed algorithm is designed to maximize the idleness of function units integrated with the dual-threshold domino logic, and reduce the number of transitions between the active and sleep modes. We have implemented our technique in the Trimaran compiler and conducted experiments using a set of embedded benchmarks from DSPstone and Mibench on the cycle-accurate VLIW simulator of Trimaran. The results show that our technique achieves significant leakage energy saving compared with a previously published DAG-based （Directed Acyclic Graph） leakage-aware scheduling algorithm. 展开更多
关键词 leakage power very long instruction word （VLIW） software pipelining modulo scheduling
暂未订购 下载PDF
Clausal Presentation of Theories in Deduction Modulo 认领 引用
9
作者 高建华 《Journal of Computer Science & Technology》 SCIE EI CSCD 2013年第6期1085-1096,共12页
Resolution modulo is an extension of first-order resolution in which rewrite rules are used to rewrite clauses during the search. In the first version of this method, clauses are rewritten to arbitrary propositions. T... Resolution modulo is an extension of first-order resolution in which rewrite rules are used to rewrite clauses during the search. In the first version of this method, clauses are rewritten to arbitrary propositions. These propositions are needed to be dynamically transformed into clauses. This unpleasant feature can be eliminated when the rewrite system is clausal, i.e., when it rewrites clauses to clauses. We show in this paper how to transform any rewrite system into a clausal one, preserving the existence of cut free proofs of any sequent. 展开更多
关键词 resolution deduction modulo cut free proof clause
暂未订购 下载PDF
带递归定义的SMT公式求解技术综述 认领 引用
10
作者 冯维直 刘嘉祥 +1 位作者 张立军 吴志林 《软件学报》 EI CSCD 北大核心 2026年第2期508-542,共35页
带有递归数据结构,如列表(list)和二叉树(tree)等数据类型的程序,在计算机领域被广泛使用.程序验证问题通常将程序转换为可满足性模理论(satisfiability modulo theories,SMT)公式进行求解.递归数据结构通常会转换为代数数据类型(algebr... 带有递归数据结构,如列表(list)和二叉树(tree)等数据类型的程序,在计算机领域被广泛使用.程序验证问题通常将程序转换为可满足性模理论(satisfiability modulo theories,SMT)公式进行求解.递归数据结构通常会转换为代数数据类型(algebraic data type,ADT)和整数等混合理论的一阶逻辑公式.另外,为表示递归数据结构的性质,程序中通常需要包含递归函数,递归函数在SMT中则需要通过包含量词和未解释函数的断言来表示.关注带有ADT和递归函数这两类递归定义SMT公式的求解方法.从SMT求解器、自动定理证明器和约束霍恩子句(constrained Horn clause,CHC)求解器这3方面对现有技术进行梳理和介绍.同时,对主流的求解工具进行统一实验对比,探究现有求解工具和技术在各类问题上的优势和缺陷,尝试寻找潜在的优化方向,为研究者提供有价值的分析和参考. 展开更多
关键词 形式化方法 递归函数 可满足性模理论 归纳推理 引理合成 约束霍恩子句
暂未订购 下载PDF
Distribution modulo 1 of a linear sequence associated to a multiplicative function evaluated at polynomial arguments 认领 引用
11
作者 DESHOUILLERS Jean-Marc HASSANI Mehdi 《Science China Mathematics》 SCIE 2010年第9期2203-2206,共4页
In two previous papers,the first named author jointly with Florian Luca and Henryk Iwaniec,have studied the distribution modulo 1 of sequences which have linear growth and are mean values of multiplicative functions o... In two previous papers,the first named author jointly with Florian Luca and Henryk Iwaniec,have studied the distribution modulo 1 of sequences which have linear growth and are mean values of multiplicative functions on the set of all the integers.In this note,we give a first result concerning sequences with linear growth associated to the mean values of multiplicative functions on a set of polynomial values,proving the density modulo 1 of the sequencem[∑((m2+1))(m2+1)(m≤n)]n.This result is but an illustration of the theme which is currently being developed in the PhD thesis of the second named author. 展开更多
关键词 distribution modulo 1 multiplicative function sieve
暂未订购 下载PDF
On Binary Quadratic Forms Modulo n 认领 引用
12
作者 Yang Liu Yi Ouyang 《Communications in Mathematics and Statistics》 SCIE 2019年第1期61-67,共7页
Given a binary quadratic polynomial f(x1,x2)=αx12+βx1x2+γx22∈Z[x1,x2],for every c∈Z and n≥2,we study the number of solutions NJ(f;c,n)of the congruence equation f(x1,x2)≡c mo... Given a binary quadratic polynomial f(x1,x2)=αx12+βx1x2+γx22∈Z[x1,x2],for every c∈Z and n≥2,we study the number of solutions NJ(f;c,n)of the congruence equation f(x1,x2)≡c mod n in(ZZ)2 such that xi∈(ZZ)×for i∈J⊆{1,2}. 展开更多
关键词 Binary quadratic form Counting solutions Congruence equation modulo n
Some Topological Indices of Nil-clean Graphs of Zn 认领 引用
13
作者 SU Huadong LIANG Zhunti 《数学理论与应用》 2025年第1期107-114,共8页
In this paper,we determine the Sombor index and some other vertex-degree-based topological indices for the nil-clean graphs of Zn,the ring of integers modulo n.
关键词 Nil-clean graph Ring of integers modulo n Sombor index
暂未订购 下载PDF
OpenPlanner:一个开源的时间敏感网络流量规划器 认领 引用 被引量：1
14
作者 姜旭艳 全巍 +2 位作者 付文文 张小亮 孙志刚 《计算机研究与发展》 EI CSCD 北大核心 2025年第5期1307-1329,共23页
时间敏感网络(time-sensitive networking,TSN)在工业控制、航空电子和车载网络中具有广泛的应用前景.TSN流量规划是在拓扑结构、网络资源、设备能力和业务需求等多维约束下,为TSN交换机计算关键帧的无冲突发送时刻的过程,规划问题是一... 时间敏感网络(time-sensitive networking,TSN)在工业控制、航空电子和车载网络中具有广泛的应用前景.TSN流量规划是在拓扑结构、网络资源、设备能力和业务需求等多维约束下,为TSN交换机计算关键帧的无冲突发送时刻的过程,规划问题是一个NP完全问题.目前不论是学术界的TSN规划算法研究,还是工业界的TSN部署应用都急需一个开源的规划器软件.提出一种构件化、松耦合的TSN规划器软件架构LOCAP(loose-coupled component-based architecture of planner),通过规划参数最小集和规划结果通用表等接口规范设计,实现规划算法与规划工具、规划器软件与交换硬件实现的松耦合.OpenPlanner是基于LOCAP架构使用Python语言编写的开源TSN规划器,其内嵌自研和第三方贡献的多个可满足性模理论规划算法和启发式规划算法.基于OpenPlanner对不同算法的运行时间开销以及解的质量进行了评估,指出多样化的TSN应用场景需要不同的规划算法.据调研,OpenPlanner是目前唯一的开源TSN规划器,规划结果已部署到OpenTSN开源网络、银河衡芯TSN芯片以及芯准TTE等多个硬件平台,在卫星、无人车和火炮等多个系统中得到应用. 展开更多
关键词 时间敏感网络 流量规划器 开源 可满足性模理论 时间感知整形器
暂未订购 下载PDF
模p2上二项指数和的四次均值 认领 引用
15
作者 陈丽 孟园园 《四川大学学报（自然科学版）》 CAS CSCD 北大核心 2025年第5期1073-1078,共6页
二项指数和的均值问题是解析数论研究的热点之一.在前期研究模p(p是奇素数)上二项指数和的四次均值的基础上,本文运用解析方法以及模p2同余方程解的性质,进一步研究了该和式在模p2上的四次均值计算问题,给出了一个有趣的计算公式... 二项指数和的均值问题是解析数论研究的热点之一.在前期研究模p(p是奇素数)上二项指数和的四次均值的基础上,本文运用解析方法以及模p2同余方程解的性质,进一步研究了该和式在模p2上的四次均值计算问题,给出了一个有趣的计算公式和渐近公式.本文的研究结果扩充了二项指数和均值的研究内容,研究思路为进一步研究一般模q上二项指数和的均值提供了一种新颖有效的方法. 展开更多
关键词 二项指数和 四次均值 解析方法 复合模
暂未订购 下载PDF
全轮超轻量级分组密码PFP的相关密钥差分分析 认领 引用 被引量：3
16
作者 严智广 韦永壮 叶涛 《电子与信息学报》 EI CAS CSCD 北大核心 2025年第3期729-738,共10页
2017年,PFP作为一种超轻量级分组密码被提出,而因其卓越的实现性能备受业界广泛关注。该算法不仅硬件开销需求低(仅需约1355 GE(等效门))、功耗小,而且加解密速度快(其速度甚至比国际著名算法PRESENT的实现速度快1.5倍),非常适合在物联... 2017年,PFP作为一种超轻量级分组密码被提出,而因其卓越的实现性能备受业界广泛关注。该算法不仅硬件开销需求低(仅需约1355 GE(等效门))、功耗小,而且加解密速度快(其速度甚至比国际著名算法PRESENT的实现速度快1.5倍),非常适合在物联网环境中使用。在PFP算法的设计文档中,作者声称该算法具有足够的能力抵御差分攻击、线性攻击及不可能差分攻击等多种密码攻击方法。然而该算法是否存在未知的安全漏洞是目前研究的难点。该文基于可满足性模理论(SMT),结合PFP算法轮函数特点,构建两种区分器自动化搜索模型。实验测试结果表明:该算法在32轮加密中存在概率为2–62的相关密钥差分特征。由此,该文提出一种针对全轮PFP算法的相关密钥恢复攻击,即只需263个选择明文和248次全轮加密便可破译出80 bit的主密钥。这说明该算法无法抵抗相关密钥差分攻击。 展开更多
关键词 轻量级分组密码算法 差分密码分析 密钥恢复攻击 可满足性模理论
暂未订购 下载PDF
高效扩展滑动创新滤波相位解缠算法 认领 引用
17
作者 望倪涛 谢先明 +2 位作者 王鑫汉 胡佳俊 贾金国 《遥感信息》 CSCD 北大核心 2025年第5期117-128,共12页
针对现有相位解缠算法难以兼顾效率与精度的问题,提出了一种高效的扩展滑动创新滤波相位解缠算法,用于从干涉图中获取精确的解缠相位。首先,将扩展滑动创新滤波器与高效局部相位梯度估计器相结合,构建扩展滑动创新滤波相位解缠程序;其次... 针对现有相位解缠算法难以兼顾效率与精度的问题,提出了一种高效的扩展滑动创新滤波相位解缠算法,用于从干涉图中获取精确的解缠相位。首先,将扩展滑动创新滤波器与高效局部相位梯度估计器相结合,构建扩展滑动创新滤波相位解缠程序;其次,将扩展滑动创新滤波相位解缠程序与哈尔模小波变换图像分解技术相结合,有效提升干涉图相位解缠效率。该算法的有效性与稳健性通过模拟和实测干涉图的相位解缠实验结果得到了验证。与常用的迭代最小二乘算法、最小费用流算法和质量图引导算法相比,该算法在精度上至少提升了4.12个百分点,在效率上比无迹卡尔曼滤波相位解缠算法至少提升了48.66个百分点。 展开更多
关键词 扩展滑动创新滤波 相位解缠 局部相位梯度估计 哈尔模小波变换
暂未订购 下载PDF
基于四维超混沌系统的图像加密算法 认领 引用
18
作者 常举越 刘欢 《周口师范学院学报》 CAS 2025年第2期7-14,共8页
基于四维超混沌系统,探究了其动力学特性,发现该系统具有较大的复杂度值,显示出在图像加密中的潜力。基于此,利用该系统设计了一种灰度图像加密算法。算法采用改进的Zigzag算法置乱明文图像的像素点位置,利用该系统迭代产生的混沌序列... 基于四维超混沌系统,探究了其动力学特性,发现该系统具有较大的复杂度值,显示出在图像加密中的潜力。基于此,利用该系统设计了一种灰度图像加密算法。算法采用改进的Zigzag算法置乱明文图像的像素点位置,利用该系统迭代产生的混沌序列通过加取模运算扩散明文图像的像素值。为了全面评估该加密算法的效果,通过MATLAB绘制了直方图和相邻像素图,并分析了密钥空间、信息熵及相邻像素的相关性。结果表明,这一基于四维超混沌系统的图像加密算法不仅拥有较大的密钥空间,而且在加密效果和对抗外部攻击方面均表现出色,能够有效地加密图像,安全性能较高。 展开更多
关键词 超混沌系统 图像加密 Zigzag置乱 加取模扩散
暂未订购 下载PDF
基于公钥加密的电子商务Web端用户登录认证 认领 引用
19
作者 付艳琴 赵钧 《计算机仿真》 2025年第12期373-376,494,共4页
在电子商务Web端用户登录认证中,服务器端需要在处理大量并发登录请求的同时,防止恶意攻击对服务器资源的恶意占用或数据泄露。传统密钥生成方法利用伪随机数生成器,其生成的密钥不能保证足够的随机性,使得用户身份被冒用或者用户数据... 在电子商务Web端用户登录认证中,服务器端需要在处理大量并发登录请求的同时,防止恶意攻击对服务器资源的恶意占用或数据泄露。传统密钥生成方法利用伪随机数生成器,其生成的密钥不能保证足够的随机性,使得用户身份被冒用或者用户数据被篡改。于是提出基于公钥加密的电子商务Web端用户登录认证方法。分析电子商务Web端的用户端、服务器、数据库的用户认证安全需求,基于这些安全需求,通过认证多项式的取模运算生成密钥,这种运算方式能够充分利用多项式的特性以及取模运算的非线性,从而确保生成的密钥具有高度的随机性。在生成密钥后,进一步确定公钥和私钥,并计算密文。为了确保公钥加密可以被成功解密,设置了两个互为素数的正整数约束条件。在登录过程中,用户将包含前面生成的密钥和身份证书发送给服务器,服务器则使用对应的公钥和身份证书验证,实现登录认证。实验证明,所提方法能准确识别合法用户和非法用户,可应对多种攻击实现用户身份的唯一性确认和不可否认性。 展开更多
关键词 公钥加密 电子商务 用户登录认证 安全需求分析 取模运算
暂未订购 下载PDF
Comparison of PM10 concentrations and metal content in three different sites of the Venice Lagoon: An analysis of possible aerosol sources 认领 引用 被引量：4
20
作者 Daniele Contini Franco Belosi +3 位作者 Andrea Gambaro Daniela Cesari Angela Maria Stortini Maria Chiara Bove 《Journal of Environmental Sciences》 SCIE EI CAS CSCD 2012年第11期1954-1965,共12页
The Venice Lagoon is exposed to atmospheric pollutants from industrial activities, thermoelectric power plants, petrochemical plants, incinerator, domestic heating, ship traffic, glass factories and vehicular emission... The Venice Lagoon is exposed to atmospheric pollutants from industrial activities, thermoelectric power plants, petrochemical plants, incinerator, domestic heating, ship traffic, glass factories and vehicular emissions on the mainland. In 2005, construction began on the mobile dams （MOSE）, one dam for each channel connecting the lagoon to the Adriatic Sea as a barrier against high tide. These construction works could represent an additional source of pollutants. PM10 samples were taken on random days between 2007 and 2010 at three different sites： Punta Sabbioni, Chioggia and Malamocco, located near the respective dam construction worksites. Chemical analyses of V, Cr, Fe, Co, Ni, Cu, Zn, As, Mo, Cd, Sb, T1 and Pb in PM10 samples were performed by Inductively coupled plasma- quadrupole mass spectrometry （ICP-QMS） and results were used to identify the main aerosol sources. The correlation of measured data with meteorology, and source apportionment, failed to highlight a contribution specifically associated to the emissions of the MOSE construction works. The comparison of the measurements at the three sites showed a substantial homogeneity of metal concentrations in the area. Source apportionment with principal component analysis （PCA） and positive matrix factorization （PMF） showed that a four principal factors model could describe the sources of metals in PM10. Three of them were assigned to specific sources in the area and one was characterised as a source of mixed origin （anthropogenic and crustal）. A specific anthropogenic source of PM10 rich in Ni and Cr, active at the Chioggia site, was also identified. 展开更多
关键词 MOdulo Sperimentale Elettromeccanico metals Venice Lagoon PM10 principal component analysis positive matrixfactorization
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 12 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈