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

Annual IEEE Symposium on Computer-Based Medical Systems

作者： Atieh Zarabzadeh Farzad Hayati R. William G. Watson Geoff Bradley Jane Grimson Centre of Health Informatics Department of Computer Science Trinity College Dublin Ireland Department of Electronic Electrical & Computer Engineering University of Binningham UK UCD School of Medicine and Medical Science UCD Conway Institute of Biomolecular & Biomedical Research University College Dublin Ireland Trinity Centre of High Performance Computing Trinity College Dublin Ireland

The discovery of biomarkers and the underlying causes of diseases are enabled through the analysis of biological samples and data stored in biobanks. Biological samples and their associated data are expensive to collect and maintain, and it is important to store and manage them efficiently. During processing, samples and data go through a number of procedures and techniques, which are often in different locations and by individuals with different access permissions. It is essential to maintain the link between the samples and their associated data throughout the processes they undergo. This paper presents a novel system of tracking samples and data from collection through processing to storage and retrieval, which is based on Radio Frequency Identification (RFID) technology. This system ensures the security and reliability of sample data as well as location-independent recording and updating of sample data, as they move along the workflow.

关键词： Diseases Radiofrequency identification Educational institutions Information retrieval High performance computing User centered design Biomarkers Prostate cancer Biomedical informatics Computer science

来源：评论

学校读者我要写书评

暂无评论

Due Date Assignment and Scheduling under Special Conditions on Job Processing

引用

IFAC Proceedings Volumes 2009年第4期42卷 522-527页

作者： Valery Gordon Alexandre Dolgui Vitaly Strusevich National Academy of Sciences of Belarus United Institute of Informatics Problems Surganova 6 220012 Minsk Belarus Ecole des Mines de Saint Etienne Industrial Engineering and Computer Science Centre 158 cours Fauriel F -42023 Saint Etienne Cedex 2 France University of Greenwich School of Computing and Mathematical Sciences Old Royal Naval College Park Row Greenwich SE10 9LS London UK

The due date assignment and scheduling problems arise in production planning when the management is faced with setting realistic due dates for a number of jobs. Most research on scheduling with due date assignment is focused on optimal sequencing of independent jobs. However, it is often found in practice that some products are manufactured in a certain order implied, for example, by technological, marketing or assembly requirements and this can be modeled by imposing precedence constraints on the set of jobs. In classical deterministic scheduling models, the processing conditions, including job processing times, are usually viewed as given constants. However, in many real-life situations, the processing conditions may vary over time, thereby affecting actual durations of jobs. There are two categories of scheduling models in which the actual processing time of a job depends on its place in the schedule: in scheduling with deterioration, the later a job starts, the longer it takes to process, and in scheduling with learning, the actual processing time of a job gets shorter, provided that the job is scheduled later. We review the results on scheduling with due date assignment under such conditions on job processing as given precedence constraints or various scenarios of processing time deterioration and learning.

关键词： Scheduling Due Date Assignment Precedence Constraints Deterioration Learning

来源：评论

学校读者我要写书评

暂无评论

A privacy preserving repository for data integration across data sharing services

引用

IEEE Transactions on Services computing 2008年第3期1卷 130-140页

作者： Yau, Stephen S. Yin, Yin Department of Computer Science and Engineering School of Computing and Informatics Arizona State University PO Box 878809 Tempe AZ 85287-8804 United States

Current data sharing and integration among various organizations require a central and trusted authority to first collect data from all data sources and then integrate the collected data. This process tends to complicate the update of data and to compromise data sources' privacy. In this paper, a repository for integrating data from various data sharing services without central authorities is presented. The major differences between our repository and existing central authorities are: 1) Our repository collects data from data sharing services based on users' integration requirements rather than all the data from the data sharing services as existing central authorities. 2) While existing central authorities have full control of the collected data, the capability of our repository is restricted to computing the integration results required by users and cannot get other information about the data or use it for other purposes. 3) The data collected by our repository cannot be used to generate other results except that of the specified data integration request, and hence the compromise of our repository can only reveal the results of the specified data integration request, while the compromise of central authorities will reveal all data. © 2008 IEEE.

关键词： Data integration

来源：评论

学校读者我要写书评

暂无评论

On loop formulas with variables

On loop formulas with variables

引用

11th International Conference on Principles of Knowledge Representation and Reasoning, KR 2008

作者： Lee, Joohyung Meng, Yunsong Department of Computer Science and Engineering School of Computing and Informatics Arizona State University Tempe United States

ISBN: (纸本)9781577353843

