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

Characteristics of successful collaborations to produce educated software engineering professionals

International Journal of Phytoremediation 2002年第1期21卷 119-140页

作者： Ellis, Heidi J.C. Mead, Nancy R. Moreno, Ana Tanner, Cynthia D. Ramsey, Dawn Rensselaer at Hartford Hartford CT United States Software Engineering Institute Carnegie Mellon University Pittsburgh PA United States School of Computer Science Universidad Politenica de Madrid Madrid Campus de Montegancedo Boadilla del Monte Spain West Virginia University Morgantown WV United States Dept. of Continuing Education Southern Polytechnic State University Extended University Marietta GA United States

Currently, a large gap exists between the number of open software engineering positions and the number of qualified software engineers to fill those positions. The Industry/University (I/U) subgroup of the Working Group on software engineering Education and Training (WGSEET) is investigating active collaborations between companies and universities in which non-software professionals and practitioners without formal software education are reeducated to become software engineers. This paper describes the current status of work performed by the I/U subgroup in the investigation of reeducation collaborations. It is our goal to identify the common characteristics of successful collaborations in order to provide guidance to universities and companies when constructing a collaborative program, as well as to promote future collaborations. In this paper, we report on the current activity of the I/U subgroup, describe the features of successful collaborations identified so far in our research, and provide some conclusions as to the usefulness of such collaborations. © 2002, Taylor & Francis Group, LLC.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Robomutts

引用

4th Robot World Cup Soccer Games and Conferences, RoboCup 2000

作者： Sim, Robert Russo, Paul Graham, Andrew Blair, Andrew Barnes, Nick Blair, Alan Dept. Of Computer Science and Software Engineering The University of Melbourne Australia

ISBN: (纸本)3540421858

A software control system for an autonomous mobile robot must be capable of performing many complex processing tasks in real time. Such tasks may include localising within the environment, recognising objects or safely avoiding static and dynamic obstacles. The focus for our team this year was to build a solid structural base, to be used in future RoboCup competitions. This led us to concentrate on development of effective reusable components such as a robust vision system. The RoboMutts team was a joint venture between the University of Melbourne and RMIT University. This paper focuses on the parts of the system developed at the University of Melbourne.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A framework for analysis of typed logic programs 5th

引用

5th International Symposium on Functional and Logic Programming, FLOPS 2001

作者： Lagoon, Vitaly Stuckey, Peter J. Dept. of Computer Science and Software Engineering University of Melbourne Parkville3052 Australia

ISBN: (纸本)3540417397

The paper presents a novel approach to the analysis of typed logic programs. We assume regular type descriptions of logic program variables provided by regular tree grammars. Types are used to identify components of terms which can be equated during the programs execution. This information is reflected in form of set constraints in the generic abstract domain called Type(X). The domain allows for abstract compilation of typed logic programs into set logic programs. We demonstrate how the analyzers of groundness and sharing of typed logic programs are obtained by applying the existing (untyped) techniques based on Pos and Sharing to set logic programs. The corresponding analyses in Type(Pos) and Type(Sharing) are more precise than those in Pos and Sharing. © Springer-Verlag Berlin Heidelberg 2001.

关键词： computer circuits

来源：评论

学校读者我要写书评

暂无评论

Effective strictness analysis with HORN constraints

引用

8th International Static Analysis Symposium, SAS 2001

作者： Glynn, Kevin Stuckey, Peter J. Sulzmann, Martin Dept. of Computer Science and Software Engineering The University of Melbourne VIC3010 Australia

ISBN: (纸本)3540423141

We introduce a constraint-based framework for strictness analysis applicable to ML style languages supporting higher-order functions, let-style polymorphism and algebraic data types. The analysis produces strictness types for expressions in a program. A strictness type is defined using Boolean constraints. Perhaps surprisingly, the Boolean constraints that arise during analysis are in HORN, which makes the operations on them amenable to efficient implementation. We have implemented the approach within a highly optimising Haskell compiler (GHC) and give a comparison with the current strictness analyser of GHC. © Springer-Verlag Berlin Heidelberg 2001.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

The Cassowary Linear Arithmetic Constraint Solving Algorithm

引用

ACM Transactions on computer-Human Interaction 2001年第4期8卷 267-306页

作者： Badros, Greg J. Borning, Alan Stuckey, Peter J. Dept. of Computer Science and Engineering University of Washington Seattle Box 352350 WA 98195-2350 United States Dept. of Computer Science and Software Engineering University of Melbourne Victoria 3052 Parkville Australia

Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring that a pane occupy the leftmost third of a window, or preferring that an object be contained within a rectangle if possible. Previous constraint solvers designed for user interface applications cannot handle simultaneous linear equations and inequalities efficiently. This is a major limitation, as such systems of constraints arise often in natural declarative specifications. We describe Cassowary—an incremental algorithm based on the dual simplex method, which can solve such systems of constraints efficiently. We have implemented the algorithm as part of a constraint-solving toolkit. We discuss the implementation of the toolkit, its application programming interface, and its performance. © 2001, ACM. All rights reserved.

关键词： Algorithms Cassowary constraint-solving toolkit constraints Design Theory user interface Verification

来源：评论

学校读者我要写书评

暂无评论

On the aperiodic correlation function of galois ring m-sequences 14th

On the aperiodic correlation function of galois ring m-seque...

引用

14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 2001

作者： Udaya, P. Boztaş, S. Dept. of Computer Science and Software Engineering University of Melbourne Melbourne Australia Dept. of Mathematics RMIT University Melbourne Australia

ISBN: (纸本)9783540456247

