检索结果-内蒙古大学图书馆

Continuous ranking on uncertain streams

Frontiers of Computer Science 2012年第6期6卷 686-699页

作者： Cheqing JIN Jingwei ZHANG Aoying ZHOU Shanghai Key Laboratory of Trustworthy Computing Software Engineering InstituteEast China Normal UniversityShanghai 200062China

Data uncertainty widely exists in many web applications, financial applications and sensor networks. Ranking queries that return a number of tuples with maximal ranking scores are important in the field of database management. Most existing work focuses on proposing static solutions for various ranking semantics over uncertain data. Our focus is to handle continuous ranking queries on uncertain data streams： testing each new tuple to output highly-ranked tuples. The main challenge comes from not only the fact that the possible world space will grow exponentially when new tuples arrive, but also the requirement for low space- and time- complexity to adapt to the streaming environments. This paper aims at handling continuous ranking queries on uncertain data streams. We first study how to handle this issue exactly, then we propose a novel method （exponential sampling） to estimate the expected rank of a tuple with high quality. Analysis in theory and detailed experimental reports evaluate the proposed methods.

关键词： possible world semantics uncertain data stream continuous ranking query sampling

来源：评论

学校读者我要写书评

暂无评论

Numeric-Based XML Labeling Schema by Generalized Dynamic Method

引用

Journal of shanghai Jiaotong university(Science) 2012年第2期17卷 203-208页

作者：倪叶峰范远超谈昕澄崔锦王晓玲 Shanghai Key Laboratory of Trustworthy Computing Software Engineering InstituteEast China Normal University

Most efficient indeces and query techniques over XML （extensible markup language） data are based on a certain labeling scheme, which can quickly determine ancestor-descendant and parent-child relationship between two nodes. The current basic labeling schemes such as containment scheme and prefix scheme cannot avoid re- labeling when XML documents are updated. After analyzing the essence of existing dynamic XML labels such as compact dynamic binary string （CDBS） and vector encoding, this paper gives a common unifying framework for the numeric-based generalized dynamic label, which can be implemented into a variety of dynamic labels according to the different user-defined value comparison methods. This paper also proposes a novel dynamic labeling scheme called radical sign label. Extensive experiments show that the radical sign label performs well for the initialization, insertion and query operations, and especially for skewed insertion where the storage cost of the radical sign label is better than that of former methods.

关键词： dynamic labeling scheme compact dynamic binary string (CDBS) vector encoding

来源：评论

学校读者我要写书评

暂无评论

Partially-hiding functional encryption for degree-2 polynomials with fine-grained access control

引用

Frontiers of Computer Science 2024年第3期18卷 231-233页

作者： Haifeng QIAN Cheng LIN Qiaohan CHU Jie CHEN Shanghai Key Laboratory of Trustworthy Computing Software Engineering InstituteEast China Normal UniversityShanghai 200062China

1 Introduction Boneh et al.[1]first systematically introduce the concept of Functional Encryption(FE)which overcomes all-or-nothing limitation of traditional public key ***,FE hides a potential problem:even if the secret key is obtained legitimately,once it is released,it can be used *** leads to that the secret key may leak information *** deal with this problem and make FE more practical,Abdalla et al.[2]recently constructed inner-product FE(IPFE)with fine-grained access control achieving strong security guarantees under standard assumptions.

关键词： grain Encryption encryption

来源：评论

学校读者我要写书评

暂无评论

Service refinement

引用

Science in China(Series F) 2008年第6期51卷 661-682页

作者： HE JiFeng Software Engineering Institute Shanghai key Laboratory of Trustworthy Computing East China NormalUniversity Shanghai 200062 China

This paper presents a refinement calculus for service components. We model the behaviour of individual service by a guarded design, which enables one to separate the responsibility of clients from the commitment made by the system, and to identify a component by a set of failures and divergences. Protocols are introduced to coordinate the interactions between a component with the external environment. We adopt the notion of process refinement to formalize the substitutivity of components, and provide a complete proof method based on the notion of simulations.

关键词： service component refinement

来源：评论

学校读者我要写书评

暂无评论

computing rarity on uncertain data

引用

Science China(Information Sciences) 2011年第10期54卷 2028-2039页

