于戈
个性化签名
- 姓名:于戈
- 目前身份:
- 担任导师情况:
- 学位:
-
学术头衔:
享受国务院特殊津贴专家, 教育部“新世纪优秀人才支持计划”入选者, 博士生导师
- 职称:-
-
学科领域:
计算机科学技术
- 研究兴趣:
于戈,男,1962年生于大连,1982年、1985年分别毕业于东北工学院计算机专业,获学士和硕士学位,1996年于日本九州大学获工学博士学位。现任东北大学教授,博士生导师。东北大学信息学院副院长,计算机软件研究所所长,计算机985科技创新平台首席教授。
兼任国务院学位委员会第5届学科评议组成员,中国计算机学会理事、数据库专业委员会副主任委员、电子政务与办公自动化副主任委员、辽宁省计算机学会副理事长。美国ACM会员、美国IEEE会员、日本IPSJ会员。担任过多届国际会议的程序委员会委员、主席和组织委员会主席。主要研究领域为数据库理论与技术、分布与并行式信息系统、嵌入式软件、网络信息安全等。
自1995年以来,主持完成了“基于CORBA软件总线的CIMS信息集成平台的研究”等10余项国家863课题、国家自然科学基金课题,以及“新一代数据库基础技术的研究”等多项国际合作课题,有6项课题通过了省部级以上鉴定,并在宝山钢铁公司等大型企业投入应用,经济效益和社会效益显著。共获得国家科技进步奖二等奖两项,部级科技进步二等奖一项,省自然科学二等奖一项,省级科技进步三等奖两项;获得辽宁省青年科技奖,国务院特殊政府津贴,国家863计划CIMS主题先进工作者、沈阳市十大杰出青年称号。获得“霍英东青年教师基金”、教育部“跨世纪优秀人才基金”“骨干青年教师基金”“中国高校青年教师奖”。入选辽宁省《百千万人才工程》的首批百人层次、辽宁省青年学科带头人、辽宁省拔尖人才。近5年来,出版《数据仓库工程方法论》《分布式数据库》等专著4部、《事务处理》等译著2部,在国内外重要学术期刊和会议上发表论文130余篇,其中,被三大检索系统的SCI、EI、ISTP收录129篇,获得省优秀软件奖一项、软件著作权登记三项。 Ge YU received his B.E. degree and M.E degree from Northeastern University, China in 1982 and 1986, respectively, Ph.D degree from Kyushu University, Japan in 1996. He has been a professor at Northeastern University of China since 1996. He is the associated dean of School of Information Science and Engineering in charge of graduate study, the director of Institute of Computer Software and Theory, the Chair Professor of the 985 Innovation Platform for Computer Fields, at Northeastern University. He is the member of IEEE, ACM, IPSJ(Information Processing Society of Japan), and the senior member of CCF(China Computer Federation). He is the vice-chair of CCF Database Society, and the vice-chair of CCF Office Automation Society. He is the member of steering committee of WAIM Conference. He was the member of many international conferences like ICDE’2002, WISE20’05, ER’2004, DASFAA’05. His research interesting includes data base theory and technology, distributed and parallel information systems, embedded software, network information security. Ge YU has published more than 130 papers on academic journals and well-known conferences like ICDE, DASFAA, and more than 130 papers were indexed by SCI, EI and ISTP. He has written 4 books and translated 2 books in the recent 5 years. He has finished more than 10 research projects supported by the national foundation or the international foundation since 1995. He has got more that 10 academic awards from the Ministry of Education, the Ministry of Science and Technology and the governments.
-
主页访问
4262
-
关注数
0
-
成果阅读
1388
-
成果数
21
【期刊论文】Web Users' Classification Using Fuzzy Neural Network
于戈, Fang Yuan, , Huanrui Wu, and Ge Yu
KES 2004, LNAI 3213, pp. 1030-1036, 2004.,-0001,():
-1年11月30日
With the increasing of data and Web users in the Internet, it is necessary and significant to identify users for offering further possible personalized services. To implement this goal, we used the users' surfing historical data stored in the Web log as features for classification. This paper aims to develop some techniques to achieve this objective using fuzzy neural networks (FNNs). Experimental results demonstrate the effectiveness of our proposed approach.
-
59浏览
-
0点赞
-
0收藏
-
0分享
-
231下载
-
0评论
-
引用
【期刊论文】Modeling QoS for Semantic Equivalent Web Services*
于戈, Derong Shen, Ge Yu, Tiezheng Nie, Rui Li, and Xiaochun Yang
WAIM 2004, LNCS 3129, pp. 478-488, 2004.,-0001,():
-1年11月30日
Quality of Service (QoS) is an important factor for selecting a better Web service from numerous semantic equivalent Web services in Web services composition. In this paper, a QoS model (e-QoS) for evaluating semantic equivalent Web services is proposed, In which, the factors used to evaluate Web Services include Accessed Times, Invoked Success Rate, Average Responding Time, Stability Variance, and Customers Estimation. The performance of Web services in Latest Period of Time, the performance in history and the performance estimated by customers are considered together. By experiments, we concluded that e_QoS is effective for estimating Web services, and can improve the quality of web services composition greatly.
-
71浏览
-
0点赞
-
0收藏
-
0分享
-
166下载
-
0评论
-
引用
【期刊论文】MMPClust: A Skew Prevention Algorithm for Model-Based Document Clustering*
于戈, Xiaoguang Li, Ge Yu, and Daling Wang
DASFAA 2005, LNCS 3453, pp. 536-547, 2005.,-0001,():
-1年11月30日
To support very high dimensionality, model-based clustering is an intuitive choice for document clustering. However, the current model-based algorithms are prone to generating the skewed clusters, which influence the quality of clustering seriously. In this paper, the reasons of skew are examined and determined as the inappropriate initial model, the unfitness of cluster model and the interaction between the decentralization of estimation samples and the over-generalized cluster model. This paper proposes a skew prevention document-clustering algorithm (MMPClust), which has two features: (1) a content-based cluster model is used to model the cluster better; (2) at the re-estimation step, a part of documents most relevant to its corresponding class are selected automatically for each cluster as the estimation samples to break this interaction. MMPClust has less restrictions and more applicability in document clustering than the previous methods.
-
47浏览
-
0点赞
-
0收藏
-
0分享
-
136下载
-
0评论
-
引用
【期刊论文】Efficiently Mapping Integrity Constraints from Relational Database to XML Document1
于戈, Xiaochun Yang, Ge Yu, and Guoren Wang
ADBIS 2001, LNCS 2151, pp. 338-351, 2001.,-0001,():
-1年11月30日
XML is rapidly emerging as the dominant standard for exchanging data on the WWW. Most of application data are stored in relational databases due to its popularity and rich development experiences over it. Therefore, how to provide a proper mapping approach from relational data to XML documents becomes an important topic. Integrity constraints are useful for semantic specification that plays the important roles in relation schema definition. The existing XML schema language does not define general constraints and maintaining method for integrity constraints. So how to use XML to express and maintain integrity constraints especially the advanced integrity constraints, e.g., general constraints of relational data is one of challenge research issues. In this paper, a novel mapping approach is proposed to map relation data to XML document with active nodes, XMLA, and extended DTD with constraints, DTDC. The ability to maintain integrity constraints makes our approach more effective than other approaches.
-
123浏览
-
0点赞
-
0收藏
-
0分享
-
293下载
-
0评论
-
引用
【期刊论文】An Efficient Iterative Optimization Algorithm for Image Thresholding
于戈, Liju Dong, and Ge Yu
CIS 2004, LNCS 3314, pp. 1079-1085, 2004.,-0001,():
-1年11月30日
Image thresholding is one of the main techniques for image segmentation. It has many applications in pattern recognition, computer vision, and image and video understanding. This paper formulates the thresholding as an optimization problem: finding the best thresholds that minimize a weighted sum-of-squared-error function. A fast iterative optimization algorithm is presented to reach this goal. Our algorithm is compared with a classic, most commonly-used thresholding approach. Both theoretic analysis and experiments show that the two approaches are equivalent. However, our formulation of the problem allows us to develop a much more efficient algorithm, which has more applications, especially in real-time video surveillance and tracking systems.
-
75浏览
-
0点赞
-
0收藏
-
0分享
-
234下载
-
0评论
-
引用
【期刊论文】A Non-Blocking Locking Method and Performance Evaluation on Network of Workstations
于戈, Yu Ge, WANG Guoren and ZHENG Huaiyuan
J. Comput. Sci. & Technol. 2001, 16 (1): 25~38,-0001,():
-1年11月30日
A network of workstation (NOW) can act as a single and scal-able powerful computer by building a parallel and distributed computing platform on top of it. WAKASHI is such a platform system that supports persistent object management and makes full use of resources of NOW for high performance transac-tion processing. 0ne of the main diffculties to overcome is the bottleneck caused by concurrency control mechanism. Therefore, a non-blocking locking method is designed, by adopting several novel techniques to make it outperform the other typi-cal locking methods such as 2PL: 1)an SDG(Semantic Dependency Graph)based non-blocking locking protocol for fast transaction scheduling; 2)a massively virtual memory based backup-page undo algorithm for fast restart; and 3)a multi processor and multi-thread based transaction manager for fast execution. The new mechanismshave been implemented in WAKASHI and the performance comparison experiments with 2PL and DWDL have been done. The results show that the new method can outperform 2PL and DWDL under certain conditions.This is meaningful for choos-ing effective concurrency control mechanisms for improving transaction-processing performance in NOW environments.
distributed and parallel database, concurrency control, transaction management, locking mechanism, NOW (, network of workstation),
-
73浏览
-
0点赞
-
0收藏
-
0分享
-
56下载
-
0评论
-
引用
【期刊论文】A New Path Expression Computing Approach for XML Data
于戈, Jianhua Lv, Guoren Wang, Jeffrey Xu Yu, Ge Yu, Hongjun Lu, and Bing Sun
EEXTT and DIWeb 2002, LNCS 2590, pp. 35-46, 2003.,-0001,():
-1年11月30日
Most query languages in XML database systems use Regular Path Expressions (RPE) to query or extract data from databases and some query processing and optimization techniques have been proposed for RPEs. Conceptually XML documents are collections of path instances. Each path instance should conform to an XML element tag sequence, called path schema. A RPE query can be written as an automaton that can represent a language, while path schemas can be seen as sentences. In this paper, a novel RPE computing approach, automaton match (AM), is proposed. AM queries the RPEs by matching the automatons with path schemas. The experimental results show AM is quite efficient for computing RPE queries.
-
59浏览
-
0点赞
-
0收藏
-
0分享
-
80下载
-
0评论
-
引用
于戈, 王大玲†, 鲍玉斌
软件学报,2004,15(8):1182~1188,-0001,():
-1年11月30日
为了提高个性化推荐的质量,简化推荐规则生成过程中相关参数的设置,讨论了应用于个性化推荐中的关联规则的性质,定义了“推荐非空率”这一新的推荐测度以及“1-支持频繁项集”和“k最大关联规则”的概念,提出了“在1-支持频繁项集中生成k最大关联规则”的思想,设计了满足该思想且适合于不同滑动窗口深度下推荐的关联规则挖掘算法。理论分析及实验结果表明,该算法具有最大的推荐非空率、较高的推荐准确率和F-测度,并有效地简化了规则挖掘过程中阈值的设置。
1-支持, 关联规则, Web 使用挖掘, 个性化, 非空率
-
50浏览
-
0点赞
-
0收藏
-
0分享
-
105下载
-
0评论
-
引用
于戈, 张猛, 王大玲
计算机研究与发展,2004,41(10):1748~1753,-0001,():
-1年11月30日
文本聚类随着网上文本的激增以及实际应用中的需求,引起了人们越来越多的重视。通过分析文本的特征以及常用的文本聚类方法,提出了一种对文本进行细致划分获取细化簇、并在细化簇基础上进行聚类的文本聚类方法。在聚类过程中,采用曲线的多项式拟合技术提出了一种自动发现阈值的方法,并把该方法应用于细化簇的寻找步骤中。与凝聚的层次聚类方法的实验比较结果表明,使用自动阈值发现的方法在时间消耗、聚类效果、以及对孤立点的容忍性方面都具有更优的性能。
文本聚类, 细化簇, 自动阈值发现
-
102浏览
-
0点赞
-
0收藏
-
0分享
-
178下载
-
0评论
-
引用
【期刊论文】A Hybrid Machine Learning/Statistical Model of Grid Security
于戈, Guang Xiang, Ge Yu, Xiangli Qu, Xiaomei Dong, and Lina Wang
GCC 2004, LNCS 3251, pp. 348-355, 2004.,-0001,():
-1年11月30日
Most current Grid security techniques concentrate on traditional security aspects such as authentication, authorization, etc. While they have shown their usefulness, the significance of the information hidden in the historical data corpus denoting the user-Grid interactions has been largely neglected. In fact, such information provide great insight into Grid security and if properly harnessed, will help better protect the Grid against potential attacks. To utilize these hidden information in a service-oriented Grid environment, we propose a hybrid machine learning and statistical model. The machine learning component predicts the security of a service by considering the probability distribution of the past services, while the statistical component evaluates a service's security statistically based on its own past behaviors and users' opinions. We construct an overall architecture based on this hybrid model and demonstrate through examples its effectiveness and potential too er stronger security to the Grid.
-
46浏览
-
0点赞
-
0收藏
-
0分享
-
89下载
-
0评论
-
引用