We define Gauss-like sums over the Galois Ring GR(4, r) and bound them using the Cauchy-Schwarz inequality. These sums are then used to obtain an upper bound on the aperiodic correlation function of quadriphase m-sequences constructed from GR(4, r). Our first bound δ1 has a simple derivation and is better than the previous upper bound of Shanbag et. al. for small values of N. We then make use of a result of Shanbag et. al. to improve our bound which gives rise to a bound δimproved which is better than the bound of Shanbag et. al. These results can be used as a benchmark while searching for the best phases—termed auto-optimal phases—of such quadriphase sequences for use in spread spectrum communication systems. The bounds can also be applied to many other classes of non binary sequences. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Binary sequences

来源：评论

学校读者我要写书评

暂无评论

CORBA based approach to the development of an advanced architecture in TINA service management system 12

CORBA based approach to the development of an advanced archi...

引用

12th International Workshop on Database and Expert Systems Applications, DEXA 2001

作者： Park, Heasook Choi, O-Hoon Baik, Doo-Kwon Software Systems Lab. Dept. of Computer Science and Engineering Korea University Seoul Korea Republic of

ISBN: (纸本)0769512305

In order to satisfy, the complex and various demands of the customers, telecommunication networks must provide their services rapidly and flexibly, with the support of efficient service and network management systems. To fulfill these requirements, TINA has appeared as a concept for the advanced telecommunication system using information technology such as distributed processing, object oriented modeling. We mention some problems of developing applications in the TINA service management layer. To solve the problems, we propose the advanced architecture called OMS (object management system), which consists of three managers (data manager, data access manager and metadata registry manager). OMS separates the application layer and the middleware such as ODBC and JDBC. And the application layer and OMS are connected by distributed object middleware based on CORBA. Also in order to manage efficiently managed objects stored in different repositories, we have implemented metadata registry by using the metadata concept. © 2001 IEEE.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

An efficient form classification method using partial matching 14th

引用

14th Australian Joint Conference on Artificial Intelligence, AI 2001

作者： Byun, Yungcheol Yoon, Sungsoo Choi, Yeongwoo Kim, Gyeonghwan Lee, Yillbyung Dept. of Computer Software Research Laboratory ETRI Korea Republic of Dept. of Computer Science Yonsei University Korea Republic of Dept. of Computer Science Sookmyung Women’s University Korea Republic of Dept. of Electronic Engineering Sogang University Korea Republic of

ISBN: (纸本)9783540429609

In this paper, we are proposing an efficient method of classifying form that is applicable in real life. Our method will identify a small number of local regions by their distinctive images with respect to their layout structure and then by using the DP (Dynamic Programming) matching to match only these local regions. The disparity score in each local region is defined and measured to select the matching regions. Genetic Algorithm will also be applied to select the best regions of matching from the viewpoint of a performance. Our approach of searching and matching only a small number of structurally distinctive local regions would reduce the processing time and yield a high rate of classification. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient execution of range-aggregate queries in data warehouse environments 20th

引用

20th International Conference on Conceptual Modeling, ER 2001

作者： Hong, Seokjin Song, Byoungho Lee, Sukho School of Electrical Engineering and Computer Science Seoul National University Korea Republic of Dept. of Software Science Sangmyung University Korea Republic of

ISBN: (纸本)3540428666

Range-aggregate queries on the data cube are powerful tools for analysis in data warehouse environments. Cubetree is a technique materializing a data cube through an R-tree. It provides efficient data accessibility, but involves some drawbacks to traverse all the internal and leaf nodes within given query ranges to compute range-aggregate queries. In this paper, we propose a novel index structure for materializing a data cube, called aggregate cubetree. Each record in all internal nodes of an aggregate cubetree stores the aggregate value of all child nodes of it. Therefore, range-aggregate queries on an aggregate cubetree can be processed without visiting child nodes whose parent node is fully included in the query range, by using the aggregate values in the records of each internal node. The aggregate cubetree is superior to the original cubetree because it can execute queries with a smaller number of node accesses, and shows even better performance than the original cubetree as the query range becomes larger. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Data warehouses

来源：评论

学校读者我要写书评

暂无评论

Modeling and transformation of object-oriented conceptual models into XML schema 12th

引用

12th International Conference on Database and Expert Systems Applications, DEXA 2001

作者： Xiao, Renguo Dillon, Tharam S. Chang, E. Dept. Of Computing Hong Kong Polytechnic University Hong Kong Dept. of Computer Science and Software Engineering University of Newcastle Australia Infolab Tilburg University Netherlands

ISBN: (纸本)3540425276

EXtensible Markup Language (XML) is fast emerging as the dominant standard for describing data and interchanging data between various systems and databases on the Internet. It offers the Document Type Definition (DTD) as a formalism for defining the syntax and structure of XML documents. The XML Schema definition language as a replacement of DTD provides more rich facilities for defining and constraining the content of XML documents. However, to enable efficient business application development in large-scale e- Commerce environments, XML lacks sufficient power in modeling real-world data and their complex inter-relationships in semantics. Hence, it will inevitably be necessary to use other methods to describe data paradigms and develop a true conceptual data model, and then transform this model into an XML encoded format, which can be treated as a logical model. In this paper, we present the way to model XML and to transform the Object Oriented (OO) conceptual model into XML Schema. We choose the OO conceptual model because of its expressive power for developing a combined data model. The paper first discusses the modeling of XML and why we need the transformation. Then, several generic transforming rules from the OO conceptual model to XML schema, with the emphasis on the transformations of generalization and aggregation relationships, are presented. Different perspectives regarding these conceptual relationships (e.g., ordered and homogeneous composition in aggregation relationships, inheritance and overriding in generalization relationships) and their transformations are particularly discussed. © Springer-Verlag Berlin Heidelberg 2001.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：