ppxscal/embedding_network huggingface dataset:
On greedy construction of connected dominating sets in wireless networks: Research Articles
Authors: Yingshu Li, My T. Thai, Feng Wang, Chih-Wei Yi, Peng-Jun Wan, Ding-Zhu Du
Venue: Wireless Communications Mobile Computing (2005)

Since no fixed infrastructure and no centralized management present in wireless networks, a connected dominating set (CDS) of the graph representing the network is widely used as a virtual backbone. Constructing a minimum CDS is NP-hard. In this paper, we propose a new greedy algorithm, called S-MIS, with the help of Steiner tree that can construct a CDS within a factor of 4.8&thinsp;+&thinsp;ln5 from the optimal solution. We also introduce the distributed version of this algorithm. We prove that the proposed algorithm is better than the current best performance ratio which is 6.8. A simulation is conducted to compare S-MIS with its variation which is rS-MIS. The simulation shows that the sizes of the CDSs generated by S-MIS and rS-MIS are almost the same. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Root Polar Layout of Internet Address Data for Security Administration
Authors: Glenn A. Fink, Chris North
Venue: Proceedings of the IEEE Workshops on Visualization for Computer Security (2005)

This paper introduces an adaptation of polar coordinates called "root polar plotting" that we have developed for our network pixel map-a computer security visualization capable of representing tens of thousands of hosts at a time. Root polar coordinates overcome two important problems of normal polar coordinates: plot density distortion and severe occlusion near the origin. We discuss several approaches we took while investigating this problem and provide empirical data from experiments we conducted comparing root polar coordinates against both normal polar and Cartesian coordinates. In any application where a polar plot would be useful but distortion of the data must be avoided, or where it is important to avoid some markers from being occluded by others, root polar coordinates may be useful. Our approach provides: (1) a novel adaptation of polar coordinates that overcomes plotting distortion, (2) a means of plotting network data in near real-time without complex layout optimization, (3) an algorithm that reduces occlusion of plotted points while maintaining consistent placement, and (4) an empirical comparison of Cartesian vs. polar plots.
The File Mover: an efficient data transfer system for Grid applications
Authors: C. Anglano, M. Canonico
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

In this paper we present the File Mover, a data transfer system designed to optimize the transfer of potentially very large files. The File Mover relies on an overlay network architecture, where a set of machines cooperate in the transfer by forwarding among them portions of the files being transferred. Data transfer times are minimized by choosing, for each transfer the set of relays that maximize the expected throughput. Preliminary experiments show that the File Mover is able to profitably exploit existing network paths not chosen by IP routing algorithms, thereby enhancing file transfer performance.
Adaptive Fuzzy Logic Controller with Rule-based Changeable Universe Of Discourse for a Nonlinear MIMO System
Authors: Yi Wang, Huiwen Deng, Zheng Chen
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

The accurate input-output universe of discourse (UOD) on which membership functions are defined is hard to acquire, especially for nonlinear multi-input and multi-output (MIMO) systems, and control accuracy will reduce greatly in the steady state due to limited fuzzy control rules. This paper presents a design scheme for the adaptive fuzzy logic controllers to control a MIMO system with on-line changeable input-output UOD of the controller, which could solve two problems mentioned above to a great extent. We obtain fuzzy inference rules that are defined by the error and change of error to describe the variation law of the input-output UOD according to the current trend of the controlled process, so the proper widths of the UOD can be derived from the fuzzy inference rules dynamically in real-time. Simulation results for the nonlinear MIMO system show the effectiveness of the proposed fuzzy logic controller.
A postscript to a taxonomy of models
Authors: Harold Joseph Highland
Venue: ACM SIGSIM Simulation Digest (1973)

When I originally prepared the article several issues ago, I had the uncomfortable feeling that I was missing a compact, well-structured system of model classification. It was one which would immediately inform the reader of the highlights of the model used in the paper he was reading. That classification system is included here (the underscoring indicates the elements of the model in question). The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Two-bit SONOS type Flash using a band engineering in the nitride layer
Authors: Hua-Ching Chien, Chin-Hsing Kao, Jui-Wen Chang, Tzung-Kuen Tsai
Venue: Microelectronic Engineering (2005)

