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

Symposium on Virtual Reality (SVR)

作者： Almir D.V. Santiago Paulo N.M. Sampaio Luis R.S. Fernandes Graduate Program in Computing and Systems Salvador University (UNIFACS) Salvador BA Brazil Exacts Sciences and Engineering Competence Centre University of Madeira (UMa) Funchal Portugal

Storytelling is a way to represent events using words, images and sounds, often by improvisation. Stories or narratives have been shared in all cultures as a way to entertain, educate, for cultural preservation and as a way to transmit moral values. Crucial elements of stories and storytelling are the plot, the characters and the narrative point of view. Currently there are several languages and tools that allow the creation of virtual worlds, and however, few tools for creating 3D storytelling. Existing approaches are not intuitive and require a deeper knowledge of the user to enable the creation of virtual worlds with higher quality graphics, enabling the integration of customized multimedia presentations. This paper presents a solution for interactive storytelling, targeted to children and juvenile public, called Mogre-Storytelling. This tool claims to be intuitive, providing different functionalities for the creation and customization of scenarios in 3D, allowing the addition of 3D models from the Internet and even enabling the creation of virtual story using multimedia and storytelling elements such as speech bubbles, sounds and images. Mogre- Storytelling is a new option for users who want to create stories with scenarios in 3D and is an alternative to Ogre application developers, since this tool enables the rapid creation of customized scenarios with higher quality 3D graphics, while still allowing the integration of multimedia presentations using an XML file structure.

关键词： Three-dimensional displays Educational institutions Electronic mail Augmented reality Barium Abstracts

来源：评论

学校读者我要写书评

暂无评论

Experimental Evaluation of a Checklist-Based Inspection Technique to Verify the Compliance of Software systems with the Brazilian General Data Protection Law

arXiv

引用

arXiv 2023年

作者： Cerqueira, Diego André de Mello, Rafael Maiani Travassos, Guilherme Horta Systems Engineering and Computer Science Graduate Program Federal University of Rio de Janeiro Brazil Computing Institute Federal University of Rio de Janeiro Brazil

Background/Context: Recent laws to ensure the security and protection of personal data establish new software requirements. Consequently, new technologies are needed to guarantee software quality under the perception of privacy and protection of personal data. Therefore, we created a checklist-based inspection technique (LGPDCheck) to support the identification of defects in software artifacts based on the principles established by the Brazilian General Data Protection Law (LGPD). Objective/Aim: To evaluate the effectiveness and efficiency of LGPDCheck for verifying privacy and data protection (PDP) in software artifacts compared to ad-hoc techniques. Method: To assess LGPDCheck and ad-hoc techniques experimentally through a quasi-experiment (two factors, five treatments). The data will be collected from IoT-based health software systems built by software engineering students from the Federal University of Rio de Janeiro. The data analyses will compare results from ad-hoc and LGPDCheck inspections, the participant's effectiveness and efficiency in each trial, defects' variance and standard deviation, and time spent with the reviews. The data will be screened for outliers, and normality and homoscedasticity will be verified using the Shapiro-Wilk and Levene tests. Nonparametric or parametric tests, such as the Wilcoxon or Student's t-tests, will be applied as appropriate. © 2023, CC BY-NC-ND.

关键词： Data privacy

来源：评论

学校读者我要写书评

暂无评论

Self-adaptive Evolutionary Algorithm for DNA Codeword Design

Self-adaptive Evolutionary Algorithm for DNA Codeword Design

引用

Congress on Evolutionary Computation

作者： Jeisson Prieto Elizabeth León Max H. Garzon Computing Systems and Industrial Engineering Department Universidad Nacional de Colombia Bogotá Colombia Department of Computer Science and the Bioinformatics Program University of Memphis Memphis USA

DNA has emerged as a new computational resource for data encoding and processing. The fundamental problem of DNA Codeword Design (CWD) calls for finding effective ways to encode and process data in DNA. The problem has shown to be of interest in other areas as well, including computational memories, self-assembly and phylogenetic analysis, among others. In prior work, a framework to analyze this problem has been developed and simple versions of CWD have been shown to be NP-complete using any single reasonable metric that approximates the Gibbs energy, thus practically making it very difficult to find a general procedure for finding optimal efficient encodings. We present a Self-adaptive Evolutionary Algorithm for CWD (SaEA-CWD) as an extension of the Hybrid Adaptive Evolutionary algorithm (HAEA). SaEA-CWD is a parameter adaptation technique that automatically adapts the rates of its genetic operator applications to exploit structural properties of the search space to improve the speed and quality of the solutions. An implementation and preliminary results are evaluated in spaces where searches are already prohibitive to ordinary methods (such as 8- and 10-mers) due to the combinatorial explosion of the solution DNA space. Applications to other problems are suggested, such as a general technique for dimensionality reduction based on SaEA-CWD.

