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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

712 篇 会议
48 篇 期刊文献
1 册 图书

馆藏范围

761 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

520 篇 工学
- 486 篇 计算机科学与技术...
- 367 篇 软件工程
- 175 篇 信息与通信工程
- 87 篇 控制科学与工程
- 67 篇 电气工程
- 40 篇 网络空间安全
- 22 篇 电子科学与技术（可...
- 20 篇 动力工程及工程热...
- 15 篇 机械工程
- 14 篇 仪器科学与技术
- 8 篇 生物工程
- 5 篇 农业工程
- 4 篇 力学（可授工学、理...
- 4 篇 光学工程
- 4 篇 化学工程与技术
- 4 篇 环境科学与工程（可...
- 3 篇 建筑学
- 3 篇 交通运输工程
249 篇 理学
- 230 篇 数学
- 111 篇 统计学（可授理学、...
- 19 篇 系统科学
- 13 篇 物理学
- 9 篇 生物学
- 6 篇 化学
118 篇 管理学
- 104 篇 管理科学与工程(可...
- 78 篇 工商管理
- 20 篇 图书情报与档案管...
18 篇 法学
- 17 篇 社会学
16 篇 经济学
- 16 篇 应用经济学
6 篇 农学
- 5 篇 作物学
4 篇 教育学
3 篇 医学
1 篇 军事学

主题

37 篇 computer network...
28 篇 measurement
25 篇 computer systems...
21 篇 computer simulat...
19 篇 computer archite...
19 篇 power system mod...
15 篇 telecommunicatio...
15 篇 client server co...
14 篇 computational mo...
14 篇 response time (c...
14 篇 computer systems
14 篇 distributed comp...
13 篇 computer operati...
11 篇 internet
11 篇 scheduling
10 篇 computer science
10 篇 computer systems...
10 篇 network protocol...
10 篇 data communicati...
10 篇 power measuremen...

机构

8 篇 department of co...
4 篇 carnegie mellon ...
4 篇 dept. of comp. s...
4 篇 computer science...
4 篇 department of co...
4 篇 department of co...
3 篇 school of comput...
3 篇 dept. of compute...
3 篇 computer science...
3 篇 department of co...
3 篇 computer systems...
3 篇 department of el...
3 篇 department of co...
3 篇 ibm thomas j. wa...
3 篇 department of co...
3 篇 dept. of compute...
3 篇 computer science...
3 篇 dept. of comp. s...
3 篇 dept. of compute...
3 篇 department of co...

作者

14 篇 towsley don
8 篇 liu alex x.
7 篇 wang jia
6 篇 harchol-balter m...
5 篇 crovella mark
5 篇 shenoy prashant
5 篇 van houdt benny
5 篇 li zongpeng
5 篇 vernon mary k.
5 篇 lui john c. s.
5 篇 rexford jennifer
5 篇 scully ziv
4 篇 don towsley
4 篇 ji lusheng
4 篇 martonosi margar...
4 篇 zhang zhi-li
4 篇 wu chuan
4 篇 golubchik leana
4 篇 xu jun
4 篇 lui john c.s.

语言

743 篇 英文
17 篇 其他
1 篇 中文

检索条件"任意字段=SIGMETRICS 2005: International Conference on Measurement and Modeling of Computer Systems"

共 761 条记录，以下是751-760 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

measurement and quality in object-oriented design

Measurement and quality in object-oriented design

引用

international conference on Software Maintenance (ICSM)

作者： R. Marinescu Loose Research Group Politechnica University of Timişoara Timisoara Romania

In order to support the maintenance of object-oriented software systems, the quality of their design must be evaluated using adequate quantification means. In spite of the current extensive use of metrics, if used in isolation, metrics are oftentimes too fine grained to quantify comprehensively an investigated aspect of the design. To help the software engineer detect and localize design problems, the novel detection strategy mechanism is defined so that deviations from good-design principles and heuristics are quantised inform of metrics-based rules. Using detection strategies an engineer can directly localize classes or methods affected by a particular design flaw (e.g. God Class), rather than having to infer the real design problem from a large set of abnormal metric values. In order to reach the ultimate goal of bridging the gap between qualitative and quantitative statements about design, the dissertation proposes a novel type of quality model, called factor-strategy. In contrast to traditional quality models that express the goodness of design in terms of a set of metrics, this novel model relates explicitly the quality of a design to its conformance with a set of essential principles, rules and heuristics, which are quantified using detection strategies.

关键词： Software maintenance Object oriented modeling Software design Software measurement Design engineering Software systems Humans Process design Software quality computer industry

来源：评论

学校读者我要写书评

暂无评论

Accelerating GPGPU architecture simulation 13

Accelerating GPGPU architecture simulation

引用

Proceedings of the ACM sigmetrics/international conference on measurement and modeling of computer systems

作者： Zhibin Yu Lieven Eeckhout Nilanjan Goswami Tao Li Lizy John Hai Jin Chengzhong Xu Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China ELIS Department Ghent University Ghent Belgium Intelligent Design of Efficient Architectures Lab University of Florida Gainesville USA Department of Electrical and Computer Engineering University of Texas at Austin Austin USA Service Computing Technologies and System Lab/Cluster and Grid Computing Lab HUST Wuhan China Department of Electrical and Computer Engineering Wayne State University Detroit USA

ISBN: (纸本)9781450319003

Recently, graphics processing units (GPUs) have opened up new opportunities for speeding up general-purpose parallel applications due to their massive computational power and up to hundreds of thousands of threads enabled by programming models such as CUDA. However, due to the serial nature of existing micro-architecture simulators, these massively parallel architectures and workloads need to be simulated sequentially. As a result, simulating GPGPU architectures with typical benchmarks and input data sets is extremely time-consuming. This paper addresses the GPGPU architecture simulation challenge by generating miniature, yet representative GPGPU kernels. We first summarize the static characteristics of an existing GPGPU kernel in a profile, and analyze its dynamic behavior using the novel concept of the divergence flow statistics graph (DFSG). We subsequently use a GPGPU kernel synthesizing framework to generate a miniature proxy of the original kernel, which can reduce simulation time significantly. The key idea is to reduce the number of simulated instructions by decreasing per-thread iteration counts of loops. Our experimental results show that our approach can accelerate GPGPU architecture simulation by a factor of 88X on average and up to 589X with an average IPC relative error of 5.6%.

关键词： micro-architecture simulation performance general purpose graphics processing unit (GPGPU)

来源：评论

学校读者我要写书评

暂无评论

Improving TCP throughput over two-way asymmetric links: analysis and solutions 98

Improving TCP throughput over two-way asymmetric links: anal...

引用

Proceedings of the 1998 ACM sigmetrics joint international conference on measurement and modeling of computer systems

作者： Lampros Kalampoukas Anujan Varma K. K. Ramakrishnan Bell Laboratories Lucent Technologies 101 Crawfords Corner Rd. Holmdel NJ Computer Engineering Department University of California Santa Cruz CA AT&T Labs - Research Florham Park NJ

ISBN: (纸本)9780897919821

The sharing of a common buffer by TCP data segments and acknowledgments in a network or internet has been known to produce the effect of ack compression, often causing dramatic reductions in throughput. We study several schemes for improving the performance of two-way TCP traffic over asymmetric links where the bandwidths in the two directions may differ substantially, possibly by many orders of magnitude. These approaches reduce the effect of ack compression by carefully controlling the flow of data packets and acknowledgments. We first examine a scheme where acknowledgments are transmitted at a higher priority than data. By analysis and simulation, we show that prioritizing acks can lead to starvation of the low-bandwidth connection. Next, we introduce and analyze a connection-level backpressure mechanism designed to limit the maximum amount of data buffered in the outgoing IP queue of the source of the low-bandwidth connection. We show that this approach, while minimizing the queueing delay for acks, results in unfair bandwidth allocation on the slow link. Finally, our preferred solution separates the acks from data packets in the outgoing queue, and makes use of a connection-level bandwidth allocation mechanism to control their bandwidth shares. We show that this scheme overcomes the limitations of the previous approaches, provides isolation, and enables precise control of the connection throughputs. We present analytical models of the dynamic behavior of each of these approaches, derive closed-form expressions for the expected connection efficiencies in each case, and validate them with simulation results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Online energy generation scheduling for microgrids with intermittent energy sources and co-generation 13

Online energy generation scheduling for microgrids with inte...

引用

Proceedings of the ACM sigmetrics/international conference on measurement and modeling of computer systems

作者： Lian Lu Jinlong Tu Chi-Kin Chau Minghua Chen Xiaojun Lin Information Engineering Dept. The Chinese Univ. of Hong Kong Hong Kong Hong Kong Masdar Institute of Science and Technology Masdar City Uae School of Electrical and Computer Engineering Purdue Univ. West Lafayette USA

ISBN: (纸本)9781450319003

Microgrids represent an emerging paradigm of future electric power systems that can utilize both distributed and centralized generations. Two recent trends in microgrids are the integration of local renewable energy sources (such as wind farms) and the use of co-generation (i.e., to supply both electricity and heat). However, these trends also bring unprecedented challenges to the design of intelligent control strategies for microgrids. Traditional generation scheduling paradigms rely on perfect prediction of future electricity supply and demand. They are no longer applicable to microgrids with unpredictable renewable energy supply and with co-generation (that needs to consider both electricity and heat demand). In this paper, we study online algorithms for the microgrid generation scheduling problem with intermittent renewable energy sources and co-generation, with the goal of maximizing the cost-savings with local generation. Based on the insights from the structure of the offline optimal solution, we propose a class of competitive online algorithms, called CHASE (Competitive Heuristic Algorithm for Scheduling Energy-generation), that track the offline optimal in an online fashion. Under typical settings, we show that CHASE achieves the best competitive ratio among all deterministic online algorithms, and the ratio is no larger than a small constant 3. We also extend our algorithms to intelligently leverage on limited prediction of the future, such as near-term demand or wind forecast. By extensive empirical evaluations using real-world traces, we show that our proposed algorithms can achieve near offline-optimal performance. In a representative scenario, CHASE leads to around 20% cost reduction with no future look-ahead, and the cost reduction increases with the future look-ahead window.

关键词： online algorithm energy generation scheduling combined heat and power generation microgrids

来源：评论

学校读者我要写书评

暂无评论

Model-based receptor quantization analysis for PET parametric imaging

Model-based receptor quantization analysis for PET parametri...

引用

Annual international conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： Z.J. Wang Peng Qiu K.J. Ray Liu Z. Szabo Department of Electrical and Computer Engineering and Institute for Systems Research University of Maryland College Park USA Department of Electrical and Computer Engineering University of British Columbia Canada Department of Radiology Johns Hopkins University and Medical Institutions MD USA

Dynamic PET (positron emission tomography) imaging technique allows image-wide quantification of physiologic and biochemical parameters. Compartment modeling is the most popular approach for receptor binding studies. However, current compartment-model based methods often either require the accurate arterial blood measurements as the input function or assume the existence of a reference region. To obviate the need for the input function or a reference region, in this paper, we propose to estimate the input function and the kinetic parameters simultaneously. The initial estimate of the input functions is obtained by the analysis of space intersections. Then both the input function and the receptor parameters, thus the underlying distribution volume (DV) parametric image, are estimated iteratively. The performance of the proposed scheme is examined by both simulations and real brain PET data in obtaining the underlying parametric images.

关键词： Quantization Image analysis Positron emission tomography Kinetic theory Blood Biomedical imaging Parameter estimation Educational institutions Radiology Current measurement

来源：评论

学校读者我要写书评

暂无评论

Characterizing the memory behavior of Java workloads: a structured view and opportunities for optimizations 01

Characterizing the memory behavior of Java workloads: a stru...

引用

Proceedings of the 2001 ACM sigmetrics international conference on measurement and modeling of computer systems

作者： Yefim Shuf Mauricio J. Serrano Manish Gupta Jaswinder Pal Singh Computer Science Department Princeton University Princeton NJ and IBM T. J. Watson Research Center P. O. Box 218 Yorktown Heights NY Intel Microprocessor Research Labs 2200 Mission College Blvd. Santa Clara CA and IBM T.J. Watson Research Center IBM T. J. Watson Research Center P. O. Box 218 Yorktown Heights NY Computer Science Department Princeton University Princeton NJ

ISBN: (纸本)9781581133349

This paper studies the memory behavior of important Java workloads used in benchmarking Java Virtual Machines (JVMs), based on instrumentation of both application and library code in a state-of-the-art JVM, and provides structured information about these workloads to help guide systems' design. We begin by characterizing the inherent memory behavior of the benchmarks, such as information on the breakup of heap accesses among different categories and on the hotness of references to fields and methods. We then provide detailed information about misses in the data TLB and caches, including the distribution of misses over different kinds of accesses and over different methods. In the process, we make interesting discoveries about TLB behavior and limitations of data prefetching schemes discussed in the literature in dealing with pointer-intensive Java codes. Throughout this paper, we develop a set of recommendations to computer architects and compiler writers on how to optimize computer systems and system software to run Java programs more efficiently. This paper also makes the first attempt to compare the characteristics of SPECjvm98 to those of a server-oriented benchmark, pBOB, and explain why the current set of SPECjvm98 benchmarks may not be adequate for a comprehensive and objective evaluation of JVMs and just-in-time (JIT) *** discover that the fraction of accesses to array elements is quite significant, demonstrate that the number of "hot spots" in the benchmarks is small, and show that field reordering cannot yield significant performance gains. We also show that even a fairly large L2 data cache is not effective for many Java benchmarks. We observe that instructions used to prefetch data into the L2 data cache are often squashed because of high TLB miss rates and because the TLB does not usually have the translation information needed to prefetch the data into the L2 data cache. We also find that co-allocation of frequently used method tables can redu

关键词：

来源：评论

学校读者我要写书评

暂无评论

Queue management for explicit rate based congestion control 97

Queue management for explicit rate based congestion control

引用

Proceedings of the 1997 ACM sigmetrics international conference on measurement and modeling of computer systems

作者： Qingming Ma K. K. Ramakrishnan Computer Science Department Carnegie Mellon University Pittsburgh PA AT&T Labs. Research 600 Mountain Avenue Murray Hill NJ

ISBN: (纸本)9780897919098

Rate based congestion control has been considered desirable, both to deal with the high bandwidth-delay products of today's high speed networks, and to match the needs of emerging multimedia applications. Explicit rate control achieves low loss because sources transmit smoothly at a rate adjusted through feedback to be within the capacity of the resources in the network. However, large feedback delays, presence of higher priority traffic, and varying transient situations make it difficult to ensure feasibility (i.e., keep the aggregate arrival rate below the bottleneck resource's capacity) while also maintaining high resource utilization. These conditions along with the "fast start" desired by data applications often result in substantial queue *** describe a scheme that manages the queue buildup at a switch even under the most aggressive patterns of sources, in the context of the Explicit Rate option for the Available Bit Rate (ABR) congestion control scheme. A switch observes the buildup of its queue, and uses it to reduce the portion of the link capacity allocated to sources bottlenecked at that link. We use the concept of a "virtual" queue, which tracks the amount of queue that has been "reduced", but has not yet taken effect at the switch. We take advantage of the natural timing of "resource management" (RM) cells transmitted by sources. The scheme is elegant in that it is simple, and we show that it reduces the queue buildup, in some cases, by more than two orders of magnitude and the queue size remains around a desired target. It maintains max-min fairness even when the queue is being drained. The scheme is scalable, and is as responsive as can be expected: within the constraints of the feedback delay. Finally, no changes are needed to the ATM Forum defined source/destination policies.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Group-guaranteed channel capacity in multimedia storage servers 97

Group-guaranteed channel capacity in multimedia storage serv...

引用

Proceedings of the 1997 ACM sigmetrics international conference on measurement and modeling of computer systems

作者： Athanassios K. Tsiolis Mary K. Vernon Computer Sciences Department University of Wisconsin-Madison 1210 West Dayton Street Madison WI

ISBN: (纸本)9780897919098

One of the open questions in the design of multimedia storage servers is in what order to serve incoming requests. Given the capability provided by the disk layout and scheduling algorithms to serve multiple streams simultaneously, improved request scheduling algorithms can reduce customer waiting times. This results in better service and/or lower customer loss. In this paper we define a new class of request scheduling algorithms, called Group-Guaranteed Server Capacity (GGSC), that preassign server channel capacity to groups of objects. We also define a particular formal method for computing the assigned capacities to achieve a given performance objective. We observe that the FCFS policy can provide the precise time of service to incoming customer requests. Under this assumption, we compare the performance of one of the new GGSC algorithms, GGSCW-FCFS, against FCFS and against two other recently proposed scheduling algorithms: Maximum Factored Queue length (MFQ), and the FCFS-n algorithm that preassigns capacity only to each of the n most popular objects. The algorithms are compared for both competitive market and captured audience *** findings of the algorithm comparisons are that: (1) FCFS-n has no advantage over FCFS if FCFS gives time of service guarantees to arriving customers, (2) FCFS and GGSCW-FCFS are superior to MFQ for both competitive and captive audience environments, (3) for competitive servers that are configured for customer loss less than 10%, FCFS is superior to all other algorithms examined in this paper, and (4) for captive audience environments that have objects with variable playback length, GGSCW-FCFS is the most promising of the policies considered in this paper. The conclusions for FCFS-n and MFQ differ from previous work because we focus on competitive environments with customer loss under 10%, we assume FCFS can provide time of service guarantees to all arriving customers, and we consider the distribution of customer waiting

关键词：

来源：评论

学校读者我要写书评

暂无评论

modeling neural population spiking activity with Gibbs distributions 05

Modeling neural population spiking activity with Gibbs distr...

引用

Proceedings of the 19th international conference on Neural Information Processing systems

作者： Frank Wood Stefan Roth Michael J. Black Department of Computer Science Brown University Providence RI

Probabilistic modeling of correlated neural population firing activity is central to understanding the neural code and building practical decoding algorithms. No parametric models currently exist for modeling multi-variate correlated neural data and the high dimensional nature of the data makes fully non-parametric methods impractical. To address these problems we propose an energy-based model in which the joint probability of neural activity is represented using learned functions of the 1D marginal histograms of the data. The parameters of the model are learned using contrastive divergence and an optimization procedure for finding appropriate marginal directions. We evaluate the method using real data recorded from a population of motor cortical neurons. In particular, we model the joint probability of population spiking times and 2D hand position and show that the likelihood of test data under our model is significantly higher than under other models. These results suggest that our model captures correlations in the firing activity. Our rich probabilistic model of neural population activity is a step towards both measurement of the importance of correlations in neural coding and improved decoding of population activity.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Flow Rate Estimation Method for Rotary Blood Pump with Chronic Animal Experiment

Evaluation of Flow Rate Estimation Method for Rotary Blood P...

引用

Annual international conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： D. Ogawa M. Yoshizawa A. Tanaka K. Abe P. Olegario T. Motomura H. Okubo T. Oda T. Okahisa Y. Nose Graduate School of Engineering University of Tohoku Sendai Japan Faculty of Symbiotic Systems Science Fukushima University Fukushima Japan Department of Computer Science College of Engineering Nihon University Fukushima Japan Baylor University College of Medicine Houston TX USA

Rotary blood pumps are expected to be used as an implantable ventricular assist device (VAD). In the VAD system, flow rate is important for monitoring of the state of a recipient and for automatic control to maintain appropriate blood perfusion. To obtain flow rate of the pump without any sensors, we proposed a method of estimating flow rate with supplied power and rotational speed using a time series model. To evaluate the accuracy of the proposed estimation method from the aspect of long-term use, we implanted NEDO PI Gyro pumps in a calf and performed a chronic animal experiment. Flow rate, supplied power and rotational speed were measured until post operation day (POD) 63, and the estimated flow rate was compared with the measured one. We confirmed that waveforms of the measured flow rate was sufficiently similar to the measured one, and correlation between them was higher than 0.9 in all the datasets. On the other hand, the root mean square error increased after 15 days. This error was probably due to the change in physiological condition, the operating point of the pump, or mild intima formation

关键词： Blood Animals Fluid flow measurement Power supplies Power measurement Rotation measurement Velocity measurement computerized monitoring Automatic control Power system modeling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共77页 << < 68 69 70 71 72 73 74 75 76 77 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：