ppxscal/embedding_network huggingface dataset:
AOP Maintains an Independent Coordinate System
Authors: Joe Kutner, Louise Perkins, Sumanth Yenduri, Farnaz Zand, Joe Zhang
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

We argue in this paper that Aspect-Oriented-Programming (AOP) maintains a programmer independent coordinate system and hence supports program correctness proofs. To show this, we revisit Dijkstra’s and Knuth’s original arguments on structured programming.
Timeout-based Information Forwarding Protocol for Wireless Sensor Networks
Authors: Wootae Jeong, Shimon Y. Nof
Venue: International Journal of Distributed Sensor Networks (2007)

Recent wireless microsensor network protocols provide more flexible leverage to the applications with dynamically changing topology, but they should be designed to overcome energy constraints, the bandwidth limit, and system latency. Thus, microsensor network protocols should be effective both in energy and in latency. In addition, they should be evaluated through designated tools at each level of networking characteristics. This paper proposes a new Timeout-based Information Forwarding (TIF) protocol for wireless sensor networks. It uses a relatively simple logic to forward the data packet with multi-hop fashion to reduce the overall network energy consumption. The TIF protocol has been implemented into a network evaluation tool, called TIE/MEMS, and provides a design strategy for distributed wireless sensor network systems needed for various emerging applications. The simulated results show that the TIF protocol has low energy consumption and provides design guidelines between energy consumption and latency according to the number of hops by adjusting weight values in the timeout function.
Exploring High-Dimensional Topologies for NoC Design Through an Integrated Analysis and Synthesis Framework
Authors: Francisco Gilabert, Simone Medardoni, Davide Bertozzi, Luca Benini, María Engracia Gomez, Pedro Lopez, José Duato
Venue: Proceedings of the Second ACM/IEEE International Symposium on Networks-on-Chip (2008)

Networks-on-chip (NoCs) address the challenge to provide scalable communication bandwidth to tiled architectures in a power-efficient fashion. The 2-D mesh is currently the most popular regular topology used for on-chip networks in tile-based architectures, because it perfectly matches the 2-D silicon surface and is easy to implement. However, a number of limitations have been proved in the open literature, especially for long distance traffic. Two relevant variants of 2-D meshes are explored in this paper: high-dimensional and concentrated topologies. The novelty of our exploration framework includes the use of fast and accurate transaction level simulation to provide constraintsto the physical synthesis flow, which is integrated with standard industrial toolchains for accurate physical implementation. Interestingly, this work illustrates how effectively the compared topologies can handle synchronization-intensive traffic patterns and accounts for chip I/O interfaces.
Towards an integrated system model for testing and verification of automation machines
Authors: Benjamin Hummel, Peter Braun
Venue: Proceedings of the 2008 international workshop on Models in software engineering (2008)

Models and documents created during the development of automation machines typically can be categorized into mechanics, electronics, and software. The functionality of an automation machine is, however, realized by the interaction of all three of these domains. So no single model covering only one development category will be able to describe the behavior of the machine thoroughly. For early planning of machine design, virtual prototypes, and especially for the formal verification of requirements an integrated functional model of the machine is required. This paper introduces a technique which can be used to model automation machines on an abstract level, including coarse-grained descriptions of mechanics, electronics and software aspects with special focus on modeling domain-specific issues such as material flow and collision response. The resulting models are detailed enough to be simulated or verified but still suitably abstract to allow fast creation and efficient simulation.
A scheduling algorithm for revenue maximisation for cluster-based Internet services
Authors: James W. J. Xue, Ligang He, Stephen A. Jarvis
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

This paper proposes a new priority scheduling algorithm to maximise site revenue of session-based multi-tier Internet services in a multicluster environment. This research is part of a larger study in support of large-scale online trading systems and, as a result, this case study is chosen as a demonstrator for the techniques presented in this paper. The trading system is partitioned into a number of operations (trade, query etc.), which by their very nature are divided into orders of importance in terms of transactional response. The algorithm in this paper is based on Mean Value Analysis (MVA), which is used for the calculation of performance metrics concerning the queuing networks and workload allocation decision support in the multicluster. In addition to this, the priority assignment is based on combination of three attributes of any given request: (i) the sender class; (ii) the operation and, (iii) the status of the user&#x2019;s portfolio (i.e.number of items in the user&#x2019;s portfolio). A discrete event simulator has been developed to evaluate the performance of the priority scheduling scheme with different combinations of request attributes in various experimental scenarios. Our study aims to develop a dynamic scheduling policy, which takes into account real-time system parameters and optimises the site revenue. Although our priority scheduling algorithm is designed for an online trading system, it can be applied to most e-Commerce systems in which differentiated services are required.
Reducing sparse nonlinear eigenproblems by automated multi-level substructuring
Authors: K. Elssel, H. Voss
Venue: Advances in Engineering Software (2008)