关键词： DNA Evolutionary computation Encoding Extraterrestrial measurements Self-assembly

来源：评论

学校读者我要写书评

暂无评论

Face recognition using Support Vector Machine and multiscale directional image representation methods: A comparative study

Face recognition using Support Vector Machine and multiscale...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Daniel M. M. da Costa Sarajane M. Peres Clodoaldo A. M. Lima Pollyana Mustaro Information Systems Program University of São Paulo São Paulo SP Brazil Graduate Program in Electrical Engineering and Computing Mackenzie Presbyterian University São Paulo SP Brazil

ISBN: (纸本)9781479919611

In recent years, human identification based on face recognition has attracted the attention of the scientific community and the general public due to its wide range of applications. A face recognition system involves three important phases: face detection, feature extraction and classification (identification and/or verification). The robustness of face recognition could be improved by treating the variations in these stages. One of the main issues in design of face recognition system is how to extract discriminative facial features. A precise extraction of a representative feature set will improve the performance of a face recognition system. Various techniques have been used to represent images efficiently, of which the most well-known and widely applied are Wavelet, Contourlet, Shearlet and Curvelet Transform. Their ability to capture localized time-frequency information of image motivates their use for feature extraction. In this paper, we conduct a systematic empirical study on these transforms as feature extractors from face images. To further reduce the feature dimensionality, we adopt Principal Component Analysis and Linear Discriminant Analysis to select the most discriminative feature sets. The performance levels delivered by each transform are contrasted in terms of the accuracy measure computed over the outputs generated by the Support Vector Machine classifier (SVM). Experimental results conducted on a publicly available database are reported whereby we observe that the Curvelet Transform followed by the Wavelet Transform significantly outperform the others according to accuracy measure calculated over the SVM classifier.

关键词： Face recognition Support vector machines Wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

Dynamic programming Algorithm using Furniture Industry 0/1 Knapsack Problem 5

Dynamic Programming Algorithm using Furniture Industry 0/1 K...

引用

5th International Conference on Cybernetics and Intelligent systems, ICORIS 2023

作者： Anditta, Mietha Amartya, Natashya Warnars, Laurens Spits Warnars, Harco Leslie Hendric Spits Ramadhan, Arief Siswanto, Teddy Mantoro, Teddy Noordin, Nurulhuda Bina Nusantara University School of Computer Science Computer Science Departement Jakarta11530 Indonesia Bina Nusantara University School of Information Systems Information Systems Departement Jakarta11530 Indonesia Bina Nusantara University Binus Graduate Program - Computer Science Computer Science Departement Jakarta11530 Indonesia Telkom University Pjj Informatika Bandung40257 Indonesia Trisakti University Information Systems Department Jakarta11440 Indonesia Sampoerna University Faculty of Engineering and Technology Jakarta12760 Indonesia Universiti Teknologi Mara School of Computing Sciences College of Computing Informatics and Mathematics Selangor Malaysia

ISBN: (纸本)9798350369489

Dynamic programming is a fundamental algorithm that can be found in our daily lives easily. One of the dynamic programming algorithm implementations consists of solving the 0/1 knapsack problem. A 0/1 knapsack problem can be seen from industrial production cost. It is prevalent that a production cost has to be as efficient as possible, but the expectation is to get the proceeds of the products higher. Thus, the dynamic programming algorithm can be implemented to solve the diverse knapsack problem, one of which is the 0/1 knapsack problem, which would be the main focus of this paper. The implementation was implemented using C language. This paper was created as an early implementation algorithm using a Dynamic program algorithm applied to an Automatic Identification System (AIS) dataset. © 2023 IEEE.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Memory-aware SLA-based mechanism for shared-mesh WDM networks

Memory-aware SLA-based mechanism for shared-mesh WDM network...

引用

International Conference on Ultra Modern Telecommunications and Workshops (ICUMT)

作者： Alireza Nafarieh Shyamala C. Sivakumar William Phillips William Robertson Internetworking Engineering Program Dalhousie University Halifax NS Canada Computing and Information Systems Sobey School of Business Saint Marys University Halifax NS Canada

The paper presents a dynamic provisioning mechanism through which service providers can exploit the unused allowable down time of the connections to serve the additional upcoming requests. The algorithm work based on the holding time of the connections and the failure arrival rate over the selected primary or backup paths. The proposed mechanism in this paper routes the requests in a way that any service level agreement (SLA) violation is either avoided or minimized. To achieve this goal, the already established paths are flagged with a newly proposed path metric, path risk factor, to create a memory-aware mechanism of paths' history showing the risk tolerance to SLA violation. This path attribute can be disseminated over the network as a metric of prospective connections. The algorithm takes advantage of the already established connections' history to select the best path regarding the SLA violation with the lowest cost. Simulation results verify that the proposed mechanism has better performance in terms of the blocking rate, the availability satisfaction rate, and the resource utilization than existing algorithms. Performance evaluation is done over two different simulation environments, the network with high link failure arrival rate and the network with normal link failure arrival rate. In addition to the better performance over both network topologies, the algorithm provides more revenue for service providers compared to standard and existing algorithms.