A novel film in the trapping layer of SONOS device has been proposed. With gradually changing Si/N content ratio, the nitrogen-rich in middle (NRM) nitride has better performance and reliability than a conventional standard Si3N4 film. This new configuration can increase trapping efficiency by adding the probability of lateral hopping and reduce charge loss tunneling back to substrate from nitride. Besides, the characteristics of the two-bit operation are exhibited in this study. The SONOS of NRM nitride is suitable for a localized trapping storage promising non-volatile memory application.
Explicit compiler-based memory management for out-of-core applications
Authors: Angela Demke Brown
Venue:  (2005)

For a large class of scientific computing applications, the continuing growth in physical memory capacity cannot be expected to eliminate the need to perform UO throughout their executions. For these out-of-core applications, the large and widening gap between processor performance and disk latency is a major concern. Current operating systems deliver poor performance when an application's working set does not fit in main memory. As a result, programmers who wish to solve these out-of-core problems efficiently are typically faced with the onerous task of rewriting their application to use explicit I/O operations (e.g., read/write). In many cases, the end result is that the size of physical memory determines the size of problem that can be solved. In this dissertation, we propose and evaluate a fully-automatic technique which liberates the programmer from this task, provides high performance, and requires only minimal changes to current operating systems. In our scheme, the compiler provides the crucial information on future access patterns without burdening the programmer, the operating system supports non-binding prefetch and release hints for managing I/O in a virtual memory system, and the operating system cooperates with a run-time layer to accelerate performance by adapting to dynamic behavior and minimizing prefetch overhead. This approach maintains the abstraction of unlimited virtual memory for the programmer, gives the compiler the flexibility to aggressively insert prefetches ahead of references, and gives the operating system the flexibility to arbitrate between the competing resource demands of multiple applications. We implemented our compiler analysis within the SUIF compiler, and used it to target implementations of our run-time and operating system support on both research and commercial systems (HURRICANE and I RIX 6.5, respectively). Our experimental results show large performance gains for out-of-core scientific applications on both systems: more than 50% of the I/O stall time has been eliminated in most cases, thus translating into overall speedups of roughly twofold in many cases. Our initial experiments motivated a new compiler scheduling algorithm that is capable of tolerating the large and variable latencies that are common for disk accesses, in the presence of multiply-nested loops with unknown bounds. On our current experimental systems, many of our benchmark applications remain I/O bound, however, we show that the new scheduling algorithms are able to substantially improve performance in some cases, reducing execution time by an additional 36% in the best case. We further show that the new algorithms should enable applications to make more effective use of higher-bandwidth disk systems that will be available in the future.
A Component Optimization Design Method based on Component Instance Set Decomposition: Decreasing Component Reuse CostExtended-DDF Modeling Embedded System Design: Adapting to IP Technology
Authors: Wang Zhongjie, Xu Xiaofei, Zhan Dechen
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Traditional component design methods pay much attention to component's usefulness, while usually ignore the optimization on component's usability, such as reuse cost. The aim of this paper is to present a method of component reuse cost optimization. For that, a feature-based component model is firstly introduced to express the reusable semantics of component, with emphasis on reuse mechanism based on variation point. By analysis of constituents of component reuse cost, the optimization goal, i.e., increasing the proportion of fixed part of a component, is put forward. Then a component optimization method based on component instance set decomposition (CISdecomposition) is presented, i.e., according to the reuse frequency of every component instance, separate those instances with higher reuse frequency out to get semi-instantiation components., hence avoids multiple instantiation and feature item implementation in the every reuse process, thereby reduces the reuse cost.
Compiler-directed channel allocation for saving power in on-chip networks
Authors: Guangyu Chen, Feihui Li, Mahmut Kandemir
Venue: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2006)

