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

International Conference on computer and Information Technology (ICCIT)

作者： S Algoul M A Hossain M S Alam M A Majumder Department of Computing School of Computing Informatics and Media University of Bradford Bradford UK Department of Computer Science School of Computing Engineering and Information University of Northumbria UK Department of Applied Physics Electronics and Communication Engineering University of Dhaka Bangladesh University of Bradford Bradford West Yorkshire GB

This paper presents an investigation into the development of a multi-objective optimal chemotherapy control model to reduce the number of cancer cells after a number of fixed treatment cycles with minimum side effects. A phase specific drug scheduling method using a close-loop control method with multi-objective techniques is proposed in this paper. Genetic Algorithm (GA) and particle swarm optimisation algorithm (PSO) are used to optimise the control solution for trading-off between the cell killing and toxic side effects. A close-loop control method, namely Integral-Proportional-Derivative (I-PD) is designed to control the drug to be infused into the patient's body and multi-objective GA (MOGA) and multi-objective PSO (MOPSO) are used to find suitable parameters of the controller. The proposed algorithm is implemented, tested and verified through a set of experiments. Performances of the proposed methods demonstrated that both the MOGA and MOPSO approach can offer very efficient drug scheduling that trade-off between cell killing and toxic side effects and satisfy associated design goals. It is also noted that the MOGA based method offers better performance as compared to MOPSO and can reduce the number of proliferating and quiescent cells up to 72.2% and 60.4% respectively. Future research needs to evaluate the proposed scheduling with clinical data and experiments.

关键词： Drugs

来源：评论

学校读者我要写书评

暂无评论

MLEA： A Solution for Users of Android in UTPVirtual

引用

computer Technology and Application 2011年第5期2卷 406-412页

作者： Gisela Torres de Clunie Sergio Crespo Coelho da Silva Pinto Aris Linet Castillo Lucas Monteiro Braz Tasia Serrao Norman Rangel Jeanette Riley Olinda de Barraza Kexy Rodriguez Computer Systems Engineering Department Technological University of Panama Panama 0819 Panama Computer Science Research and Graduate Program in Applied Computing University of the Sinos Valley （UNISINOS） RS 93022-000 Brazil CIDITIC Technological University of Panama Panama 0819 Panama

This paper describes a design of an educational platform for a mobile learning architecture, which is a state of the an topic in distance education. The product will allow users to interact in an efficient, flexible, and transparent fashion with a web-based education environment, in this case Module Object-Oriented Dynamic Learning Environment （Moodle）, using Android mobile devices. In order to provide a strong and lasting architecture, the Service Oriented Architecture （SOA） methodology is used given that it allows easy software re-utilization as well as integration of heterogeneous services. The architecture is based on web services implemented with Representational State Transfer （REST）, as it has been demonstrated to be lighter and less consuming than other protocols, for devices with limited resources such as mobile devices. Web services provide the communication means between the server side and the client side of the architecture, whereas agents are used to deliver the services itself. The authors propose the development of an environment that facilitates the integration of various educational resources to support m-learning. An important aspect of the proposal is the offering of a tool to provide customized alerts for students and teachers, enabling them to remain updated about activities taking place in the courses.

关键词： Distance learning virtual education m-learning service oriented architecture （SOA） mobile learning mobile computing interoperability representational state transfer （REST）.

来源：评论

学校读者我要写书评

暂无评论

Detecting Ambiguous Author Names in Crowdsourced Scholarly Data

Detecting Ambiguous Author Names in Crowdsourced Scholarly D...

引用

IEEE International Conference on and IEEE International Confernece on Social computing (SocialCom) Privacy, Security, Risk and Trust (PASSAT)

作者： Xiaoling Sun Jasleen Kaur Lino Possamai Filippo Menczer School of Informatics and Computing Indiana University Bloomington USA Department of Computer Science and Technology Dalian University of Technology Dalian China Department of Pure and Applied Mathematics University of Padua Italy

The name ambiguity problem is a challenge in many areas, especially in the field of bibliographic digital libraries. For example, in services that use citation data to compute the impact of authors, ambiguous names lead to biased measures. The problem is amplified where names are collected from heterogeneous sources, including crowd sourced annotations. This is the case in the Scholaro meter system, which cross-correlates author names in user queries with those retrieved from bibliographic data. The uncontrolled nature of user-generated annotations is very valuable, but creates the need to detect ambiguous names. In this paper, we propose an approach to detect ambiguous names at query time, which makes it applicable in the context of a social computing application. We explore two kinds of heuristic features based on citations and crowd sourced topics. Our approach can detect ambiguous author names in crowd sourced scholarly data with an accuracy of 75%.

关键词： Libraries Accuracy Educational institutions computer science Feature extraction Collaboration Indexes

来源：评论

学校读者我要写书评

暂无评论

