ppxscal/embedding_network huggingface dataset:
AOP for the domain of runtime monitoring: breaking out of the code-based model
Authors: Amjad Nusayr, Jonathan Cook
Venue: Proceedings of the 4th workshop on Domain-specific aspect languages (2009)

Runtime monitoring, even the canonical "logging" example of AOP, has long been one of the domains into which AOP has effectively been deployed. Yet to date AOP has not supported the full breadth of needs across the scope of widely varied runtime monitoring applications. In this paper we present the directions in which we believe AOP needs to be extended in order to better support the breadth of runtime monitoring needs.
Introduction to electronic mail
Authors: Walter E. Ulrich
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

Electronic Mail is the forwarding of message content by electronic means, and is normally associated with communications between people. In the case of traditional postal service (as opposed to Electronic Mail), the document is physically delivered to its destination using transportation methods. In electronic mail, the content of the message is transformed into electrical signals and forwarded over communication channels for at least some portion of its journey.
Design and Implementation of Home Automated Telemanagement System for Patients with Ulcerative Colitis
Authors: Joseph Finkelstein, Jeffrey Wood, Raymond Cross
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

We developed a Home Automated Telemanagement (HAT) system for the computer-guided management of patients with ulcerative colitis to monitor symptoms, medication compliance, weight changes, and quality of life, while educating the patients on their disease. The system runs on a laptop computer connected to a phone line and a digital scale placed in the patient’s home. The system questions the patient on their condition, monitors their weight, and provides the patient with feedback on suggested management techniques. Their medication regimen and suggested actions are determined by their physician and integrated in to the system, keeping a personalized approach to disease management while taking advantage of the technology available. This low-cost telemanagement system has been successfully introduced to optimize the care of patients with ulcerative colitis.
Classification error of multilayer perceptron neural networks
Authors: Lihua Feng, Weihu Hong
Venue: Neural Computing and Applications (2009)

In subject classification, artificial neural networks (ANNS) are efficient and objective classification methods. Thus, they have been successfully applied to the numerous classification fields. Sometimes, however, classifications do not match the real world, and are subjected to errors. These problems are caused by the nature of ANNS. We discuss these on multilayer perceptron neural networks. By studying of these problems, it helps us to have a better understanding on its classification.
Precise slicing of concurrent programs
Authors: Dennis Giffhorn, Christian Hammer
Venue: Automated Software Engineering (2009)

