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

International Conference on computer Supported Cooperative Work in Design

作者： Vanessa Tavares Nunes Cláudia M. Lima Werner Flávia Maria Santoro COPPE PESC-Systems Engineering and Computer Science Program UFRJ Rio de Janeiro Brazil NP2Tec and Postgraduate Information Systems Program UNIRIO Rio de Janeiro Brazil

Dynamism of day-to-day activities in organizations is inextricably linked and there is a variety of information, insight and reasoning being processed between people and systems, in carrying out a business process. We argue that flexibility in processes could be managed in real time, using context information collected in the work environment. This paper proposes a context management architecture approach that aims to improve and automate dynamic process adaptation. We explain how process adaptation may occur in real time and discuss a scenario for this proposal.

关键词： Context Adaptation models Organizations Cognition Context modeling Uncertainty

来源：评论

学校读者我要写书评

暂无评论

Assembling a Network out of Ambiguous Patches

Assembling a Network out of Ambiguous Patches

引用

Annual Allerton Conference on Communication, Control, and Computing

作者： Lyudmila Yartseva Jefferson Elbert Sim?es Matthias Grossglauser School of Computer and Communication Sciences école Polytechnique Fédérale de Lausanne (EPFL) Switzerland Systems Engineering and Computer Science Program COPPE Federal University of Rio de Janeiro Brazil

ISBN: (纸本)9781509045518

Many graph mining and network analysis problems rely on the availability of the full network over a set of nodes. But inferring a full network is sometimes non-trivial if the raw data is in the form of many small patches or subgraphs, of the true network, and if there are ambiguities in the identities of nodes or edges in these patches. This may happen because of noise or because of the nature of data;for instance, in social networks, names are typically not unique. Graph assembly refers to the problem of reconstructing a graph from these many, possibly noisy, partial observations. Prior work suggests that graph assembly is essentially impossible in regimes of interest when the true graph is Erdos-Rényi. The purpose of the present paper is to show that a modest amount of clustering is sufficient to assemble even very large graphs. We introduce the G(n,p;q) random graph model, which is the random closure over all open triangles of a G(n,p) Erdos-Rényi, and show that this model exhibits higher clustering than an equivalent Erdos-Rényi . We focus on an extreme case of graph assembly: the patches are small (1-hop egonets) and are unlabeled. We show that in realistic regimes, graph assembly is fundamentally feasible, because we can identify, for every edge e, a subgraph induced by its neighbors that is unique and present in every patch containing e. Using this result, we build a practical algorithm that uses canonical labeling to reconstruct the original graph from noiseless patches. We also provide an achievability result for noisy patches, which are obtained by edge-sampling the original egonets.

关键词： mining network analysis

来源：评论

学校读者我要写书评

暂无评论

A parallel architecture for Ray-Tracing

A parallel architecture for Ray-Tracing

引用

IEEE Latin American Symposium on Circuits and systems (LASCAS)

作者： Alexandre S. Nery Nadia Nedjah Felipe M.G. França LAM - Computer Architecture and Microeletronics Laboratory Systems Engineering and Computer Science Program COPPE Universidade Federal do Rio de Janeiro Department of Electronics Engineering and Telecommunications Universidade do Estado do Rio de Janeiro

Real time rendering of three-dimensional scenes in high photorealistic detail is a hard task, such as in the Ray Tracing rendering algorithm. However, parallel implementations of Ray Tracing have been enabling real time performance, as the algorithm is embarrassingly parallel. Thus, a custom parallel design in hardware is likely to achieve an acceptable performance. In this paper, we propose a hardware parallel architecture capable of dealing with the main desirable features of Ray Tracing, such as shadows and reflection effects, imposing low area cost and acceptable rendering performance.

关键词： computer architecture Interrupters computers Light sources Process control Real-time systems Telecommunications

来源：评论

学校读者我要写书评

暂无评论

Temporal logic for social networks

arXiv

引用

arXiv 2021年

作者： Machado, Vitor Benevides, Mario System Engineering and Computer Science Program Federal University of Rio de Janeiro Brazil Computing Institute Fluminense Federal University Brazil

This paper introduces a logic with a class of social network models that is based on standard Linear Temporal Logic (LTL), leveraging the power of existing model checkers for the analysis of social networks. We provide a short literature overview, and then define our logic and its axiomatization, present some simple motivational examples of both models and formulas, and show its soundness and completeness via a translation into propositional formulas. Lastly, we briefly discuss model checking and time complexity analysis. © 2021, CC BY.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Building reliable web services compositions

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2003年 2593卷 59-72页

