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

1998 Asia Pacific software engineering Conference, APSEC 1998

作者： Yang, Young Joon Kim, Soon Yong Choi, Gui Ja Cho, Eun Sook Kim, Chul Jin Kim, Soo Dong Software Engineering Department ETRI Computer and Software Technology Laboratory Daejon305-333 Korea Republic of Dept. Of Computer Science Soongsil University Seoul156-743 Korea Republic of

ISBN: (纸本)0818691832

Recently, object-oriented (OO) frameworks have been known to be highly effective and practical for software reuse;as shown in San Francisco project, a large-scaled industry project for framework development. However, systematic development process and detailed instructions for building OO frameworks have not been studied enough. In addition, it has not been clearly defined how to apply OMG's Unified Modeling Language (UML) in building OO frameworks. In this paper, we propose a practical OO development process that extends UML notations and semantics. The proposed process consists of four typical software development phases;analysis, design, implementation and testing, and each phase is defined as a logical sequence of development tasks. In order to help the seamless migration from one task to subsequent tasks, we provide instructions for carrying out tasks. Since the proposed process is based on UML diagrams and the basic objectory process, we believe that OO frameworks can be more efficiently developed by utilizing the proposed process, and higher quality OO frameworks can be produced. In order to show the applicability and effectiveness of the process, we present a case study of electronic commerce application. © 1998 IEEE.

关键词： Unified Modeling Language

来源：评论

学校读者我要写书评

暂无评论

Gradient histogram Markov stationary features for image retrieval

Gradient histogram Markov stationary features for image retr...

引用

2013 IEEE Conference Anthology, ANTHOLOGY 2013

作者： Wu, Qing Li, Hongyu Niu, Junyu Wang, Yi School of Computer Science Fudan University Shanghai China School of Software Engineering Tongji University Shanghai China

ISBN: (纸本)9781479916603

This paper presents a novel framework for image retrieval. In image feature extraction stage, we propose the gradient histogram Markov stationary features to represent the input image which is capable of characterizing the spatial co-occurrence of gradient histogram patterns. In image retrieval stage, the image training and retrieval process is treated as searching for an ordered optimal cycle in the image database by minimizing the geometric manifold entropy of images. Experimental results demonstrate that the proposed framework for image retrieval is feasible and gradient histogram Markov stationary feature apparently outperforms the original HOG descriptor in feature representation. © 2013 IEEE.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

An input-output model for interactive systems

An input-output model for interactive systems

引用

1986 SIGCHI Conference on Human Factors in Computing Systems, CHI 1986

作者： Shaw, Mary Computer Science Department Software Engineering Institute Carnegie-Mellon University PittsburghPA15213 United States

ISBN: (纸本)0897911806

Interactive user interfaces depend critically on underlying computing system facilities for input and output. However, most computing systems still have input-output facilities designed for batch processing. These facilities are not adequate for interfaces that rely on graphical output, interactive input, or software constructed with modern methodologies. This paper details the deficiencies of batch-style input-output for modern interactive systems, presents a new model for input-output that overcomes these deficiencies, and suggests software organizations to take advantage of the new model. © 1986 ACM.

关键词： Batch data processing

来源：评论

学校读者我要写书评

暂无评论

Enhancing chain-of-thought reasoning in large language models through text style diversity and prompt fusion 3

Enhancing chain-of-thought reasoning in large language model...

引用

3rd International Conference on Electronic Information engineering, Big Data, and computer Technology, EIBDCT 2024

作者： Li, Weichen Pan, Weimin School of Computer Science National Pilot Software Engineering School Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781510680449

In order to reduce the impact of public health emergencies on the normal life of residents, at the same time to prevent the secondary spread of diseases caused by improper methods in the management process. On the premise of reducing the overall operation cost as much as possible, based on the basic data such as the number of quarantinable population, the number of daily necessities distribution points, and transportation network of 9 administrative areas in Changchun during the epidemic isolation and prevention period in 2022, this paper uses the entropy weight method to score each community and set the number of delivery points, so as to judge whether the actual plan is reasonable. In order to further optimize, with the minimum service cost of all the selected delivery points and the premise of meeting the distribution demand, save as much as possible, reduce the number of sites, and minimize the site radius of each sorting point as the goal, the total number of selected delivery points should not exceed the set total. A multi-objective site selection planning model was established for constraints. Sensitivity analysis was performed on the number of sites to determine the optimal number of sites, and cluster analysis was used to obtain the optimal site selection coordinates and cell numbers corresponding to the drop points. As a result, the number of sites was greatly reduced and the efficiency of material distribution was improved. Considering that the less people flow in the context of the epidemic, the better, this paper also uses the improved k-means algorithm for the actual plan, and finally gets the following number of delivery points in each district: 168 in Erdao District, 53 in Jingyue District, 239 in Nanguan District, 292 in Kuancheng District, 303 in Chaoyang District, 25 in steam open district, 69 in economic open District, and 222 in Green Park. © COPYRIGHT SPIE. Downloading of the abstract is permitted for personal use only.