Dynamic Load Balance for Optimized Message Logging in Fault Tolerant HPC Applications

Dynamic Load Balance for Optimized Message Logging in Fault ...

引用

IEEE International Conference on Cluster computing

作者： Esteban Meneses Laxmikant V. Kale Greg Bronevetsky Department of Computer Science University of Illinois Urbana-Champaign Urbana IL USA Center of Applied Scientific Computing Lawrence Livermore National Laboratory Livermore CA USA

computing systems will grow significantly larger in the near future to satisfy the needs of computational scientists in areas like climate modeling, biophysics and cosmology. Supercomputers being installed in the next few years will comprise millions of cores, hundreds of thousands of processor chips and millions of physical components. However, it is expected that failures become more prevalent in those machines to the point where 10% of an Exascale system will be wasted just recovering from failures. Further, with such large numbers of cores, fine-grained and dynamic load balance will become increasingly critical for maintaining good system utilization. This paper addresses both fault tolerance and load balancing by presenting a novel extension of traditional message logging protocols based on team check pointing. Message logging makes it possible to recover from localized failures by rolling back just the failed processing elements. Since this comes at a high memory overhead from logging all communication, we reduce this cost by organizing processing elements into teams and only logging messages between teams. Further, we show how to dynamically partition the application into teams to simultaneously minimize the cost of fault tolerance and to balance application load. We experimentally show that this scheme has low overhead and can dramatically reduce the memory cost of message logging.

关键词： Protocols Checkpointing Load management Partitioning algorithms Fault tolerance Fault tolerant systems Receivers

来源：评论

学校读者我要写书评

暂无评论

Avoiding hot-spots on two-level direct networks

Avoiding hot-spots on two-level direct networks

引用

Supercomputing Conference

作者： Abhinav Bhatele William D. Gropp Nikhil Jain Laxmikant V. Kale Center for Applied Scientific Computing Lawrence Livemore National Laboratory Livermore CA USA Department of Computer Science University of Illinois Urbana-Champaign Urbana IL USA

A low-diameter, fast interconnection network is going to be a prerequisite for building exascale machines. A two-level direct network has been proposed by several groups as a scalable design for future machines. IBM's PERCS topology and the dragonfly net-work discussed in the DARPA exascale hardware study are examples of this design. The presence of multiple levels in this design leads to hot-spots on a few links when processes are grouped together at the lowest level to minimize total communication volume. This is especially true for communication graphs with a small number of neighbors per task. Routing and mapping choices can impact the communication performance of parallel applications running on a machine with a two-level direct topology. This paper explores intelligent topology aware mappings of different communication patterns to the physical topology to identify cases that minimize link utilization. We also analyze the trade-offs between using direct and indirect routing with different mappings. We use simulations to study communication and overall performance of applications since there are no installations of two-level direct networks yet. This study raises interesting issues regarding the choice of job scheduling, routing and mapping for future machines.

关键词： Topology Routing Network topology Bandwidth Computational modeling Predictive models Arrays

来源：评论

学校读者我要写书评

暂无评论

Weighted locality-sensitive scheduling for mitigating noise on multi-core clusters

Weighted locality-sensitive scheduling for mitigating noise ...

引用

International Conference on High Performance computing

作者： Vivek Kale Abhinav Bhatele William D. Gropp Department of Computer Science University of Illinois at Urbana-Champaign Urbana IL USA Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore CA USA

Recent studies have shown that operating system (OS) interference, popularly called OS noise can be a significant problem as we scale to a large number of processors. One solution for mitigating noise is to turn off certain OS services on the machine. However, this is typically infeasible because full-scale OS services may be required for some applications. Furthermore, it is not a choice that an end user can make. Thus, we need an application-level solution. Building upon previous work that demonstrated the utility of within-node light-weight load balancing, we discuss the technique of weighted micro-scheduling and provide insights based on experimentation for two different machines with very different noise signatures. Through careful enumeration of the search space of scheduler parameters, we allow our weighted micro-scheduler to be dynamic, adaptive and tunable for a specific application running on a specific architecture. By doing this, we show how we can enable running scientific applications efficiently on a very large number of processors, even in the presence of noise.

关键词： Noise Dynamic scheduling Processor scheduling Load management Operating systems Tuning Program processors

来源：评论

学校读者我要写书评

暂无评论

Malware behavioral analysis system: TWMAN

Malware behavioral analysis system: TWMAN

引用

IEEE Symposium on Intelligent Agents, IA

作者： Hsien-De Huang Chang-Shing Lee Hung-Yu Kao Yi-Lang Tsai Jee-Gong Chang National Center of High-Performance Computing National Applied Research Laboratories Tainan Taiwan Department Computer Science and Information Engineering National University of Tainan Tainan Taiwan Department Computer Science and Information Engineering National Cheng Kung University Tainan Taiwan

