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

作者： Veloso, Sheila R.M. Veloso, Paulo A.S. Veloso, Paula M. Systems and Computer Engin. Dept. Fac. of Engineering UERJ: State University of Rio de Janeiro Rio de Janeiro RJ Brazil Systems and Computer Engineering Program COPPE UFRJ: Federal University of Rio de Janeiro Rio de Janeiro RJ Brazil Mathematics Dept. ICEx UFMG: Federal University of Minas Gerais Belo Horizonte MG Brazil

We introduce and examine a tool for analysing logics. This algebraic tool, coming from some ideas introduced by J. Piaget, provides condensed information about a logic (with emphasis on the behavior of a unary symbol), as such, it can be employed for analysing and, to some extent, comparing logics. © 2011 Elsevier B.V. All rights reserved.

关键词： computer circuits

来源：评论

学校读者我要写书评

暂无评论

Porantim-Opt: Optimizing the Combined Selection of Model-Based Testing Techniques

Porantim-Opt: Optimizing the Combined Selection of Model-Bas...

引用

IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW

作者： Arilo Claudio Dias Neto Rosiane de Freitas Rodrigues Guilherme Horta Travassos Computer Science Department Federal University of Amazonas Manaus Brazil Systems Engineering and Computer Science Program-COPPE Federal University of Rio de Janeiro Rio de Janeiro Rio de Janeiro Brazil

The combination of testing techniques is considered an effective strategy to evaluate a software product. However, the selection of which techniques to combine in a software project has been an interesting challenge in the Software engineering field. This paper presents a proposal extending an approach developed to support the combined selection of model-based testing (MBT) techniques, named Porantim, applying Multiobjective Combinatorial Optimization strategy by determining the smallest dominating set in a bipartite and weighted graph. Thus, a local search strategy algorithm is proposed generating solutions aiming at maximizing the coverage of software project characteristics and skills required by the testing team to use the techniques and minimizing the eventual effort to construct models used for test cases generation. A preliminary evaluation analyzes this new approach when compared to the Porantim's original version, and the results indicate improvements in the MBT techniques selection.

关键词： Software Testing Analytical models Software engineering Optimization programming Search problems

来源：评论

学校读者我要写书评

暂无评论

Provenance management in Swift

Provenance management in Swift

引用

作者： Gadelha Jr., Luiz M.R. Clifford, Ben Mattoso, Marta Wilde, Michael Foster, Ian Computer and Systems Engineering Program Federal University of Rio de Janeiro Brazil National Laboratory for Scientific Computing Brazil Computation Institute University of Chicago United States Mathematics and Computer Science Division Argonne National Laboratory United States

The Swift parallel scripting language allows for the specification, execution and analysis of large-scale computations in parallel and distributed environments. It incorporates a data model for recording and querying provenance information. In this article we describe these capabilities and evaluate the interoperability with other systems through the use of the Open Provenance Model. We describe Swift's provenance data model and compare it to the Open Provenance Model. We also describe and evaluate activities performed within the Third Provenance Challenge, which consisted of implementing a specific scientific workflow, capturing and recording provenance information of its execution, performing provenance queries, and exchanging provenance information with other systems. Finally, we propose improvements to both the Open Provenance Model and Swift's provenance system. © 2011 Elsevier B.V. All rights reserved.

关键词： Interoperability

来源：评论

学校读者我要写书评

暂无评论

Exploring provenance in high performance scientific computing

Exploring provenance in high performance scientific computin...

引用

1st Annual 2011 Workshop on High-Performance Computing Meets Databases, HPCDB'11, Co-located with Supercomputing, SC'11

作者： Gadelha Jr., Luiz M.R. Wilde, Michael Mattoso, Marta Foster, Ian Computer and Systems Engineering Program Federal University of Rio de Janeiro Brazil National Laboratory for Scientific Computing Brazil Mathematics and Computer Science Division Argonne National Laboratory United States Computation Institute Argonne National Laboratory University of Chicago United States Department of Computer Science University of Chicago United States

ISBN: (纸本)9781450311571

Large-scale scientific computations are often organized as a composition of many computational tasks linked through data flow. After the completion of a computational scientific experiment, a scientist has to analyze its outcome, for instance, by checking inputs and outputs of computational tasks that are part of the experiment. This analysis can be automated using provenance management systems that describe, for instance, the production and consumption relationships between data artifacts, such as files, and the computational tasks that compose the scientific application. In this article, we explore the relationship between high performance computing and provenance management systems, observing that storing provenance as structured data enriched with information about the runtime behavior of computational tasks in high performance computing environments can enable interesting and useful queries to correlate computational resource usage, scientific parameters, and data set derivation. We briefly describe how provenance of many-task scientific computations specified and coordinated by the Swift parallel scripting system is gathered and queried. © 2011 ACM.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Generating Activity Streams from Events occurring in company-internal IT infrastructures