关键词： Sensitivity analysis

来源：评论

学校读者我要写书评

暂无评论

A Fair VNF assignment Algorithm for network functions virtualization

A Fair VNF assignment Algorithm for network functions virtua...

引用

2020 International Symposium on Networks, computers and Communications, ISNCC 2020

作者： Singh Ghai, Karanbir Yassine, Abdulsalam Choudhury, Salimur Lakehead University Department of Computer Science Thunderbay Canada Lakehead University Department of Software Engineering Thunderbay Canada

ISBN: (纸本)9781728156286

On-demand resource management is a challenging prospect, especially in communication networks where the users' requirements of network resources are volatile. This challenge is magnified by the current shift of hardware-dependent network technologies into virtual Network Functions (vNFs) in a cloud-based platform and the proliferation of the Internet of Things (IoT) networks. vNFs are an integral part of edge devices that aims to improve service providers' response time, eliminate redundancy, and end to end latency results in operators' lower operating costs significantly. The efficiency of such a virtualized system largely depends on the optimization of resource allocation between users and Virtual Machines (VM) or hosting devices. One approach to addressed this issue is to minimize the latency of the entire communication network, however, the concern is that this mechanism does not ensure fairness of resource allocation because some of the users may receive enhanced services than others. In the previous study [1], a Stable Matching Algorithm is proposed to minimize the latency between vNFs and VMs but the algorithm failed to ensure the fairness of the requested services and server elements. In this study, we further extend the previous model to ensure the fairness. Our proposed solution minimizes the maximum latency in the network. This problem is an NP-hard and hence we provide a local search based solution. The experimental result shows improved fairness from other approaches and the fairness index is close to the optimal, which in fact represents the elimination of imbalances to a great extent. © 2020 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

DDPG Based Dynamic Scheduling Optimization Mechanism in Real Switch 15

DDPG Based Dynamic Scheduling Optimization Mechanism in Real...

引用

15th International Conference on Communication software and Networks, ICCSN 2023

作者： Wang, Xue Wang, Xingwei Jia, Jie Lu, Xijia Huang, Min School of Computer Science and Engineering Northeastern University China Software College Northeastern University China College of Information Science and Engineering Northeastern University Shenyang China

ISBN: (纸本)9798350329360

Nowadays, more and more traffic with different service requirements is transmitted simultaneously in the network, resulting in network congestion. In order to improve network Quality of Service (QoS), traffic will be classified and processed according to its requirements. The switch uses fair queuing and its extension schemes to schedule it to reduce the packet loss rate. However, statistical data such as packet arrival rate cannot be accurately obtained in the switches, and discrete reinforcement learning cannot model dynamically changing traffic, making existing dynamic bandwidth allocation solutions challenging to implement. Meanwhile, the same weight configuration will obviously cause the packet loss rate to fluctuate, so it is challenging to design an effective reward function. This paper proposes a dynamic scheduling optimization mechanism based on Deep Deterministic Policy Gradient (DDPG), called DDSO, in an actual switch to schedule flows with different service requirements. Firstly, the flow scheduling problem is modeled as a Markov Decision Process (MDP), and DDPG is used to find the optimal queue weight configuration. Queue weight adjustment is a continuous control problem, and DDPG can solve this problem very well. Secondly, we introduce two one-dimensional arrays to design a new reward function, to reduce the influence of packet loss rate fluctuation on reward determination. At last, this mechanism is evaluated through a hardware testbed in two scenarios. The results show that DDSO can effectively schedule the flows with different service requirements and alleviate network congestion. © 2023 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Statistical analysis and structure optimization of large photovoltaic module

Statistical analysis and structure optimization of large pho...

引用

5th International Conference on Future Information Technology, FutureTech 2010

作者： Thankalekshmi, Ratheesh R. Qiu, Qinru Man, K.L. Department of Electrical and Computer Engineering Binghamton University Binghamton NY United States Department of Computer Science and Software Engineering Xi'An Jiaotong-Liverpool University Suzhou China

ISBN: (纸本)9781424469505

There has been an increasing interest in powering electronic systems using solar energy. Designers are seeking for techniques to manufacture solar panels using low cost material in a massive scale. This will likely lead to wide process variation and hence unreliable performance. This paper considers the impact of the process variations on the output power of large Photovoltaic (PV) module by modeling each PV cell as a current source whose short circuit current is a normal random variable. The probability distribution of the overall output power of an NxM PV module is analytically derived. The proposed statistical analysis technique will enable the designer to predict the maximum output power of abstract PV module for a given confidence level. This analysis also reveals that, when the size and the manufacturing technology are given, the efficiency of a PV module is determined by its topology. The proposed power prediction model can be applied to find the optimal structure of the PV module that maximizes the energy harvesting rate at the given confidence level. © 2010 IEEE.

