共查询到20条相似文献,搜索用时 197 毫秒
1.
马相芬 《计算机光盘软件与应用》2014,(8):236-237
TreeView控件是Web应用程序开发中经常用到且功能强大的控件,用来显示信息的分级视图,如同Windows里的资源管理器的目录。本文主要阐述如何根据SQL Server2008数据库中的数据,在Visual Studio2010环境中用ASP.NET TreeView控件动态生成一个无级限的树形菜单。 相似文献
2.
基于自定义模板的通用报表设计 总被引:1,自引:0,他引:1
提出了一种实现通用报表的新思想:将Excel文件转化生成自定义模板文件,模板文件包括报表的静态及动态两部分内容,静态部分主要封装了表格结构信息,动态部分主要封装了SQL语句以及与静态部分相关联信息,模板文件可以存入服务器数据库中;客户端通过通用打印组件完成报表的输出。 相似文献
3.
动态报表的打印对象的控制设计 总被引:1,自引:0,他引:1
每个信息系统的功能大多不相同,但一般都要把表或视图的联接集作为数据集进行报表打印。由于数据库不同,表结构不同,因此每个报表数据集的字段类型、宽度都不可能完全相同,这导致报表的多样性与复杂性,给报表设计带来诸多不便,通过控制报表的打印对象实现动态报表是一个有效解决该问题的方法。在水晶报表中先创建若干个打印对象,程序运行时对SQL语句获取的动态打印数据集的元素进行枚举,使每个元素与水晶报表上已存在的打印对象进行逐一匹配绑定,进而对绑定的打印对象进行控制,从而实现动态报表的目的。 相似文献
4.
针对信息管理系统中Web报表打印的问题,设计了一套基于导出的Web报表打印方案。对于样式有严格要求的报表,基于Word模板通过数据替代生成工作报表导出打印。对于样式要求不高的报表,直接导出生成Excel报表,运用二维数组向报表区域赋值。在降低编程难度,提高代码通用性和提高程序执行效率方面做出研究。同时,详细介绍了该Web报表打印方法的实现过程。在实践当中,该方法已经在某行业协会信息管理系统中成功使用。 相似文献
5.
PowerBuilder动态报表技术 总被引:2,自引:0,他引:2
在开发MIS系统时需要创建大量报表,这些报表具有不确定性,其格式、内容和数量经常根据需求发生变化。文章提出了一种新的动态报表生成技术。即采用空模板与报表描述文件组合和动态合成方法。根据用户的需求。快速方便地修改报表。 相似文献
6.
7.
工资管理系统中打印报表是非常重要的,利用delphi7.0中自带的quickreport控件,数组将dbgrid中的数据生成动态报表,并实现了自由选择需打印的工资项目。该方法灵活、简便、实用性强。 相似文献
8.
屈泽明 《电脑编程技巧与维护》2009,(24):36-39
介绍在.NET平台下利用ASP.NET技术,通过角色权限对树形目录节点的控制,实现了不同角色的用户动态生成不同树形目录的功能,并同时借助于树形目录完成角色管理的任务,具有很强的实用性。 相似文献
9.
10.
利用Delphi设计界面,实现将数据库系统中的数据,根据用户选择字段,动态生成Excel报表,实现了打印部分数据的目的。 相似文献
11.
Henk Alblas 《Acta Informatica》1987,24(3):299-352
Summary The classical attribute grammar framework can be extended by allowing the specification of tree transformation rules. A tree transformation rule consists of an input template, an output template, enabling conditions which are predicates on attribute instances of the input template, and re-evaluation rules which define the values of attribute instances of the output template. A tree transformation may invalidate attribute instances which are needed for additional transformations.In this paper we investigate whether consecutive tree transformations and attribute re-evaluations are safely possible during a single pass over the derivation tree. This check is made at compiler generation time rather than at compilation time.A graph theoretic characterization of attribute dependencies is given, showing in which cases the recomputation of attribute instances can be done in parallel with tree transformations.Part of this work was done while the author was visiting Tartan Laboratories Inc., Pittsburgh, PA, USA 相似文献
12.
周瑞 《电脑编程技巧与维护》2009,(24):50-51,61
打印毕业证时,在纸上已印好一些文字,留有一些空白,需在空白处打印上有关的数据,这就是套印。套印时最头疼的事是模板制作,很难与原始纸上的文字对齐。本文将为大家详细介绍一种方便而精确的制作模板,进行邮件合并批量套印毕业证方法。 相似文献
13.
ZHANG Shu- cai 《数字社区&智能家居》2008,(18)
Authorware中,一般的导航用按钮、菜单、超级链接、热区,热对象、框架或都他们的组合应用等,我们还可以用Authorware框架结构及TreeView控制的特点和优点,并融合Authorware框架结构和TreeView控制作制出windows树形目录一样的导航,这种导航演讲者能快速,灵活地定位演讲内容;且利目录树可展开和折叠功能,节约了板面空间;另外,树形目录导航新颖,条理清淅,能吸引听者的注意力;特别是有上百页的页面,更是一种理想的选择。 相似文献
14.
15.
16.
Gavrila DM 《IEEE transactions on pattern analysis and machine intelligence》2007,29(8):1408-1421
This paper presents a novel probabilistic approach to hierarchical, exemplar-based shape matching. No feature correspondence is needed among exemplars, just a suitable pairwise similarity measure. The approach uses a template tree to efficiently represent and match the variety of shape exemplars. The tree is generated offline by a bottom-up clustering approach using stochastic optimization. Online matching involves a simultaneous coarse-to-fine approach over the template tree and over the transformation parameters. The main contribution of this paper is a Bayesian model to estimate the a posteriori probability of the object class, after a certain match at a node of the tree. This model takes into account object scale and saliency and allows for a principled setting of the matching thresholds such that unpromising paths in the tree traversal process are eliminated early on. The proposed approach was tested in a variety of application domains. Here, results are presented on one of the more challenging domains: real-time pedestrian detection from a moving vehicle. A significant speed-up is obtained when comparing the proposed probabilistic matching approach with a manually tuned nonprobabilistic variant, both utilizing the same template tree structure. 相似文献
17.
在信息管理系统中,经常会遇到信息的维护操作,树型目录以它直观性的特点在信息维护中起到重要的作用。为了在信息管理系统中提供一种方便的树型目录维护,介绍了树型目录在Web信息展示中的使用,分析了树型目录的特点,提出并实现了基于Web组件的树型目录。在具体实现过程中,使用了Java小应用程序,以达到树型目录内容的灵活定制和使用的方便性。通过在实际项目中的使用,检验并到达了树型目录设计的目的。只要修改相应的配置文件,即可达到修改目录内容的目的。 相似文献
18.
The frequent pattern tree (FP-tree. is an efficient data structure for association-rule mining without generation of candidate
itemsets. It was used to compress a database into a tree structure which stored only large items. It, however, needed to process
all transactions in a batch way. In the past, we proposed a Fast Updated FP-tree (FUFP-tree. structure to efficiently handle
new transactions and to make the tree update process become easier. In this paper, we propose the structure of prelarge trees
to incrementally mine association rules based on the concept of pre-large itemsets. Due to the properties of pre-large concepts,
the proposed approach does not need to rescan the original database until a number of new transactions have been inserted.
The proposed approach can thus achieve a good execution time for tree construction especially when a small number of transactions
are inserted each time. Experimental results also show that the proposed approach has a good performance for incrementally
handling new transactions. 相似文献
19.
Ahmed Chowdhury Farhan Tanbeer Syed Khairuzzaman Jeong Byeong-Soo Lee Young-Koo 《Knowledge and Data Engineering, IEEE Transactions on》2009,21(12):1708-1721
Recently, high utility pattern (HUP) mining is one of the most important research issues in data mining due to its ability to consider the nonbinary frequency values of items in transactions and different profit values for every item. On the other hand, incremental and interactive data mining provide the ability to use previous data structures and mining results in order to reduce unnecessary calculations when a database is updated, or when the minimum threshold is changed. In this paper, we propose three novel tree structures to efficiently perform incremental and interactive HUP mining. The first tree structure, Incremental HUP Lexicographic Tree ({rm IHUP}_{{rm {L}}}-Tree), is arranged according to an item's lexicographic order. It can capture the incremental data without any restructuring operation. The second tree structure is the IHUP Transaction Frequency Tree ({rm IHUP}_{{rm {TF}}}-Tree), which obtains a compact size by arranging items according to their transaction frequency (descending order). To reduce the mining time, the third tree, IHUP-Transaction-Weighted Utilization Tree ({rm IHUP}_{{rm {TWU}}}-Tree) is designed based on the TWU value of items in descending order. Extensive performance analyses show that our tree structures are very efficient and scalable for incremental and interactive HUP mining. 相似文献