Malware is an important topic of security threat research. In this paper, a behavioral malware analysis system TWMAN was presented. This study focuses on using real operation system (OS) environment to analysis malware behavioral. Many researchers try to use virtual machine (VM) system to monitor the malware behaviors. These malware samples will only compromise the virtual operating system or virtual machine, which cannot reflect in the real operating system or real environment. Therefore, some malware researchers don't want their systems to be analyzed in VM environment, because the analyzer cannot much useful information in VM environment. There are many Anti-VM techniques which are used to ward off the collection, analysis, and reverse engineering features of the VM based malware analysis platform. There are differences between these two behaviors: malware behavior in real environment and in virtual environment. Therefore, malware researcher would get inaccurate analysis results from VM based malware analysis platform. In order to retrieve correct malware behavioral information, we need flexible, adaptable, and quickly analysis environment, which could discovery malware behavioral in real operation system environment, and which can quickly restore clear operation system to analysis another malware sample. For this reason, this study developed Taiwan Malware Analysis Net(TWMAN), a real operation system environment for malware behavioral analysis and analysis report. We believe this system would be helpful to improve the correctness of malware analysis result and reduce the loss rate of malware analysis.

关键词： Malware IP networks Internet Software Forensics Image restoration

来源：评论

学校读者我要写书评

暂无评论

Improving communication performance in dense linear algebra via topology aware collectives

Improving communication performance in dense linear algebra ...

引用

Supercomputing Conference

作者： Edgar Solomonik Abhinav Bhatele James Demmel Department of Electric Engineering and Computer Science University of California Berkeley Berkeley CA USA Center for Applied Scientific Computing Lawrence Livemore National Laboratory Livermore CA USA

Recent results have shown that topology aware mapping reduces network contention in communication-intensive kernels on massively parallel machines. We demonstrate that on mesh interconnects, topology aware mapping also allows for the utilization of highly-efficient topology aware collectives. We map novel 2.5D dense linear algebra algorithms to exploit rectangular collectives on cuboid partitions allocated by a Blue Gene/P supercomputer. Our mappings allow the algorithms to exploit optimized line multicasts and reductions. Commonly used 2D algorithms cannot be mapped in this fashion. On 16,384 nodes (65,536 cores) of Blue Gene/P, 2.5D algorithms that exploit rectangular collectives are sig- nificantly faster than 2D matrix multiplication (MM) and LU factorization, up to 8.7x and 2.1x, respectively. These speed-ups are due to communication reduction (up to 95.6% for 2.5D MM with respect to 2D MM). We also derive LogP- based novel performance models for rectangular broadcasts and reductions. Using those, we model the performance of matrix multiplication and LU factorization on a hypothetical exascale architecture.

关键词： Partitioning algorithms Topology Three dimensional displays Algorithm design and analysis Bandwidth Linear algebra Network topology

来源：评论

学校读者我要写书评

暂无评论

K, T and D-like fuzzy Kripke models

K, T and D-like fuzzy Kripke models

引用

Annual Meeting of The North American Fuzzy Information Processing Society

作者： Bedregal, Benjamin Santiago, Regivan H. N. Benevides, Mario Viana, Petrucio Group of Logic Language Information Theory and Applications - LoLITA Department of Informatics and Applied Mathematics Federal University of Rio Grande Do Norte 59072-970 Natal-RN Brazil Program of Engineering of Systems and Computing - PESC Department of Computer Science Federal University of Rio de Janeiro 21941-972 Rio de Janeiro-RJ Brazil Department of Analysis Fluminense Federal University 24020-140 Niterói-RJ Brazil

ISBN: (纸本)9781612849676

The idea of a Kripke semantics endowed with possibility/plausibility information is not new;in fact there are different approaches for that;see: [6], [13], [16], [19]. This paper follows the approach found in [6], but whereas [6] provides a fixed interpretation for connectives into [0,1] here we provide a characterization of a fuzzy semantics for connectives in such a way that the resulting fuzzy frames: K, T and D, are described precisely by the set of statements which also describes, respectively, the usual modal systems K, T and D. © 2011 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Cyber Physical Society with SOA, BPM and Sensor Networks Track Report - CPS 2011

Cyber Physical Society with SOA, BPM and Sensor Networks Tra...

引用

IEEE International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises (WET ICE)

作者： Zhangbing Zhou Xiaoping Sun Lei Shu Chin-Feng Lai Computer Science Department Institute Telecom & Management SudParis Evry France Institute of Computing Technology Chinese Academy of Sciences Beijing China Nishio Lab. Department of Multimedia Engineering Osaka University Japan Department of Applied Geoinformatics National Ilan University Taiwan

Along with the stronger capability of computing devices and the cheaper and faster communication networks, computing will be embedded in all types of physical resources, and applications with big societal impact and e... 详细信息

关键词： Data models Business Collaboration Electronic mail Wireless sensor networks Societies Authentication

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：