Increasing complexity in the communication patterns of embedded applications parallelized over multiple processing units makes it difficult to continue using the traditional bus-based on-chip communication techniques. The main contribution of this paper is to demonstrate the importance of compiler technology in reducing power consumption of applications designed for emerging multi processor, NoC (Network-on-Chip) based embedded systems. Specifically, we propose and evaluate a compiler-directed approach to NoC power management in the context of array-intensive applications, used frequently in embedded image/video processing. The unique characteristic of the compiler-based approach proposed in this paper is that it increases the idle periods of communication channels by reusing the same set of channels for as many communication messages as possible. The unused channels in this case take better advantage of the underlying power saving mechanism employed by the network architecture. However, this channel reuse optimization should be applied with care as it can hurt performance if two or more simultaneous communications are mapped onto the same set of channels. Therefore, the problem addressed in this paper is one of reducing the number of channels used to implement a set of communications without increasing the communication latency significantly. To test the effectiveness of our approach, we implemented it within an optimizing compiler and performed experiments using twelve application codes and a network simulation environment. Our experiments show that the proposed compiler-based approach is very successful in practice and works well under both hardware based and software based channel turn-off schemes.
On teaching the art of compromising in the development of external specifications
Authors: Izumi Kimura
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1978)

Programming in the broader sense includes the development of an external specification. However, no systematic method has been known for training programmers in this side of programming.This paper presents a sample problem which, it is hoped, will be useful for improving the state of the art. The problem concerns the formatting of a letter. It is designed to require compromises between the implementor's and the user's convenience.The paper outlines a possible solution. It includes a coding example that uses a state diagram as a vehicle for pseudo-coding. It also describes a table driven technique and experiences with using the problem in a classroom and other environments.
STARCast: Streaming Collaboration Platform using the Overlay Technology
Authors: TSUCHIYA Takeshi, YOSHINAGA Hirokazu, KOYANAGI Keiichi
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

In this paper, we propose a streaming platform which we call the STARCast. This platform enables to provide streaming service by overcoming some of the limitations and complexities of current network environments. The STARCast node consists of two types of independent data plane, the one is Streaming Control Plane, which manages some information for connection by the Resource Manager, the another is Streaming data plane, which enables to transfer the all kinds of streaming data without relation of their kinds, and distribute it efficiency use of ALM (Application Layer Multicast) which can be adapted the topology for the number of nodes and requirement from user application. The STARCast also enables adaptation to various types of address spaces such as those of NAT and IPv6, and various transport networks so that streaming services can be offered anywhere on the Internet. And this proposed platform enables to provide and receive the streaming service all over the Internet using any computers ubiquitously. As an function of the STARCast for streaming, we discuss the method for Application Layer Multicast which enables to adapt node character and environment. In this paper, we show the its availability by the simulation.
Joint Management of Authorization for Dynamic Virtual Organization
Authors: Weizhong Qiang, Hai Jin, Xuanhua Shi, Deqing Zou
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

In this paper we define a decentralized management mechanism for the dynamic coalition characteristic of virtual organization. We propose an identity-based threshold signature scheme for joint management. We also propose the policy mode for joint management, which uses role-based access control mechanism for authorization policies definition, and voting mechanism for authorization decision-making. Our solution can satisfy the dynamic coalition requirement of virtual organization, and also guarantee the autonomous characteristic of participant organizations and grid entities. Privacy preservation is also provided for grid entities to interact with authorized entities. Authorization revocation mechanism is taken into consideration in this paper. The experimental performance also shows the scalability of the solution.
Exploring the combination of computational Grid processing techniques and public health information in relation to modeling the effects of hospital closure proposals
Authors: D. Piggott, A. Kelly, C. Teljeur
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

This paper explores the potential use of grid technology in health care, from the perspective of a European health authority in a regional health care network (RHCN) seeking to model the effects of a proposed hospital closure programme. The paper reviews the strategic implications of using a 'Grid-based' application to enable the collation and analyses of public health information (PHI) to support health care planning and capital development. The paper also considers relevant issues in relation to the analysis of data extracted from electronic health records (EHR) systems and patient management systems (PMS), across many hospitals and primary health care centres (PHCC) in a region, via a Grid-based application. The potential for the use of the Grid to support PHI in compute and data intensive tasks is discussed, together with a proposed way forward for the development of a Grid-based RHCN PHI service.
A Solution to Improve the TCP Performance in the Presence of Handoffs in Wireless IP Networks
Authors: Octavio Ramirez Rojas, Jalel Ben Othman
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