The automated multi-level substructuring method (AMLS) was recently suggested as an alternative to iterative projection methods for computing eigenpairs of huge matrix eigenproblems in the context of structural engineering. Taking advantage of a substructuring on several levels the method constructs a projected problem of much smaller dimension which still yields satisfactory accuracy over a wide frequency range of interest. In this paper we generalise the AMLS method to certain classes of nonlinear eigenvalue problems which can be partitioned into an essential linear and positive definite pencil and a small residual. The efficiency of the method is demonstrated by numerical examples modeling damped vibrations of a structure with nonproportional damping, a gyroscopic eigenproblem, and a rational eigenproblem governing free vibrations of a fluid-solid structure.
Computational Provenance
Authors: Cláudio T. Silva, Joel E. Tohline
Venue: Computing in Science and Engineering (2008)

Systematic mechanisms for capturing and exploring lineage information of digital artifacts are at the heart of a new field of research called computational provenance. This special issue aims to raise awareness and contribute to a better understanding of the issues surrounding computational provenance to the broader CiSE community.
Automation of Manual Tasks for Minimally Invasive Surgery
Authors: H. Mayer, I. Nagy, D. Burschka, A. Knoll, E. U. Braun, R. Lange, R. Bauernschmitt
Venue: Proceedings of the Fourth International Conference on Autonomic and Autonomous Systems (2008)

We have developed an experimental system for minimally invasive surgery providing force feedback and automation of recurring task. The system consists of four robotic arms, which can be equipped with either minimally invasive instruments or a stereo camera.The master console provides a stereo view of the field of operation and two input devices can feed back forces to the user. We have utilized this system to assess the possibility of automating difficult handling tasks like surgical knot tying. In order to achieve this, a novel approach for human-machine skill transfer was developed. It constitutes an extension to learning by demonstration, which is a well known paradigm of robotic learning.
An Infrastructure for Hardware-Software Co-Design of Embedded Real-Time Java Applications
Authors: Elias Teodoro Silva Jr., David Andrews, Carlos Eduardo Pereira, Flávio Rech Wagner
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

The partitioning of applications into hardware and software is an important issue in embedded systems, opening room for high level specifications as well as the exploration of different implementation strategies. This paper presents a software architecture to specify threads in hardware in the context of the Real Time Specification for Java (RTSJ) standard. There is a Java class that encapsulates hardware components, providing an abstraction layer to the application developer. Below this Java class, a wrapper hardware component provides a standard interface between RTSJ-based software components and the hardware that implements the thread behavior. This approach provides a high flexibility in choosing either a hardware or software implementation, allowing to postpone hardware/software partitioning to the very end of system development. The paper includes some quantitative data from an example containing hardware and software threads. While both implementations are compatible with the rest of the application from an interface point-of-view, they lead to very different timing and area results.
Grid scheduling simulations with GSSIM
Authors: Krzysztof Kurowski, Jarek Nabrzyski, Ariel Oleksiak, Jan Weglarz
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