关键词： Availability Cost function Heuristic algorithms Electronic countermeasures Routing History Measurement

来源：评论

学校读者我要写书评

暂无评论

Leveraging S-STEM Scholarship programs

Leveraging S-STEM Scholarship programs

引用

119th ASEE Annual Conference and Exposition

作者： Anderson-Rowland, Mary R. Rodriguez, Armando A. Hall Jr., Richard A. McBride, Phil Blake Pangasa, Rakesh Saber, John M. Vangilder, Clark Grierson, Anita Department of Computing Informatics and Systems Design Engineering Arizona State University United States ASU Faculty Arizona State University United States Math Science and Health Science METSTEP Program Cochise Community College United States Eastern Arizona College United States METSTEP Program Arizona Western College United States METSTEP Program Exxon Research and Development Labs Mohave Community College Baton Rouge United States METSTEP Program Central Arizona College United States Arizona State University United States

ISBN: (纸本)9780878232413

In response to our nation's cry for more engineers, this paper describes how a major university has leveraged four NSF program grants to produce a highly successful program focused on retention, graduation, and graduate degrees. One of the programs is for lower division students, one is for upper division transfer students, one is for non-transfer upper division students and graduate students that have come up through the system, and one is for upper division students who come from five selected non-metropolitan community colleges in Arizona. The last program ties everything all together with a Transfer Student Center, a place for the S-STEM Academic Scholarship Success Class to meet, a place to host potential transfer students, and a place for transfer students to study and network. An emphasis of all of these programs is the encouragement and support of female and underrepresented minority students and students with unmet financial need. These programs have attained a 90-95% retention rate. For upper division transfer students not in the program, the graduation rate is about 70% for males and 64% for females. The transfer GPA shock was shown to be negligent for new program transfer students, compared with a half grade point drop for new upper division transfer students not in the program. Most importantly, during the past three years over 50% of the graduated scholarship students have gone right on to graduate school full-time. Seventy percent of the transfer students who did not intend to go to graduate school when they matriculated to Arizona State University, but who have now chosen to go on to graduate school, have reported that this program was a major influence in this decision change. Several of the students are now in PhD programs preparing to become professors. Even though parts of this program have been in existence for nearly 10 years, this is a continual work in progress as we strive for more excellence. This paper highlights the successes of being abl

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Provenance traces of the swift parallel scripting system 13

Provenance traces of the swift parallel scripting system

引用

Joint EDBT/ICDT 2013 Workshops

作者： Gadelha Jr., Luiz M. R. Wilde, Michael Mattoso, Marta Foster, Ian 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 Computer and Systems Engineering Program Federal University of Rio de Janeiro Brazil Department of Computer Science University of Chicago United States

ISBN: (纸本)9781450315999

In this abstract, we describe provenance traces generated from executions of scientific workflows managed by the Swift parallel scripting system. They follow a provenance data model, used by MTCProv, the provenance management component of Swift. It is similar to PROV, representing most of its core concepts and including additional information about the scientific domain, computational resource consumption, and prospective provenance. We describe provenance queries that follow patterns commonly found in high performance computing and that are straightforward to support with MTCProv's built-in procedures. These queries often involve costly relational join operations and recursion, providing a relevant case for benchmarking. © 2013 Authors.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Specialized reporting of article review – SRAR Method

Specialized reporting of article review – SRAR Method

引用

IEEE World engineering Education Conference (EDUNINE)

作者： Julio Ernesto Quispe Rojas Julio Enrique Quispe Tuesta Computing and Electronics Departament Universidad Nacional Pedro Ruiz Gallo Lambayeque Perú Systems Engineering Program Universidad Nacional Tecnologica de Lima Sur Lima Perú

ISBN: (数字)9781728166384

ISBN: (纸本)9781728166391

The professional training of the engineering student must be innovated in order to meet the accreditation criterion and with the requirement of the university law that requires presenting an investigation to obtain the bachelor's degree and another to obtain the professional degree of engineer. In order to develop in students, the skills to search for scientific and technological articles, and the critical skills to evaluate documents and extract the main ideas from them in relation to a particular topic, the SRAR method or specialized report review method has been proposed. It has been applied during five academic semesters in the electronic engineering telephone systems course, with satisfactory results. The SRAR method has six stages:*** of the SRAR method and proposed topic, 2. Initial bibliographic search, 3. Autonomous training, 4. Selection of articles for review, 5. Study and evaluation of articles 6. Writing of specialized report for review of articles.

关键词： Training Telephone sets Accreditation Writing Search problems ISDN engineering students

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：