关键词： Statistical methods

来源：评论

学校读者我要写书评

暂无评论

Performing engineering research at non-PH.D. granting institutions

Performing engineering research at non-PH.D. granting instit...

引用

114th Annual ASEE Conference and Exposition, 2007

作者： Larson, Eric Miguel, Agnieszka Seattle University United States Department of Computer Science and Software Engineering Seattle University United States Electrical and Computer Engineering Department Seattle University United States

Research is becoming increasingly important at liberal arts colleges and masters universities. However, performing research at a non-Ph.D. granting institution has unique challenges when compared to a larger research oriented university. Faculty are expected to publish research articles with high teaching loads, limited lab space and equipment, and no graduate student assistants. This paper provides advice for new tenure-track faculty on how to effectively perform research at smaller institutions. In compiling the list of tips presented in this paper, we have not only relied on our experience as new faculty members but also received advice from more experienced faculty that represent several different disciplines of engineering. The paper presents tips in several key areas: choosing the right research project, managing time effectively, supervising undergraduate research, finding collaborators, obtaining resources, and publishing results. One key tip that is pervasive throughout this paper is understanding the tenure requirements in your department at your institution. © American Society for engineering Education, 2007.

关键词： engineering research

来源：评论

学校读者我要写书评

暂无评论

End-to-End Multi-View Structure-from-Motion with Hypercorrelation Volume 3

End-to-End Multi-View Structure-from-Motion with Hypercorrel...

引用

3rd IEEE International Conference on Power, Electronics and computer Applications, ICPECA 2023

作者： Chen, Qiao Poullis, Charalambos Concordia University Immersive and Creative Technologies Lab Department of Computer Science and Software Engineering MontrealQC Canada

ISBN: (纸本)9781665472784

Image-based 3D reconstruction is one of the most important tasks in computer Vision with many solutions proposed over the last few decades. The objective is to extract metric information i.e. the geometry of scene objects directly from images. These can then be used in a wide range of applications such as film, games, virtual reality, etc. Recently, deep learning techniques have been proposed to tackle this problem. They rely on training on vast amounts of data to learn to associate features between images through deep convolutional neural networks and have been shown to outperform traditional procedural techniques. In this paper, we improve on the state-of-the-art two-view structure-from-motion(SfM) approach of [11] by incorporating 4D correlation volume for more accurate feature matching and reconstruction. Furthermore, we extend it to the general multi- view case and evaluate it on the complex benchmark dataset DTU [5]. Quantitative evaluations and comparisons with state-of-the-art multi-view 3D reconstruction methods demonstrate its superiority in terms of the accuracy of reconstructions. © 2023 IEEE.

关键词： computer vision

来源：评论

学校读者我要写书评

暂无评论

An efficient and fast polarity optimization approach for mixed polarity Reed-Muller logic circuits

引用

Frontiers of computer science 2017年第4期11卷 728-742页

作者： Zhenxue HE Limin XIAO Fei GU Tongsheng XIA Shubin SU Zhisheng HUO Rong ZHANG Longbing ZHANG Li RUAN Xiang WANG State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China School of Computer Science and Engineering Beihang University Beijing 100191 China School of Electronic and Information Engineering Beihang University Beijing 100191 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China National Engineering Research Center for Science & Technology Resources Sharing Service Beijing 100191 China

Although the genetic algorithm has been widely used in the polarity optimization of mixed polarity Reed- Muller （MPRM） logic circuits, few studies have taken into account the polarity conversion sequence. In order to im- prove the efficiency of polarity optimization of MPRM logic circuits, we propose an efficient and fast polarity optimiza- tion approach （FPOA） considering the polarity conversion se- quence. The main idea behind the FPOA is that, firstly, the best polarity conversion sequence of the polarity set wait- ing for evaluation is obtained by using the proposed hybrid genetic algorithm （HGA）; secondly, each of polarity in the polarity set is converted according to the best polarity con- version sequence obtained by HGA. Our proposed FPOA is implemented in C and a comparative analysis has been pre- sented for MCNC benchmark circuits. The experimental re- suits show that for the circuits with more variables, the FPOA is highly effective in improving the efficiency of polarity op- timization of MPRM logic circuits compared with the tradi- tional polarity optimization approach which neglects the po- larity conversion sequence and the improved polarity opti- mization approach with heuristic technique.

关键词： genetic algorithm polarity optimization mixed

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：