作者： JIN CheQing,ZHOU MinQi & ZHOU AoYing shanghai key laboratory of trustworthy computing,software engineering institute,East China Normal University,shanghai 200062,China Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute East China Normal University Shanghai China

The essence of uncertain data management has been well adopted since data uncertainty widely exists in lots of applications,such as Web,sensor networks,*** of the uncertain data models are based on the possible world *** the number of the possible worlds will blowup exponentially with the growth of the data set,it is much more challenging to handle uncertain data than deterministic *** this paper,we take the first attempt to study the rarity,an important statistic that describes the proportion of items with the same frequency,upon uncertain *** have proposed three novel solutions,including an exact method and an approximate method to compute the rarity of a given frequency respectively,and a method to find the frequency of the maximum *** in theorem and extensive experimental results demonstrate the effectiveness and efficiency of the proposed solutions.

关键词： rarity uncertain data possible world

来源：评论

学校读者我要写书评

暂无评论

Simulation of free-surface flow using a boundless grid

引用

Science China(Information Sciences) 2013年第3期56卷 38-47页

作者： WANG ChangBo ZHANG Qiang KONG FanLong Software Engineering Institute East China Normal University Shanghai Key Laboratory of Trustworthy Computing East China Normal University

Physically based fluid simulation in recent years has been successful for small-scale fluids such as liquid in a cubic ***,for boundless free-surface flow of large scale and irregular area,there is a critical trade-off between simulation efficiency and accuracy because of the restriction of the traditional regular computational *** paper introduces boundless computational grids based on hierarchical runlength encoding to simulate large-scale free-surface *** first modeled the free-surface flow with a lattice Boltzmann method,and calculated the surface curvature in the update *** then introduced an effective method with which to calculate the surface curvature according to the surface tension so that the surface detail was enhanced,and obtained the curvature of each surface effectively as it was ***,we dynamically compressed and indexed the computational cells with the improved hierarchical run-length encoding algorithm,so that the grid expands dynamically according to the fluid flow and the computational resources used were proportional to the volume of the *** fluids in different situations were simulated *** proposed method makes the best of the computational resources to perform the simulation with high resolution,and dynamically allocates resources so that the fluid can expand in random directions without boundaries,which is suited to the simulation of large-scale visual scenes.

关键词： fluid simulation free surface boundless grid hierarchical run-length encoding computing resource

来源：评论

学校读者我要写书评

暂无评论

Requirements monitoring for Internetware:an interaction based approach

引用

Science China(Information Sciences) 2013年第8期56卷 89-103页

作者： CHEN XiaoHong LIU Jing LIU Zhiming Shanghai Key Laboratory of Trustworthy Computing East China Normal University International Institute of Software Technology United Nations University

The behavior of an Internetware system,which is running in a dymamic and open environment,is likely to deviate from its original requirements *** this paper,we propose an interaction based requirements monitoring approach for *** the Internetware requirements are transformed into an environment based Internetware specification in terms of expected interactions between the Internetware system and its *** we monitor the running Internetware system,collect the Internetware system behaviors in terms of actual interactions between the Internetware system and its environment,and compare the Internetware system behaviors with its *** a monitoring report is *** environment change is more predictable than requirement change,our approach could handle environment changes and Internetware system evolution by updating its environment.A framework of the interaction based requirements monitoring is ***,a corresponding monitor is *** last,a case study is carried on to illustrate the feasibility of our approach.

关键词： Internetware environment entity requirements monitoring environment based requirements description interaction

来源：评论

学校读者我要写书评

暂无评论

On the Convergence Rate of a Class of Proximal-Based Decomposition Methods for Monotone Variational Inequalities

引用

Journal of the Operations Research Society of China 2015年第3期3卷 347-362页

作者： Xiang-Feng Wang Shanghai Key Lab for Trustworthy Computing Software Engineering InstituteEast China Normal UniversityShanghai 200062China

A unified efficient algorithm framework of proximal-based decomposition methods has been proposed for monotone variational inequalities in 2012,while only global convergence is proved at the same *** this paper,we give a unified proof on theO(1/t)iteration complexity,together with the linear convergence rate for this kind of proximal-based decomposition *** theε-optimal iteration complexity result defined by variational inequality,the non-ergodic relative error of adjacent iteration points is also proved to decrease in the same ***,the linear convergence rate of this algorithm framework can be constructed based on some special variational inequality properties,without necessary strong monotone conditions.