Generating Activity Streams from Events occurring in company...

引用

2011 IEEE 13th International Conference on Communication Technology(ICCT 2011)

作者： Eng.S.M.Khaled Reza S.M.Mohsin Reza Masters Program in Computational Engineering (Distributed Systems Engineering) Faculty of Computer Science Dresden University of Technology Dresden Germany Masters Program in Information Technology (Embedded Systems Engineering) Faculty of Computer Science Electrical Engineering and Information Technology University of Stuttgart Germany

In the current era of technology,the Internet and web technologies become the center source of *** to the huge amount of contents,one of the main challenges of modern information technology is aimed at how to reduce and manage information in a structured way with mobilizing users to the similar kind of relevant ***,any intelligent system should be able to understand people's interest about a particular type of information and automatically mobilize him to the similar kind of available information *** idea of high level Activity Streams along with its standardized format can play a vital role to solve this problem in the broader *** paper introduces a novel system called CoASGen (Consolidation and Activity Streams Generator) which is able to automatically generate high level Activity Streams after aggregating and consolidating from different independent systems (*** a software company context:version management system,wikis,bug trackers etc.).It retrieves life time information as heterogeneous web feed by sensing user activities from those independent systems and then it transforms several similar types of atomic activities into high level Activity Streams using semantic technologies along with its specific standardized ***,it shows these high level Activity Streams to the user interface which is able to automatically motivate users to find relevant information easily without either missing any data or losing valuable *** system solves the problem "data silos" by reducing and managing information in a structured way.

关键词： Activity Streams,Atomic Activity,High Level Activity Stream,CoASGen System

来源：评论

学校读者我要写书评

暂无评论

Modularity detection in protein-protein interaction networks

引用

BMC Research Notes 2011年第1期4卷 1-6页

作者： Narayanan, Tejaswini Gersten, Merril Subramaniam, Shankar Grama, Ananth Department of Electrical and Computer Engineering University of California San Diego United States Graduate Program in Bioinformatics and Systems Biology University of California San Diego United States Department of Bioengineering University of California San Diego United States Department of Computer Science Purdue University West Lafayette IN United States

Background: Many recent studies have investigated modularity in biological networks, and its role in functional and structural characterization of constituent biomolecules. A technique that has shown considerable promise in the domain of modularity detection is the Newman and Girvan (NG) algorithm, which relies on the number of shortest-paths across pairs of vertices in the network traversing a given edge, referred to as the betweenness of that edge. The edge with the highest betweenness is iteratively eliminated from the network, with the betweenness of the remaining edges recalculated in every iteration. This generates a complete dendrogram, from which modules are extracted by applying a quality metric called modularity denoted by Q. This exhaustive computation can be prohibitively expensive for large networks such as Protein-Protein Interaction Networks. In this paper, we present a novel optimization to the modularity detection algorithm, in terms of an efficient termination criterion based on a target edge betweenness value, using which the process of iterative edge removal may be terminated. Results: We validate the robustness of our approach by applying our algorithm on real-world protein-protein interaction networks of Yeast, *** and Drosophila, and demonstrate that our algorithm consistently has significant computational gains in terms of reduced runtime, when compared to the NG algorithm. Furthermore, our algorithm produces modules comparable to those from the NG algorithm, qualitatively and quantitatively. We illustrate this using comparison metrics such as module distribution, module membership cardinality, modularity Q, and Jaccard Similarity Coefficient. Conclusions: We have presented an optimized approach for efficient modularity detection in networks. The intuition driving our approach is the extraction of holistic measures of centrality from graphs, which are representative of inherent modular structure of the underlying network, and the applic

关键词： Biological Network Jaccard Index Input Network High Betweenness Jaccard Similarity Coefficient

来源：评论

学校读者我要写书评

暂无评论

Prediction of porosity in casting junctions using a mathematical model developed through design of experiments

Prediction of porosity in casting junctions using a mathemat...

引用

39th Annual North American Manufacturing Research Conference, NAMRC39

作者： Mane, Abhay Awad, Mahmoud Orady, Elsayed Knight, James College of Engineering and Computer Science AENG Program University of Michigan-Dearborn Dearborn MI United States Department of Industrial Engineering ALHOSN University Abu Dhabi United Arab Emirates Department of Industrial and Manufacturing Systems Engineering University of Michigan-Dearborn Dearborn MI United States

ISBN: (纸本)9781618390578

