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

作者： Chen, Ling Zou, Ling-Jun Li, Tu Department of Computer Science Yangzhou University Yangzhou China State Key Lab. of Novel Software Tech. Nanjing University Nanjing China College of Information Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China

A modified Fisher discriminate analysis method for classifying stream data is presented. To satisfy the real-time demand in classifying stream data, this method defines a new criterion for Fisher discriminate analysis. Since the new criterion requires less computation and memory space, it is much faster and more suitable for online processing in stream data environment. It can overcome the problem of singular within-class scatter matrix in traditional FDA. Our algorithm speeds up the mining process while maintaining the high classification accuracy and capturing the up-to-date trends in the stream. Experiments on real and synthetic data sets show that our algorithm can improve the classification accuracy and speed for stream data classification. © 2009 Academy Publisher.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Independent domination on tree convex bipartite graphs

Independent domination on tree convex bipartite graphs

引用

6th International Frontiers of Algorithmics Workshop, FAW 2012 and 8th International Conference on Algorithmic Aspects of Information and Management, AAIM 2012

作者： Song, Yu Liu, Tian Xu, Ke Key Laboratory of High Confidence Software Technologies School of Electronic Engineering and Computer Science Peking University Beijing 100871 China National Lab. of Software Development Environment Beihang University Beijing 100191 China

ISBN: (纸本)9783642296994

An independent dominating set in a graph is a subset of vertices, such that every vertex outside this subset has a neighbor in this subset (dominating), and the induced subgraph of this subset contains no edge (independent). It was known that finding the minimum independent dominating set (Independent Domination) is -complete on bipartite graphs, but tractable on convex bipartite graphs. A bipartite graph is called tree convex, if there is a tree defined on one part of the vertices, such that for every vertex in another part, the neighborhood of this vertex is a connected subtree. A convex bipartite graph is just a tree convex one where the tree is a path. We find that the sum of larger-than-two degrees of the tree is a key quantity to classify the computational complexity of independent domination on tree convex bipartite graphs. That is, when the sum is bounded by a constant, the problem is tractable, but when the sum is unbounded, and even when the maximum degree of the tree is bounded, the problem is -complete. © 2012 Springer-Verlag.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Circular convex bipartite graphs: Feedback vertex set

Circular convex bipartite graphs: Feedback vertex set

引用

7th International Conference on Combinatorial Optimization and Applications, COCOA 2013

作者： Lu, Zhao Lu, Min Liu, Tian Xu, Ke Key Laboratory of High Confidence Software Technologies School of Electronic Engineering and Computer Science Peking University Beijing 100871 China National Lab. of Software Development Environment Beihang University Beijing 100191 China

ISBN: (纸本)9783319037790

A feedback vertex set is a subset of vertices, such that the removal of this subset renders the remaining graph cycle-free. The weight of a feedback vertex set is the sum of weights of its vertices. Finding a minimum weighted feedback vertex set is tractable for convex bipartite graphs, but NP-complete even for unweighted bipartite graphs. In a circular convex (convex, respectively) bipartite graph, there is a circular (linear, respectively) ordering defined on one class of vertices, such that for every vertex in another class, the neighborhood of this vertex is a circular arc (an interval, respectively). The minimum weighted feedback vertex set problem is shown tractable for circular convex bipartite graphs in this paper, by making a Cook reduction (i.e. polynomial time Turing reduction) for this problem from circular convex bipartite graphs to convex bipartite graphs. © Springer International Publishing 2013.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Extending the nested parallel model to the nested dataflow model with provably efficient schedulers 16

Extending the nested parallel model to the nested dataflow m...

引用

28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016

作者： Dinh, David Simhadri, Harsha Vardhan Tang, Yuan Computer Science Division Univ. of California Berkeley BerkeleyCA94720 United States Computer Science Dept. Lawrence Berkeley National Lab. BerkeleyCA94720 United States School of Software Fudan Univ. Shanghai Key Lab. of Intelligent Information Processing Shanghai200433 China

ISBN: (纸本)9781450342100