关键词： Variational inequality Proximal point algorithm Iteration complexity Relative error Convergence rate Error bound

来源：评论

学校读者我要写书评

暂无评论

OpenLS-DGF: An Adaptive Open-Source Dataset Generation Framework for Machine Learning Tasks in Logic Synthesis

引用

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2025年

作者： Ni, Liwei Wang, Rui Liu, Miao Meng, Xingyu Lin, Xiaoze Liu, Junfeng Luo, Guojie Chu, Zhufei Qian, Weikang Yang, Xiaoyan Xie, Biwei Li, Xingquan Li, Huawei Chinese Academy of Sciences State Key Lab of Processors Institute of Computing Technology Beijing100190 China Pengcheng Laboratory Shenzhen518055 China University of Chinese Academy of Sciences Beijing101408 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China University of Chinese Academy of Sciences School of Computer Science and Technology Beijing100049 China Peking University School of Computer Science Center for Energy-Efficient Computing and Applications Beijing100871 China Ninbo University Faculty of Electrical Engineering and Computer Science Ninbo315211 China Shanghai Jiao Tong University University of Michigan-Shanghai Jiao Tong University Joint Institute MoE Key Laboratory of Artificial Intelligence Shanghai200240 China Hangzhou Dianzi University School of Electronics and Information Engineering Hangzhou311121 China

This paper introduces OpenLS-DGF, an adaptive logic synthesis dataset generation framework, to enhance machine learning (ML) applications within the logic synthesis process. Previous dataset generation flows were tailored for specific tasks or lacked integrated ML capabilities. While OpenLS-DGF supports various machine learning tasks by encapsulating the three fundamental steps of logic synthesis: Boolean representation, logic optimization, and technology mapping. It preserves the original information in both Verilog and ML-friendly GraphML formats. The Verilog files offer semi-customizable capabilities, enabling researchers to insert additional steps and incrementally refine the generated dataset. Furthermore, OpenLS-DGF includes an adaptive circuit engine that facilitates the final dataset management and downstream tasks. The generated OpenLS-D-v1 dataset comprises 46 combinational designs from established benchmarks, totaling over 966,000 Boolean circuits. OpenLS-D-v1 supports integrating new data features, making it more versatile for new tasks. This paper demonstrates the versatility of OpenLS-D-v1 through four distinct downstream tasks: circuit classification, circuit ranking, quality of results (QoR) prediction, and probability prediction. Each task is chosen to represent essential steps of logic synthesis, and the experimental results show the generated dataset from OpenLSDGF achieves prominent diversity and applicability. The source code and datasets are available at https://***/Logic-Factory/ACE/blob/master/OpenLS-DGF. © 1982-2012 IEEE.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Efficient In SAR phase noise reduction via total variation regularization

引用

Science China(Information Sciences) 2015年第8期58卷 64-76页

作者： LUO XiaoMei WANG XiangFeng SUO ZhiYong LI ZhenFang State Key Laboratory of Integrated Services Networks Xidian University Department of Electronic Information Engineering Nanchang University Shanghai Key Laboratory of Trustworthy Computing Software Engineering InstituteEast China Normal University National Laboratory of Radar Signal Processing Xidian University

We consider the phase noise filtering problem for Interferometric Synthetic Aperture Radar(In SAR)using a total variation regularized complex linear least squares formulation. Although the original formulation is convex, solving it directly with the standard CVX package is time consuming due to the large problem size. In this paper, we introduce the effective and efficient alternating direction method of multipliers(ADMM) to solve the equivalent well-defined complex formulation for the real and imaginary parts of the optimization *** the iteration complexity and the computational complexity of the ADMM are established in the forms of theorems for our In SAR phase noise problem. Simulation results based on simulated and measured data show that this new In SAR phase noise reduction method not only is 3 orders of magnitude faster than the standard CVX solver, but also has a much better performance than the several existing phase filtering methods.

关键词： interferometric synthetic aperture radar phase noise reduction total variation regularization least squares formulation alternat

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：