Grid simulation tools provide frameworks for simulating application scheduling in various Grid infrastructures. However, while experimenting with many existing tools, we have encountered two main shortcomings: (i) there are no tools for generating workloads, resources and events ; (ii) it is difficult and time consuming to model different Grid levels, i.e. resource brokers, and local level scheduling systems. In this paper we present the Grid Scheduling Simulator (GSSIM), a framework that addresses these shortcomings and provides an easy-to-use Grid scheduling framework for enabling simulations of a wide range of scheduling algorithms in multi-level, heterogeneous Grid infrastructures. In order to foster more collaboration in the community at large, GSSIM is complemented with a portal (http://www.gssim.org) that provides a repository of Grid scheduling algorithms, synthetic workloads and benchmarks for use with GSSIM.
The dcc curation lifecycle model
Authors: Sarah Higgins
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

The scientific record and the documentary heritage are increasingly created in digital form. The UK based Digital Curation Centre supports institutions who store, manage and preserve such data to help ensure its enhancement and continuing long-term use. The DCC (Digital Curation Centre) Curation Lifecycle Model provides a generic graphical high-level overview of the stages required for successful curation and preservation of digital material from initial conceptualisation. The model can be used to plan curation and preservation activities, to ensure sustainability of repository content or other digital material, within an organisation or consortium. It will help to ensure that all necessary stages are undertaken, each in the correct sequence. The model enables granular functionality to be mapped against it to define roles and responsibilities, and build a framework of standards and technologies to implement. It can help with the process of identifying additional steps which may be required, or actions which are not required by certain situations or disciplines, and of ensuring that processes and policies are adequately documented. Digital Curation Centre staff developed the model before undertaking a period of public consultation, which was recently completed. The newly ratified model will shortly be used by the DCC to ensure that information, services and advisory material cover all areas of the lifecycle. Domain-specific variations of the model will be developed, with greater levels of granularity, to help ensure that advice and information are easily accessible from the website. One planned utilisation is the development of domain specific standards frameworks within the DCC DIFFUSE Standards Frameworks, to help practitioners identify which standards they should be using and where they would be appropriately implemented. This poster will present the DCC Curation Lifecycle Model, incorporating the results of the public consultation period held during December 2007 to February 2008.
VN-KIM IE: automatic extraction of Vietnamese named-entities on the web
Authors: Truc-Vien T. Nguyen, Tru H. Cao
Venue: New Generation Computing (2007)

The most fascinating advantage of the semantic web would be its capabiility of understanding and processing the contents of web pages automatically. Basically, the semantic web realization involves two main tasks: (1) Representation and management of a large amount of data and metadata for web contents; (2) Information extraction and annotation on web pages. On the one hand, recognition of named-entities is regarded as a basic and important problem to be solved, before deeper semantics of a web page could be extracted. On the other hand, semantic web information extraction is a language-dependent problem, which requires particular natural language processing techniques. This paper introduces VN-KIM IE, the information extraction module of the semantic web system VN-KIM that we have developed. The function of VN-KIM IE is to automatically recognize named-entities in Vietnamese web pages, by identifying their classes, and addresses if existing, in the knowledge base of discourse. That information is then annotated to those web pages, providing a basis for NE-based searching on them, as compared to the current keyword-based one. The design, implementation, and performance of VN-KIM IE are presented and discussed.
Initial Work in the Design and Development of Verifiable Workflow Management Systems and Some Applications to Health Care
Authors: Jeff Dallien, Wendy MacCaull, Allen Tien
Venue: Proceedings of the 2008 5th International Workshop on Model-based Methodologies for Pervasive and Embedded Software (2008)

Workflows describe work processes as sequences of tasks and information regarding who performs them and their relative order. Workflows have been found useful to describe processes in a number of industries. This work focuses on workflows used in health care.Formal verification is the growing field of formalizing and verifying specifications for hardware and software systems. Many health care software systems are examples of safety critical systems and their proper function is required to protect the safety of the patients they manage. Formal verification can help assure this safety by checking workflows before they are put into action, where errors can potentially seriously affect patients.A language for expressing properties that need to be verified is developed and a model checker is implemented. The implementation of the model checker written in XSB Prolog is presented.
Semantic forgetting in answer set programming
Authors: Thomas Eiter, Kewen Wang
Venue: Artificial Intelligence (2008)

The notion of forgetting, also known as variable elimination, has been investigated extensively in the context of classical logic, but less so in (nonmonotonic) logic programming and nonmonotonic reasoning. The few approaches that exist are based on syntactic modifications of a program at hand. In this paper, we establish a declarative theory of forgetting for disjunctive logic programs under answer set semantics that is fully based on semantic grounds. The suitability of this theory is justified by a number of desirable properties. In particular, one of our results shows that our notion of forgetting can be entirely captured by classical forgetting. We present several algorithms for computing a representation of the result of forgetting, and provide a characterization of the computational complexity of reasoning from a logic program under forgetting. As applications of our approach, we present a fairly general framework for resolving conflicts in inconsistent knowledge bases that are represented by disjunctive logic programs, and we show how the semantics of inheritance logic programs and update logic programs from the literature can be characterized through forgetting. The basic idea of the conflict resolution framework is to weaken the preferences of each agent by forgetting certain knowledge that causes inconsistency. In particular, we show how to use the notion of forgetting to provide an elegant solution for preference elicitation in disjunctive logic programming.
Large Scale Topology Discovery for Public IPv6 Networks
Authors: Zhenshan Liu, Junyong Luo, Qingxian Wang
Venue: Proceedings of the Seventh International Conference on Networking (2008)

Understanding the topology of large scale IPv6 networks is essential to the procurement of good architectural design decisions, particularly with respect to address allocation and distribution schemes. The former distributed topology discovery applications deploy multiple probing hosts throughout the network. This approach relies on the ability to deploy probing hosts throughout the network, which in many cases is not possible. Source routing support in IPv6 routers is a mandated feature and hence mostly enabled. With respect to simple traceroute, source routing allows one to discover paths between arbitrary pairs of network nodes, but it is such difficult to avoid probing redundancy with a null probing stopping set in the initial phrase of discovery. This paper presents two probing systems: VDPS (Virtual Distributed Probing System) and SRPS (Source Routing Probing System). Firstly, VDPS discovers the BTI (Basic Topology Information) of IPv6 networks. Secondly, SRPS selects seeds from the BTI. In the processing of SRPS, it is very effective in avoiding probing redundancy rely on the probing stopping set initiated by the BTI. Finishing the implementation of SRPS, the coverage of probing is increased greatly. We also present some initial results from probing the CERNET2, currently the largest public IPv6 network of China. The results illustrate the effectiveness of coverage and avoiding probing redundancy
Simultaneous identification of time-varying parameters and estimation of system states using iterative learning observers
Authors: Wen Chen, Fahmida N. Chowdhury
Venue: International Journal of Systems Science (2007)

This article presents the design of an iterative learning observer (ILO) for the purpose of estimating system states while simultaneously identifying time-varying parameters. The proposed ILO uses a novel updating mechanism to identify time-varying parameters instead of using integrators which are commonly used in classical adaptive observers to identify constant parameters while estimating system states. The main idea behind the design of the ILO is the use of learning, i.e. previous information is combined into the ILO for identifying time-varying parameters in real time. Stability and convergence of state and parameter estimation errors are established and proven. An illustrative example exhibits the effectiveness of the proposed ILO.
Surface-based growth simulation for opening flowers
Authors: Takashi Ijiri, Mihoshi Yokoo, Saneyuki Kawabata, Takeo Igarashi
Venue: Proceedings of graphics interface 2008 (2008)

We propose a biologically motivated method for creating animations of opening flowers. We simulate the development of petals based on the observation that flower opening is mainly caused by cell expansion. We use an elastic triangular mesh to represent a petal and emulate its growth by developing each triangular region. Our simulation process consists of two steps. The system first grows each triangle independently according to user-specified parameters and derives target rest edge lengths and dihedral angles. The system then updates the global shape to satisfy the rest lengths and dihedral angles as much as possible by means of energy minimization. We repeat these two processes to obtain keyframes of the flower opening animation. Our system can generate an animation in about 11.5 minutes. Applications include the creation of graphics animations, designing 3D plant models, and simulation for aiding biological study. In contrast to existing systems that simulate the development of flattened 2D petals, our system simulates the growth of petals as 3D surfaces. We show the feasibility of our method by creating animations of Asiatic lily and Eustoma grandiflorum.
A Group Rekeying Scheme for Location-aware Sensor Networks
Authors: Subir Biswas, Syed Rehan Afzal, Gunhee Lee, Dong-kyoo Kim
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Secure group communication is one of the most significant requirements for different applications of a sensor network which employs a group rekeying mechanism for the secure and efficient delivery of its group data. We present a group rekeying scheme for broadcast security of a location aware Wireless Sensor Network exploiting the polynomial share based peer to peer key establishment [3, 4, 5] technique for implementing secure channels between group nodes and then, we introduce a mechanism to deliver the group key to each sensor node.
Web proxy cache replacement scheme based on back-propagation neural network
Authors: Jake Cobb, Hala ElAarag
Venue: Journal of Systems and Software (2008)

Web proxy caches are used to reduce the strain of contemporary web traffic on web servers and network bandwidth providers. In this research, a novel approach to web proxy cache replacement which utilizes neural networks for replacement decisions is developed and analyzed. Neural networks are trained to classify cacheable objects from real world data sets using information known to be important in web proxy caching, such as frequency and recency. Correct classification ratios between 0.85 and 0.88 are obtained both for data used for training and data not used for training. Our approach is compared with Least Recently Used (LRU), Least Frequently Used (LFU) and the optimal case which always rates an object with the number of future requests. Performance is evaluated in simulation for various neural network structures and cache conditions. The final neural networks achieve hit rates that are 86.60% of the optimal in the worst case and 100% of the optimal in the best case. Byte-hit rates are 93.36% of the optimal in the worst case and 99.92% of the optimal in the best case. We examine the input-to-output mappings of individual neural networks and analyze the resulting caching strategy with respect to specific cache conditions.