Recently Ferraris, Lee and Lifschitz proposed a new definition of stable models that does not refer to grounding, which applies to the syntax of arbitrary first-order sentences. We show its relation to the idea of loop formulas with variables by Chen, Lin, Wang and Zhang, and generalize their loop formulas to disjunctive programs and to arbitrary first-order sentences. We also extend the syntax of logic programs to allow explicit quantifiers, and define its semantics as a subclass of the new language of stable models by Ferraris et al. Such programs inherit from the general language the ability to handle nonmonotonic reasoning under the stable model semantics even in the absence of the unique name and the domain closure assumptions, while yielding more succinct loop formulas than the general language due to the restricted syntax. We also show certain syntactic conditions under which query answering for an extended program can be reduced to entailment checking in first-order logic, providing a way to apply first-order theorem provers to reasoning about non-Herbrand stable models. Copyright © 2008, Association for the Advancement of Artificial Intelligence.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

Adaptive delayed channel access for IEEE 802.11n WLANs

Adaptive delayed channel access for IEEE 802.11n WLANs

引用

2008 4th IEEE International Conference on Circuits and Systems for Communications, ICCSC

作者： Skordoulis, Dionysios Ni, Qiang Min, Geyong Borg, Kevin Electronic and Computer Engineering Division School of Engineering and Design Brunel University West London United Kingdom Department of Computing School of Informatics University of Bradford Bradford United Kingdom

ISBN: (纸本)9781424417087

In this paper we investigate potential benefits that an adaptive delayed channel access algorithm can attain for the next-generation wireless LANs, the IEEE 802.11n. We show that the performance of frame aggregation introduced by the 802.11n adheres due to the priority mechanism of the legacy 802.11e EDCA scheduler, resulting in a poor overall performance. Because high priority flows have low channel utilization, the low priority flows throughputs can be amerced further. By introducing an additional delay at the MAC layer, before the channel access scheduling, it will retain aggregate sizes at higher numbers and consequently a better channel utilization. Also, in order to support both UDP and TCP transport layer protocols, the algorithm's operational conditions are kept adaptive. The simulation results demonstrate that our proposed adaptive delayed channel access outperforms significantly the current 802.11n specification and non-adaptive delayed channel access. ©2008 IEEE.

关键词： Medium access control

来源：评论

学校读者我要写书评

暂无评论

Ant colony optimization for Steiner tree problems 08

Ant colony optimization for Steiner tree problems

引用

5th International Conference on Soft computing As Transdisciplinary Science and Technology, CSTST '08

作者： Prossegger, Markus Bouchachia, Abdelhamid Carinthia University of Applied Sciences School of Telematics/Network Engineering Klagenfurt Austria University of Klagenfurt Dept. of Informatics Group of Software Engineering and Soft Computing Klagenfurt Austria

ISBN: (纸本)9781605580463

Complexity in real-world problems is often tackled by a divide-and-conquer strategy which consists of breaking down the problem into sub-problems to find local solutions. These solutions are then merged in a bottom-up fashion and optimized to produce the final solution. Applications like wiring and pipelining in urban areas are typically complex problems. They require searching the famous Minimum Steiner tree in huge graphs that model the real-world topology of the urban areas. The present paper introduces a new approach relying on the notion of divide-and-conquer to solve the Minimum Steiner tree in large graphs. This approach, called SC-IAC, combines spectral clustering and ant colony optimization in a two-stage algorithm. The first stage allows generating graph segments, whereas the second uses parallel independent ant colonies to find local and global minima of the Steiner tree. To illustrate the efficiency and accuracy of SC-IAC, large real-world benchmarks are used. Copyright 2008 ACM.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

CSV: Visualizing and mining cohesive subgraphs

CSV: Visualizing and mining cohesive subgraphs

引用

2008 ACM SIGMOD International Conference on Management of Data 2008, SIGMOD'08

作者： Wangt, Nan Parthasarathy, Srinivasan Tan, Kian-Lee Tung, Anthony K. H. School of Computing National University of Singapore Singapore Dept. of Computer Science and Engineering and Department of Biomedical Informatics Ohio State University ColumbusOH United States