作者： Pires, Paulo F. Benevides, Mario R.F. Mattoso, Marta System Engineering and Computer Science Program - COPPE Federal University of Rio de Janeiro Rio de Janeiro RJ 21945-970 Brazil Institute of Mathematics Federal University of Rio de Janeiro P.O. Box 68511 Rio de Janeiro RJ 21945-970 Brazil

The recent evolution of internet technologies, mainly guided by the Extensible Markup Language (XML) and its related technologies, are extending the role of the World Wide Web from information interaction to service interaction. This next wave of the internet era is being driven by a concept named Web services. The Web services technology provides the underpinning to a new business opportunity, i.e., the possibility of providing value-added Web services. However, the building of value-added services on this new environment is not a trivial task. Due to the many singularities of the Web service environment, such as the inherent structural and behavioral heterogeneity of Web services, as well as their strict autonomy, it is not possible to rely on the current models and solutions to build and coordinate compositions of Web services. In this paper, we present a framework for building reliable Web service compositions on top of heterogeneous and autonomous Web services. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Software Ecosystems: Trends and Impacts on Software engineering

Software Ecosystems: Trends and Impacts on Software Engineer...

引用

Brazilian Symposium on Software engineering (SBES)

作者： Rodrigo Santos Cl'udia Werner Olavo Barbosa Carina Alves Computer Science and System Engineering Department COPPE Federal University of Rio de Janeiro Rio de Janeiro Brazil Center of Informatics CIn Federal University of Pernambuco (UFPE) Recife Brazil

Economic and social issues are pointed out as Software engineering (SE) challenges for the next years, since the field needs to treat issues beyond the technical side. These challenges require analyzing the field of SE from another perspective. In this sense, the study of software ecosystems (SECOs) is an emerging discipline that investigates the relationships among companies in the software industry. Companies work cooperatively and competitively in order to achieve their strategic objectives. They must engage in a new perspective, now also including third parties motivations and movements in the ecosystem, besides their own business viewpoint. Inspired on properties of natural and business ecosystems, SECO covers technical and business aspects of software development as well as partnership among companies. In this paper, we undertake a review on SECOs status as an emerging research topic in SE community. We map what is currently known about SECOs and also analyze them in a three-dimensional perspective in SE, i.e., technical, business and social. We observed that SECOs research is concentrated in eight main areas in which the most relevant ones are open source software, ecosystem modeling, and business issues. This paper also contributes to summarize the body of knowledge and presents a research agenda in SECOs.

关键词： Software Ecosystems Communities Companies Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Optimizing Wireless Sensor Network Planning: Integrating Biased Random-Key Genetic Algorithm and Local Branching for Scalable Solutions

Optimizing Wireless Sensor Network Planning: Integrating Bia...

引用

International Conference on Information Fusion

作者： Almir Antônio Monteiro Junior Diego Brandão Felipe Da Rocha Henriques Claudio M. De Farias Pedro Henrique González System Engineering and Computer Science Program Federal University of Rio de Janeiro Rio de Janeiro Brazil Computer Science Postgraduate Program Federal Center for Technological Education of Rio de Janeiro Rio de Janeiro Brazil

ISBN: (数字)9781737749769

ISBN: (纸本)9798350371420

This study addresses the Wireless Sensor Network Planning Problem with Multiple Sources/Destinations (WSNPMSD), an optimization challenge focused on reducing the sensor count within a network topology for a specified area, considering numerous sources and destinations. We introduce a hybrid strategy for tackling WSNP-MSD, particularly effective for large-scale scenarios, combining a Biased Random-key Genetic Algorithm with a Local Branching Technique. This methodology is justified by the limitations exact methods may encounter when the number of variables increases. Through computational experiments, we demonstrate the superiority of our proposed method over conventional exact methods in managing large instances of the WSNP-MSD.

关键词： Wireless communication Wireless sensor networks Network topology Planning Optimization Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

An Island-Based Hybrid Evolutionary Algorithm for Caloric-Restricted Diets

Research Square

引用

Research Square 2021年