Proper design of castings is essential to avoid casting defects that cannot be eliminated by design of tooling and process parameters. Shrinkage porosity is one of the defects which usually occur at casting junctions and cannot be easily eliminated. Currently, designers use rules that were established based on experience and intuition and are not supported by proper experimentation. In this paper an approach to design and optimize design of casting junctions using a database of mathematical models is presented. The mathematical models give relationships between porosity and the junctions' dimensional features. To illustrate this approach, a mathematical model for a V-junction has been developed using Design of Experiments (DoE) and regression analysis techniques. The experimental runs for the study are established using a D-optimality criterion and conducted using MAGMASoft, comprehensive software for casting simulation, for measuring porosity in casting junctions. The simulations carried out in MAGMASoft are validated by comparing its results with experimental results from previous studies. The mathematical model is then developed by applying regression analysis. The results of the model have been validated and found to agree with both the experimental and the validation simulation experiments.

关键词： Regression analysis

来源：评论

学校读者我要写书评

暂无评论

A parallel architecture for ray-tracing with an embedded intersection algorithm

A parallel architecture for ray-tracing with an embedded int...

引用

IEEE International Symposium on Circuits and systems (ISCAS)

作者： Alexandre S. Nery Nadia Nedjah Felipe M.G. França Lech Jozwiak LAM-Computer Architecture and Microelectronics Laboratory Systems Engineering and Computer Science Program COPPE Universidade Federal do Rio de Janeiro Brazil Department of Electrical Engineering-Electronic Systems Eindhovan University of Technology Netherlands Department of Electronics Engineering and Telecommunications-Faculty of Engineering Universidade do Estado do Rio de Janeiro (UERJ) Brazil

Real time rendering of three-dimensional scenes in Ray Tracing is a hard problem. However, parallel implementations have been enabling real time performance, as the algorithm can be highly parallelized. Thus, a custom parallel design in hardware is likely to achieve a good performance. In this paper, we further improve the GridRT architecture overall performance by embedding the ray-triangle intersection computation into the precessing elements that form the architecture. Low cost and high rendering performance are the main concerns in this novel design. The results show that the execution time of each intersection computation is reduced by at least 50%, while the area cost is practically unchanged or even reduced when compared to the original GridRT implementation.

关键词： Ray tracing Registers Equations USA Councils Mathematical model Parallel architectures

来源：评论

学校读者我要写书评

暂无评论

A Verification Mechanism of Feature Models for Mobile and Context-Aware Software Product Lines

A Verification Mechanism of Feature Models for Mobile and Co...

引用

Brazilian Symposium on Software Components, Architectures and Reuse (SBCARS)

作者： Fabiana G. Marinho Rossana M.C. Andrade Cl´udia Werner Graduate Program in Computer Science Federal University of Ceará Fortaleza Brazil Systems Engineering and Computer Science Program Federal University of Rio de Janeiro Rio de Janeiro Brazil

Software Product Lines (SPLs) have been used to develop mobile and context-aware applications, which provide services and data for their users from anywhere and at any time using context information. In SPLs, commonality and variability of a system family are identified and often documented in a feature model. However, the development of a feature model for mobile and context-aware SPLs is not trivial, since it should comprise system and context information. Furthermore, the consistency check of feature models in the considered domain is also complex and demands advanced skills of software engineers. This paper proposes a mechanism to formalize and verify the correctness and consistency of feature models for mobile and context-aware SPLs based on a profile enriched with OCL specifications.

关键词： Unified modeling language Context Context modeling Mobile communication Adaptation models Software

来源：评论

学校读者我要写书评

暂无评论

A Parallel Ray Tracing Architecture Suitable for Application-Specific Hardware and GPGPU Implementations

A Parallel Ray Tracing Architecture Suitable for Application...

引用

Euromicro Symposium on Digital System Design

作者： Alexandre S. Nery Nadia Nedjah Felipa M.G. Franca Lech Jozwiak LAM-Computer Architecture and Microelectronics Laboratory Systems Engineering and Computer Science Program COPPE Universidade Federal do Rio de Janeiro Brazil Department of Electrical Engineering-Electronic Systems Eindhoven University of Technology Netherlands Universidade do Estado do Rio de Janeiro Rio de Janeiro RJ BR

The Ray Tracing rendering algorithm can produce high-fidelity images of 3-D scenes, including shadow effects, as well as reflections and transparencies. This is currently done at a processing speed of at most 30 frames per second. Therefore, actual implementations of the algorithm are not yet suitable for interactive real-time rendering, which is required in games and virtual reality based applications. Fortunately, the algorithm allows for massive parallelization of its computations. In this paper, we present a parallel architecture for ray tracing based on a uniform spatial subdivision of the scene and exploiting an embedded computation of ray-triangle intersections. This approach allows for a significant acceleration of intersection computations, as well as, a reduction of the total number of the required intersections checks. Furthermore, it allows for these checks to be performed in parallel and in advance for each ray. In this paper we discuss and analyze an ASIP-based implementation using FPGAs and a GPGPU-based parallel implementation of the proposed architecture. The performance of both implementations are reported and compared.

关键词： Ray tracing Graphics processing unit Instruction sets computer architecture Registers Image color analysis Hardware

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：