ISBN: (纸本)9781605581026

Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network analysis, from the World Wide Web to stock market analysis. Motivated by this need recently we have seen several new algorithms to tackle this problem based on the (frequent) pattern mining paradigm. A limitation of most of these methods is that they are highly sensitive to parameter settings, rely on exhaustive enumeration with exponential time complexity, and often fail to help the users understand the underlying distribution of components embedded within the host graph. In this article we propose an approximate algorithm, to mine and visualize cohesive subgraphs (dense sub components) within a large graph. The approach, refereed to as Cohesive Subgraph Visualization (CSV) relies on a novel mapping strategy that maps edges and nodes to a multi-dimensional space wherein dense areas in the mapped space correspond to cohesive subgraphs. The algorithm then walks through the dense regions in the mapped space to output a visual plot that effectively captures the overall dense sub-component distribution of the graph. Unlike extant algorithms with exponential complexity, CSV has a complexity of O(V 2logV) when fixing the parameter mapping dimension, where V corresponds to the number of vertices in the graph, although for many real datasets the performance is typically sub-quadratic. We demonstrate the utility of CSV as a stand-alone tool for visual graph exploration and as a pre-filtering step to significantly scale up exact subgraph mining algorithms such as CLAN [33]. Copyright 2008 ACM.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

A systemic framework for business process modelling and implementation

A systemic framework for business process modelling and impl...

引用

International Conference on Innovations in Information Technology

作者： Mohammed Salahat Steve Wade John Lu Informatics Department School of Computing and Engineering University of Huddersfield UK

This paper proposes a systemic framework combining techniques from soft systems methodology (SSM), the unified modelling language (UML) and the naked objects approach to implementing interactive software systems. The framework supports the full development cycle from business process modelling to software implementation. SSM is used to explore the problem situation, techniques based on the UML are used for detailed design and the Naked Objects framework is used for implementation. We argue that there are advantages from combining and using the three techniques together to improve the quality of business process modelling and implementation. The proposed systemic framework is explained and justified using Mingers multimethodology ideas. The approach is being evaluated through a series of action research projects based on real-world case studies.

关键词： Object oriented modeling Unified modeling language Information systems Software systems informatics Problem-solving Joining processes Humans Manufacturing processes Virtual manufacturing

来源：评论

学校读者我要写书评

暂无评论

802.11 disassociation DoS attack simulation using verilog

引用

WSEAS Transactions on Communications 2008年第3期7卷 198-206页

作者： Aslam, Baber Akhlaq, Monis Khan, Shoab A. Computer Science Department School of Electrical Engineering and Computer Science University of Central Florida Orlando FL 32816 United States Mobile Computing Networks and Security Research Group School of Informatics University of Bradford Bradford BD7 1DP United Kingdom Computer Engineering Department College of E and M Engineering National University of Science and Technology Tamizuddin Road Rawalpindi Pakistan

A number of Denial of Service (DoS) attacks in IEEE 802.11 are due to unauthenticated/unencrypted management and control frames. Current IEEE 802.11 simulators deal with Physical and MAC layers and do not include the exchange of management and control frames, thus making it difficult to simulate an attack (DoS) and its possible solution. A basic IEEE 802.11 network simulator using Verilog is presented. Basic aim is to design a simulator using a hardware description language (HDL) such as Verilog, since the functions and protocols described in state machines are best simulated using a HDL. Besides simulation of a simple wireless network, the paper also presents simulation of a spoofed MAC disassociation DoS attack and one of its possible solutions. The proposed simulator includes the communication setup process and can be used for simulating other DoS attacks and their possible solutions.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Adaptive medium access control for VoIP services in IEEE 802.11 WLANs

Adaptive medium access control for VoIP services in IEEE 802...

引用

2008 4th IEEE International Conference on Circuits and Systems for Communications, ICCSC

作者： Abu-Tair, Mamun I. Min, Geyong Ni, Qiang Liu, Hong Department of Computing School of Informatics University of Bradford Bradford United Kingdom Electronic and Computer Engineering Division School of Engineering and Design Brunel University West London United Kingdom Wuhan National Laboratory for Optoelectronics Huazhong University of Science and Technology China

ISBN: (纸本)9781424417087

Voice over Internet Protocol (VoIP) is an important service with strict Quality-of-Service (QoS) requirements in Wireless Local Area Networks (WLANs). The popular Distributed Coordination Function (DCF) of IEEE 802.11 Medium Access Control (MAC) protocol adopts a Binary Exponential Back-off (BEB) procedure to reduce the packet collision probability in WLANs. In DCF, the size of contention window is doubled upon a collision regardless of the network loads. This paper presents an adaptive MAC scheme to improve the QoS of VoIP in WLANs. This scheme applies a threshold of the collision rate to switch between two different functions for increasing the size of contention window based on the status of network loads. The performance of this scheme is investigated and compared to the original DCF using the network simulator NS-2. The performance results reveal that the adaptive scheme is able to achieve the higher throughput and medium utilization as well as lower access delay and packet loss probability than the original DCF. ©2008 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：