作者： Silva, João Gabriel R. Duarte, Grasiele R. Carvalho, Iago A. Goliatt, Leonardo Vieira, Vinicius F. Xavier, Carolina R. IFMT Brazil Computational Modeling Federal University of Juiz de Fora Brazil Civil Engineering Program COPPE Federal University of Rio de Janeiro Brazil Computer Science Program Federal University of Minas Gerais Brazil Computer Science Program Federal University of Sao Joao del Rei Brazil

The most popular and successful way to maintain a healthy body is to have a rich and balanced diet, combined with physical exercise. Since it was proposed the diet dilemma, several works in the literature suggested calculating a diet that respects an individual’s nutritional needs. In the Caloric-Restricted Diet Problem (CRDP), the goal is to find a reduced-calorie diet that meets an individual’s dietary needs aiming for weight loss. This paper proposes a Hybrid Island-Based Evolutionary Algorithm (IBHEA) that combines a Genetic Algorithm (GA) with a Differential Evolution (DE) communicating through a migration policy to solve the CRDP. Computational experiments showed that IBHEA outperforms the non-distributed and non-hybrid implementations, generating a greater variety of diets with a small calorie count. © 2021, CC BY.

关键词： Nutrition

来源：评论

学校读者我要写书评

暂无评论

Surgical Instrument Detection for Laparoscopic Surgery using Deep Learning 19

Surgical Instrument Detection for Laparoscopic Surgery using...

引用

19th International Conference on Electrical engineering/Electronics, computer, Telecommunications and Information Technology, ECTI-CON 2022

作者： Boonkong, Apiwat Hormdee, Daranee Sonsilphong, Suphachoke Khampitak, Kovit Khon Kaen University Embedded System RandD Group Computer Engineering Khon Kaen Thailand Khon Kaen University Data Science and Health Informatics Program Academic Affairs Khon Kaen Thailand Khon Kaen University Faculty of Medicine Department of Obstetrics and Gynecology Khon Kaen Thailand

ISBN: (纸本)9781665485845

Laparoscopic surgery has transformed conventional open surgery. Robot-Assisted laparoscopic surgery which is minimally invasive is effective for operations in limited space. Nevertheless, the robotic system which is utilized in such surgery can inflict impair to the surgical instruments, organs, or tissues as a consequence of the narrow field of view and space available to operate, and insufficient tactile response. In laparoscopy, the surgeon observes what he operates via digital images which are displayed on a monitor. In addition to the surgeon's expertise, the image-guided surgery system could offer him significant support if that system is capable of understanding those images. computer Vision has been able to proceed due to the emergence of Machine Learning, and especially Deep Learning. This paper applies Deep Learning for surgical instrument detection for laparoscopic surgery. The fastest model, based on results trained on the COCO 2017 Dataset on TensorFlow Framework, for each of 4 algorithms-Faster-RCNN, SSD, CenterNet and EfficientDet-from Model Zoo, along with YOLOv4 on Darknet Framework, have been investigated in this work. The evaluation metrics used are Precision, Recall and F1-score. The results reveal that each model plays its part well;however, YOLOv4 seemed to breakthrough this statement by offering grate result for all three accuracy metrics. © 2022 IEEE.

关键词： Laparoscopy

来源：评论

学校读者我要写书评

暂无评论

MULTITAPE AFA

引用

JOURNAL OF THE ACM 1972年第2期19卷 193-&页

作者： GREIBACH, S GINSBURG, S University of California at Los Angeles Los Angeles California Department of System Science Los Angeles CA University of Southern California Computer Science Program Olin Hall of Engineering Los Angeles CA

Device representations, via multitape AFA (abstract families of acceptors), are given for the families of languages which result from applying the wedge (A) m)d the substitution operations to AFL (abstract families of languages). In particular, if ~ and ~2 are multitape AFA (i.e. certain families of multistorage tape acceptors), then 5)~ A ~2 is defined as the family of multitape acceptors which results when the tapes of ~ and ~2 are coalesced, with the ~-tapes preceding those in ~2. It is shown that the smallest full AFL containing 2(~) A 2 (~D2) = {L~ N L2 ILi in2 (~Di) } is, 12 (~ h~:). For each multitape AFAr, aset ~.v of “nested” multitape acceptors is defined. It is shown that if ~ and ~2 are single-tape AFA, then the family of languages obtained from (~ A ~2) N is the family of langnages obtained by substituting the AFL defined by ~2 into the AFL defined by ~D~. © 1972, ACM. All rights reserved.

关键词： acceptors AFL theory formal languages intersection multistorage tapes substitution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：