TCP is a protocol which performs well with networks that are physically linked and hosts are stationary. However, TCP/IP protocols work independently of the physical layer. In wireless environments, mobile hosts are subject to change their attachment point during communication. When a user moves towards a new network domain during communication, the TCP packet loss is increased. Our approach provides a solution that minimizes the TCP packet loss when handover occurs. This paper introduces a solution for mobility management in the transport layer which improves the TCP performance throughout the handover process.
Evolving next generation signal compression and reconstruction transforms via genetic algorithms
Authors: Frank Moore, Pat Marshall
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Ongoing research has established a new methodology for using genetic algorithms [2] to evolve forward and inverse transforms that significantly reduce quantization error in reconstructed signals and images. The approach promises to revolutionize the signal and image processing field, producing both higher quality images and higher compression ratios than is currently possible with wavelet-based techniques.
A Time Petri Net-Based Approach for Software Synthesis Considering Overheads
Authors: Raimundo Barreto, Eduardo Tavares, Paulo Maciel, Meuse Oliveira,  Jr, Leonardo Amorim, Ricardo Lima, Cesar Carvalho, Carlos Mello
Venue: Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing (2005)

The context of this work is related to embedded hard real-time systems development, more specifically, in the software generation phase. Embedded software has become much harder to design caused by the diversity of requirements and high complexity. Correctness and timeliness verification is an issue to be concerned. Usually, complex embedded real-time systems rely on specialized operating system kernels. However, operating systems may introduce significant overheads in execution time as well as in memory requirement. Software synthesis might be an alternative approach to operating systems usage, since it can generate tailored code for satisfying functional, performance, and resource constraints, and automatically generate runtime support (scheduling, resource management, communication, etc) customized for each particular specification. However, the dispatcher and timer interrupt handler overheads are often neglect in software synthesis research. This paper provides a formal approach for system's modeling, and such model is adopted for synthesizing a timely and predictable scheduled code taking into account dispatcher and interrupt handler overheads.
On the Challenge of Assessing Overlay Topology Adaptation Mechanisms
Authors: Jochen Dinger, Hannes Hartenstein
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

Our thesis is that a peer-to-peer network¿s overlay topology should adapt to match the demand graph of the peer-to-peernetwork. In order to assess the effectiveness of various adaptation mechanisms, a comparison with an optimal topology for a given demand graph would be helpful. However, several related optimization/decision problems have been shown to be NP-hard. The contributions of this paper are threefold: i) we briefly survey NP-hardness results related to assessing overlay adaptation strategies, ii) we present a specific optimization problem and metric, and iii) we provide experimental results indicating the potential of optimizing the overlay topology. Finally, in the spirit of a ¿challenge paper¿ we state and discuss various open issues.
Overcoming programming flaws: indexing of common software vulnerabilities
Authors: Kaloian Petkov
Venue: Proceedings of the 2nd annual conference on Information security curriculum development (2005)

The goal of this research project was to identify categories of programming flaws that lead to software bugs and index existing vulnerability reports against those categories. A keyword-based search placed 70% of the records from the OSVDB and CVE databases into 15 vulnerability categories. The results identified malformed data, buffer overflow and cross-site scripting as the top three issues. The project laid the foundations for future research into ways of mitigating programming flaws.
Using Cognitive Modeling for Requirements Engineering in Anesthesiology
Authors: Constanze Pott, Joost le Feber
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Cognitive modeling is a complexity reducing method to describe significant cognitive processes under a specified research focus. Here, a cognitive process model for decision making in anesthesiology is presented and applied in requirements engineering. Three decision making situations of anesthetists are distinguished, which depend on the state of the patient. For every decision making situation, different requirements of information supply to support decision making of anesthetists can be defined without additional input of the anesthetist. We developed a prototype of a decision support system for familiar situations and de- fine the specifications of a system to support urgent situations. More research about presenting relevant information is needed to support the third decision making situation, diagnosing.
Integration of two ocean models within Cactus
Authors: Fokke Dijkstra, Aad J. van der Steen
Venue: Concurrency and Computation: Practice Experience (2006)

We describe our experiences with the integration of two ocean models (THCM and MOM4) within a computational framework, in this case Cactus. The use of a framework like Cactus offers many advantages to computational scientists. When integrating existing code some problems are still encountered. The main problems are structural ones caused by mismatches between data structures and parallelization models. We discuss these problems and try to offer directions for improvement of the available frameworks. Copyright &copy; 2005 John Wiley & Sons, Ltd.