While there exist efficient algorithms to slice sequential programs precisely, there are only two algorithms for precise slicing of concurrent interprocedural programs with recursive procedures (Krinke in Proc. ESEC/FSE'03, pp. 178---187, 2003; Nanda and Ramesh in ACM Toplas. 28(6):1088---1144, 2006). We present an empirical evaluation of both algorithms for Java. We demonstrate that both algorithms provide the same precision up to the model of concurrency in use and show that the concurrency model has strong impact on slice precision and computation costs. Furthermore, we extend both algorithms to support dynamic thread creation both in loops and recursion--a feature that the original algorithms could not fully handle. The worst case complexity of the algorithms being exponential, we developed several optimizations and compared these with each other and with algorithms that trade precision for speed. Finally, we show that one algorithm may produce incorrect slices and present a remedy.
Experiments in Theorem Proving for Topological Hybrid Logic
Authors: Dmitry Sustretov, Guillaume Hoffmann, Carlos Areces, Patrick Blackburn
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

This paper discusses two experiments in theorem proving for hybrid logic under the topological interpretation. We begin by discussing the topological interpretation of hybrid logic and noting what it adds to the topological interpretation of orthodox modal logic. We then examine two implemented proof methods. The first makes use of HyLoBan, a terminating theorem prover that searches for a winning search strategy in certain topologically motivated games. The second is a translation-based approach that makes use HyLoTab [J. van Eijck. HyLoTab - Tableau-based theorem proving for hybrid logics. Manuscript, CWI, available from http://www.cwi.nl/~jve/hylotab, 2002], a tableaux-based theorem prover for hybrid logic under the standard relational interpretation. We compare the two methods, and note a number of directions for further work.
An optimal investment and consumption model with stochastic returns
Authors: Xikui Wang, Yanqing Yi
Venue: Applied Stochastic Models in Business and Industry (2009)

We consider a financial market consisting of a risky asset and a riskless one, with a constant or random investment horizon. The interest rate from the riskless asset is constant, but the relative return rate from the risky asset is stochastic with an unknown parameter in its distribution. Following the Bayesian approach, the optimal investment and consumption problem is formulated as a Markov decision process. We incorporate the concept of risk aversion into the model and characterize the optimal strategies for both the power and logarithmic utility functions with a constant relative risk aversion (CRRA). Numerical examples are provided that support the intuition that a higher proportion of investment should be allocated to the risky asset if the mean return rate on the risky asset is higher or the risky asset return rate is less volatile. Copyright &copy; 2008 John Wiley & Sons, Ltd.
A Home Health Monitoring System Designed to Support Carers in Their Caring Role
Authors: Andrea Taylor, Richard Wilson, Stefan Agamanolis
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

In the UK, a ‘carer’ is someone who, unpaid, looks after a family member, friend or partner who could not manage without them because of frailness, illness or disability. In this paper, we present research on the role of the carer, and describe why it is important to consider carers in the design of new healthcare technology to support people to self care. By self care, we mean supporting people to take more control and responsibility for their own health and well-being. Our contribution is a set of design guidelines for new home monitoring technology. Our guidelines are distilled from a survey distributed to carers in Moray, North East Scotland on sharing health information and a follow-up discussion at a carers forum. We used these guidelines to design a new home monitoring system. The main difference with current systems is that data is primarily shared between carer and cared-for, rather than health professional and patient, and carers are encouraged to use the system to monitor their own health.
Fast Synchronization in P Systems
Authors: Artiom Alhazov, Maurice Margenstern, Sergey Verlan
Venue: Membrane Computing: 9th International Workshop, WMC 2008, Edinburgh, UK, July 28-31, 2008, Revised Selected and Invited Papers (2009)

We consider the problem of synchronizing the activity of all membranes of a P system. After pointing the connection with a similar problem dealt with in the field of cellular automata, where the problem is called the firing squad synchronization problem, FSSP for short, we provide two algorithms to solve this problem for P systems. One algorithm is non-deterministic and works in 2h + 3 steps, the other is deterministic and works in 3h + 3 steps, where h is the height of the tree describing the membrane structure.
The datacomputer: a network data utility
Authors: Thomas Marill, Dale Stern
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

The Datacomputer is a large-scale data management and storage utility for use by a network of computers. The system is designed to provide facilities for data sharing among dissimilar machines, rapid access to large on-line files, storage economy through shared use of a trillion-bit store, and improved access control.
Interactive Abnormal Condition Sign Discovery for Hydroelectric Power Plants
Authors: Norihiko Ito, Takashi Onoda, Hironobu Yamasaki
Venue: New Frontiers in Applied Data Mining: PAKDD 2008 International Workshops, Osaka, Japan, May 20-23, 2008. Revised Selected Papers (2009)

Kyushu Electric Power Co.,Inc. collects various sensor data and weather information to maintain hydroelectric power plants while the plants are running. However, it is very rare to occur abnormal and trouble condition data in power equipments. And in order to collect the abnormal and trouble condition data, it is hard to construct an experimental hydroelectric power plant. Because its cost is very high. In this situation, we have to find abnormal condition data as a risk management. In this paper, we consider that the abnormal condition sign may be unusual condition data. This paper shows results of unusual condition data of bearing vibration detected from the collected various sensor data and weather information by using one class support vector machine. The result shows that our approach may be useful for unusual condition data detection and maintaining hydroelectric power plants. Therefore, the proposed method is one of risk management for hydroelectric power plants.
Open corpus architecture for personalised ubiquitous e-learning
Authors: Cristina Hava Muntean, Gabriel-Miro Muntean
Venue: Personal and Ubiquitous Computing (2009)

As the e-learning area matures, there are a growing number of e-learning content providers that produce and distribute material that covers a large range of topics, differs in quality and is represented in various formats. Lately, different devices and various network technologies allow extensive user access to educational content almost anywhere, anytime and from any device. Ubiquitous e-learning has the potential to provide continuous and context-based, educational material to human learners anytime, anywhere and on any device. Since each person has different expectations related to the content, the performance of the delivery and display of that content, it is desirable for an ubiquitous e-learning environment to provide user-oriented personalisation of e-learning material. However very often there are multiple sources of e-learning material at various web locations (open corpus resources) that cover the same topic, but differ in terms of quality, formatting and even cost. It is very difficult for learners to select the content that best suits their interests and goals, characteristics of the device used and delivery network as well as their cost budget. This paper proposes an innovative ubiquitous e-learning environment called Performance-based E-learning Adaptive Cost-efficient Open Corpus frameworK (PEACOCK) that provides support for the selection and distribution of personalised e-learning rich media content (e.g. multimedia, pictures, graphics and text) to e-learners such as it will best suit users' interests and goals, meet their formatting preferences and cost constraints, while considering the limitations introduced by the end-user devices and the delivery networks to the user. PEACOCK's main goal is to maximise the users' e-learning experience and increase their learning satisfaction and learning outcome.
Nonlinear Inverse System Self-learning Control Based on Variable Step Size BP Neural Network
Authors: QingRu Li, PeiFeng Wang, LiZhuang Wang
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

The authors present two aspects of the neural network identification and control of nonlinear systems. First, a method of neural network identification learner (NNIL) of the inverse nonlinear system is considered. This enables the investigation of adaptive nonlinear systems based on neural network identification. Second, neural network error controller (NNEC) is constructed simultaneously. The structure of the NNIL and NNEC is the same. The weight matrix of the NNEC is dynamically transferred and updated by NNIL. By this way, the adaptive and self-learning non-model control based on neural network is implemented.This controller is applied to a complex nonlinear system, which includes formidable but realistic nonlinear process. The new method is compared with fuzzy control. The comparison shows the new method has higher effective than that one.
Monitoring and analysing a Grid Middleware Node
Authors: Ramon Nou, Ferran Julia, David Carrera, Kevin Hogan, Jordi Caubet, Jesus Labarta, Jordi Torres
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

Distributed Grid applications are becoming more and more popular as the use of complex grid middlewares becomes extensive, and more facilities are offered by these complex pieces of software. But as Grid middlewares grow and offer more advanced features, they become more complex and weighty, as well as hard to tune. As the performance of a distributed Grid applications can be strongly influenced by the operation of the underlying grid middleware, it becomes importan to study and analyze their behaviour and performance. In this paper we present the eDragon Monitoring Framework (eDMF), a set of tools for instrumentation and analysis of grid middleware, that provides an unique environment to study the performance of Grid applications. The eDMF is composed of a set of specialised monitoring tools as well as a flexible and powerful performance analysis platform. Additionally we also provide a practical application of the eDMF to the Globus Toolkit 4 (GT4), one of the most extended and popular Grid middlewares, showing how it helped us in the detection and resolution of several job management problems observed in the GT4 middleware.
Lexical units for Thai LVCSR
Authors: Markpong Jongtaveesataporn, Issara Thienlikit, Chai Wutiwiwatchai, Sadaoki Furui
Venue: Speech Communication (2009)

Traditional language models rely on lexical units that are defined as entities separated from each other by word boundary markers. Since there are no such boundaries in Thai, alternative definitions of lexical units have to be pursued. The problem is to find the optimal set of lexical units that constitutes the vocabulary of the language model and yields the best final result. The word is a traditional lexical unit recognized by Thai people and is used by most of the natural language processing systems, including an automatic speech recognition system. This paper discusses problems with using words as a lexical unit and investigates other lexical units for the Thai large vocabulary continuous speech recognition (LVCSR) system. The pseudo-morpheme is introduced in the paper and shown to be unsuitable for use as a lexical unit directly. A technique using pseudo-morphemes to improve the system based on the traditional word model is introduced and some improvements can be gained by this technique. Then, a new lexical unit for Thai, the compound pseudo-morpheme, and an algorithm to build compound pseudo-morphemes are presented. The experimental results show that the system using compound pseudo-morphemes outperforms other systems. Thus, the compound pseudo-morpheme is the most suitable lexical unit for Thai LVCSR system.
Semantics and implementation of continuous sliding window queries over data streams
Authors: Jürgen Krämer, Bernhard Seeger
Venue: ACM Transactions on Database Systems (TODS) (2009)

In recent years the processing of continuous queries over potentially infinite data streams has attracted a lot of research attention. We observed that the majority of work addresses individual stream operations and system-related issues rather than the development of a general-purpose basis for stream processing systems. Furthermore, example continuous queries are often formulated in some declarative query language without specifying the underlying semantics precisely enough. To overcome these deficiencies, this article presents a consistent and powerful operator algebra for data streams which ensures that continuous queries have well-defined, deterministic results. In analogy to traditional database systems, we distinguish between a logical and a physical operator algebra. While the logical algebra specifies the semantics of the individual operators in a descriptive but concrete way over temporal multisets, the physical algebra provides efficient implementations in the form of stream-to-stream operators. By adapting and enhancing research from temporal databases to meet the challenging requirements in streaming applications, we are able to carry over the conventional transformation rules from relational databases to stream processing. For this reason, our approach not only makes it possible to express continuous queries with a sound semantics, but also provides a solid foundation for query optimization, one of the major research topics in the stream community. Since this article seamlessly explains the steps from query formulation to query execution, it outlines the innovative features and operational functionality implemented in our state-of-the-art stream processing infrastructure.
A Fast Wavelet Based Low Memory Embedded Block Coding Algorithm
Authors: Wang Wenda, Hao Yanling
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

A fast wavelet based low memory embedded block coding algorithm in image compression is presented in this paper. Several new technical measures are proposed to improve coding efficiency and reduce memory occupancy during the process of coding. The new technical measures include: first, code LLn sub-band separately; second, create block bit-length chart in terms of bit-length defined by the author; third, employ bit-length chart instead of using lists in the process of fining and ranking to reduce memory occupancy; fourth, quick search key blocks according to the structure of bit-length chart to overcome repeat scan and increase coding speed. The experimental results show that the algorithm can reduce memory occupancy during the process of coding and increase the coding speed effectively. Meanwhile, it can keep high PSNR after reconstruction. It makes it possible to implement real time radar image sequences capture, compression and storage in DSP platform.
32-bit floating-point FPGA gaussian elimination
Authors: Bowei Zhang, Guochang Gu, Lin Sun, Yanxia Wu
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

The well-known Gaussian elimination (with partial pivoting) is a widely-used algorithm, one of traditional methods for solving dense linear systems of equations (LSEs). This paper presents a hardware-optimized variant of Gaussian elimination and its 32-bit ANSI/IEEE Std 754-1985 floating-point implementation on a Xilinx Virtex-5 FPGA with highly efficient design. The logic of the traditional algorithm is changed in order to make use of parallelism in hardware. According to this change the proposed hardware architecture can accomplish the solution very fast. Its average running time for n×n 32-bit floating-point matrices with uniformly distributed entries equals around n2(clock cycles) as opposed to n3 in software. Meanwhile, an open source library FPLibrary, which provides parameterizable pipelined floating-point operators, is used in the design. In realization, the design is finally integrated in an developed prototype system to accelerate the general purpose processor's work with the data exchanging through PCI-express between host and FPGA with DMA access method. Furthermore, by means of Strasson's algorithm, large LSEs also can be solved based on multiple FPGAs' co-work. The whole implementation placed and routed in the xc5vlx110t-3 FPGA with the applicability for solving LSE at most dimension 22, can be clocked with a frequency of up to 200MHz and computes the solution in 5.39 ¼s on average, providing a speed-up of up to almost 15 times over an equivalent software implementation on a Pentium IV 2.6GHz CPU. To the best of authors' knowledge, there has been no previous work on floating-point LSEs solving hardware and its implementation used as an application function unit in reconfigurable computing system.
Towards realism in drawing areas of interest on architecture diagrams
Authors: Heorhiy Byelas, Alexandru Telea
Venue: Journal of Visual Languages and Computing (2009)

Areas of interest (AOIs) are defined as groups of elements of system architecture diagrams that share some common property. Visualizing AOIs is a useful addition to plain diagrams, such as UML diagrams. Some methods have been proposed to automatically draw AOIs on UML diagrams. However, it is not clear whether actual users perceive the results of such methods to be better or worse as compared to human-drawn AOI, and what needs to be improved. We present here a process of studying and improving the perceived quality of computer-drawn AOI. For this, we conducted a qualitative evaluation that delivered insight in how users perceive the quality of computer-drawn AOIs as compared to hand-drawn diagrams. Following these results, we derived and implemented several improvements to an existing algorithm for computer-drawn AOIs. Next, we designed a distance metric to quantitatively compare different AOI drawings, and used this metric to show that our improved rendering algorithm creates drawings which are closer to (good) human drawings than the original rendering algorithm. We present here the results of the user evaluation, our improved algorithm for drawing AOIs, and the quantitative analysis performed to compare different drawings. The combined user evaluation, algorithmic improvements, and quantitative comparison method support our claim of having improved the perceived quality and understandability of AOI rendered on architecture diagrams.
Modeling wildland fire propagation with level set methods
Authors: V. Mallet, D. E. Keyes, F. E. Fendell
Venue: Computers Mathematics with Applications (2009)

Level set methods are versatile and extensible techniques for general front tracking problems, including the practically important problem of predicting the advance of a fire front across expanses of surface vegetation. Given a rule, empirical or otherwise, to specify the rate of advance of an infinitesimal segment of fire front arc normal to itself (i.e., given the fire spread rate as a function of known local parameters relating to topography, vegetation, and meteorology), level set methods harness the well developed mathematical machinery of hyperbolic conservation laws on Eulerian grids to evolve the position of the front in time. Topological challenges associated with the swallowing of islands and the merger of fronts are tractable. The principal goals of this paper are to: collect key results from the two largely distinct scientific literatures of level sets and fire spread; demonstrate the practical value of level set methods to wildland fire modeling through numerical experiments; probe and address current limitations; and propose future directions in the simulation of, and the development of, decision-aiding tools to assess countermeasure options for wildland fires. In addition, we introduce a freely available two-dimensional level set code used to produce the numerical results of this paper and designed to be extensible to more complicated configurations.