The nested parallel (a.k.a. fork-join) model is widely used for writing parallel programs. However, the two composition constructs, i.e. "k" (parallel) and "k" (serial), that comprise the nested-parallel model are insufficient in expressing "partial dependencies" in a program. We propose a new dataflow composition construct "" to express partial dependencies in algorithms in a processorand cache-oblivious way, thus extending the Nested Parallel (NP) model to the Nested Dataflow (ND) model. We redesign several divide-and-conquer algorithms ranging from dense linear algebra to dynamic-programming in the ND model and prove that they all have optimal span while retaining optimal cache complexity. We propose the design of runtime schedulers that map ND programs to multicore processors with multiple levels of possibly shared caches (i.e, Parallel Memory Hierarchies) and prove guarantees on their ability to balance nodes across processors and preserve locality. For this, we adapt space-bounded (SB) schedulers for the ND model. We show that our algorithms have increased "parallelizability" in the ND model, and that SB schedulers can use the extra parallelizability to achieve asymptotically optimal bounds on cache misses and running time on a greater number of processors than in the NP model. The running time for the algorithms in this paper is(Equation presented on a p-processor machine, where Q∗ is the parallel cache complexity of task t, Ci is the cost of cache miss at level-i cache which is of size Mi, and σ ∈ (0,1) is a constant.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

An energy-aware protocol for data gathering applications in wireless sensor networks

An energy-aware protocol for data gathering applications in ...

引用

IEEE International Conference on Communications (ICC 2007)

作者： Liu, Ming Zheng, Yuan Cao, Jiannong Chen, Guihai Chen, Lijun Gong, Haigang School of Computer Science and Engineering University of Electronic and Technology of China China Internet and Mobile Computing Lab. Department of Computing Hong Kong Polytechnic University Hong Kong State Key Laboratory for Novel Software Technology Nanjing University China

ISBN: (纸本)9781424403523

Data gathering is a major function of many applications in wireless sensor networks (WSNs). The most important issue in designing a data gathering algorithm is how to save energy of sensor nodes while meeting the requirement of applications/users such as sensing area coverage. In this paper, we propose a novel hierarchical clustering protocol for long-lived sensor network. EAP achieves a good performance in terms of lifetime by minimizing energy consumption for in-network communications and balancing the energy load among all nodes. EAP introduces a new clustering parameter for cluster head election, which can better handle the heterogeneous energy capacities. Furthermore, it also introduces a simple but efficient approach, namely intra-cluster coverage to cope with the area coverage problem. We evaluate the performance of the proposed protocol using a simple temperature sensing application. Simulation results show that our protocol significantly outperforms LEACH and HEED in terms of network lifetime and the amount of data gathered.

关键词： Network protocols

来源：评论

学校读者我要写书评

暂无评论

Hybrid annex: An AADL extension for continuous behavior and cyber-physical interaction modeling

Hybrid annex: An AADL extension for continuous behavior and ...

引用

ACM SIGAda's Annual International Conference High Integrity Language Technology, HILT 2014

作者： Ahmad, Ehsan Larson, Brian R. Barrett, Stephen C. Zhan, Naijun Dong, Yunwei State Key Lab. of Comput. Sci. Inst. of Software Northwestern Polytechnical University Chinese Academy of Sciences China Computing and Information Systems Kansas State University ManhattanKS66506 United States State Key Lab. of Comput. Sci. Inst. of Software Chinese Academy of Sciences Beijing100190 China School of Computer Science Northwestern Polytechnical University Xi'an710129 China

ISBN: (纸本)9781450332170

Correct design, and system-level dependability prediction of highly-integrated systems demand the collocation of requirements and architectural artifacts within an integrated development environment. Hybrid systems, having dependencies and extensive interactions between their control portion and their environment, further intensify this need. AADL is a model-based engineering language for the architectural design and analysis of embedded control systems. Core AADL has been extended with a mechanism for discrete behavioral modeling and analysis of control systems, but not for the continuous behavior of the physical environment. In this paper, we introduce a lightweight language extension to AADL called the Hybrid Annex for continuoustime modeling, fulfilling the need for integrated modeling of the computing system along with its physical environment in their respective domains. The Isolette system described in the FAA Requirement Engineering Management Handbook is used to illustrate continuous behavior modeling with the proposed Hybrid Annex. Copyright 2014 ACM.

关键词： Hybrid systems

来源：评论

学校读者我要写书评

暂无评论

The Embedding Path Order for Lambda-Free Higher-Order Terms

Journal of Applied Logics

引用

Journal of Applied Logics 2021年第10期8卷 2447-2470页

作者： Bentkamp, Alexander Vrije Universiteit Amsterdam Netherlands State Key Lab. of Computer Science Institute of Software CAS Beijing China

The embedding path order, introduced in this article, is a variant of the recursive path order (RPO) for untyped λ-free higher-order terms (also called applicative first-order terms). Unlike other higher-order variants of RPO, it is a ground-total and well-founded simplification order, making it more suitable for the superposition calculus. I formally proved the order’s theoretical properties in Isabelle/HOL and evaluated the order in a prototype based on the superposition prover Zipperposition. © 2021, College Publications. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Dynamics of a congestion control model in a wireless access network

引用

Nonlinear Analysis: Real World Applications 2013年第1期14卷 671-683页

作者： Dong, Tao Liao, Xiaofeng Huang, Tingwen State Key Lab. of Power Transmission Equipment and System Security College of Computer Science Chongqing University Chongqing 400044 China College of Software and Engineering Chongqing University of Posts and Telecommunications Chongqing 400065 China Texas AandM University at Qatar Doha P.O. Box 23874 Qatar

In this paper, a congestion control algorithm with heterogeneous delays in a wireless access network is considered. We regard the communication time delay as a bifurcating parameter to study the dynamical behaviors, i.e., local asymptotical stability, Hopf bifurcation and resonant codimension-two bifurcation. By analyzing the associated characteristic equation, the Hopf bifurcation occurs when the delay passes through a sequence of critical value. Furthermore, the direction and stability of the bifurcating periodic solutions are derived by applying the normal form theory and the center manifold theorem. In the meantime, the resonant codimension-two bifurcation is also found in this model. Some numerical examples are finally performed to verify the theoretical results. © 2012 Published by Elsevier Ltd.

关键词： Codimension-two bifurcation Congestion control Hopf bifurcation Stability Wireless access network

来源：评论

学校读者我要写书评

暂无评论

Detecting Exception Handling Bugs in C++ Programs 23

Detecting Exception Handling Bugs in C++ Programs

引用

45th IEEE/ACM International Conference on software Engineering, ICSE 2023

作者： Zhang, Hao Luo, Ji Hu, Mengze Yan, Jun Zhang, Jian Qiu, Zongyan Institute of Software Cas China Univ. of Chinese Academy of Sciences State Key Lab. of Computer Science Beijing China Univ. of Chinese Academy of Sciences Tech. Center of Softw. Eng. Beijing China Hangzhou Institute for Advanced Study Univ. of Chinese Academy of Sciences State Key Lab. of Computer Science Beijing China School of Mathematical Sciences Peking University Beijing China

ISBN: (纸本)9781665457019

Exception handling is a mechanism in modern programming languages. Studies have shown that the exception handling code is error-prone. However, there is still limited research on detecting exception handling bugs, especially for C++ programs. To tackle the issue, we try to precisely represent the exception control flow in C++ programs and propose an analysis method that makes use of the control flow to detect such bugs. More specifically, we first extend control flow graph by introducing the concepts of five different kinds of basic blocks, and then modify the classic symbolic execution framework by extending the program state to a quadruple and properly processing try, throw and catch statements. Based on the above techniques, we develop a static analysis tool on the top of Clang Static Analyzer to detect exception handling bugs. We run our tool on projects with high stars from GitHub and find 36 exception handling bugs in 8 projects, with a precision of 84%. We compare our tool with four state-of-the-art static analysis tools (Cppcheck, Clang Static Analyzer, Facebook Infer and IKOS) on projects from GitHub and handmade benchmarks. On the GitHub projects, other tools are not able to detect any exception handling bugs found by our tool. On the handmade benchmarks, our tool has a significant higher recall. © 2023 IEEE.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

Theory and Applications of Models of Computation 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Jin-Yi Cai S. Barry Cooper Angsheng Li

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：