ppxscal/embedding_network huggingface dataset:
2008 Special Issue: Teleoperation for a ball-catching task with significant dynamics
Authors: Christian Smith, Mattias Bratt, Henrik I. Christensen
Venue: Neural Networks (2008)

In this paper we present ongoing work on how to incorporate human motion models into the design of a high performance teleoperation platform. A short description of human motion models used for ball-catching is followed by a more detailed study of a teleoperation platform on which to conduct experiments. Also, a pilot study using minimum jerk theory to explain user input behavior in teleoperated catching is presented.
Economic Perspectives on the History of the Computer Time-Sharing Industry, 1965-1985
Authors: Martin Campbell-Kelly, Daniel D. Garcia-Swartz
Venue: IEEE Annals of the History of Computing (2008)

The history of the computer time-sharing industry is one of the unwritten chapters in the overall history of computing. In this article, we show that the time-sharing industry constituted a major sector of the computer services industry until the early 1980s, when time-sharing was made obsolescent by the personal computer.
Parallel scalability study of hybrid preconditioners in three dimensions
Authors: L. Giraud, A. Haidar, L. T. Watson
Venue: Parallel Computing (2008)

In this paper we study the parallel scalability of variants of additive Schwarz preconditioners for three dimensional non-overlapping domain decomposition methods. To alleviate the computational cost, both in terms of memory and floating-point complexity, we investigate variants based on a sparse approximation or on mixed 32- and 64-bit calculation. The robustness of the preconditioners is illustrated on a set of linear systems arising from the finite element discretization of elliptic PDEs through extensive parallel experiments on up to 1000 processors. Their efficiency from a numerical and parallel performance view point are studied.
Layered critical values: a powerful direct-adjustment approach to discovering significant patterns
Authors: Geoffrey I. Webb
Venue: Machine Learning (2008)

Standard pattern discovery techniques, such as association rules, suffer an extreme risk of finding very large numbers of spurious patterns for many knowledge discovery tasks. The direct-adjustment approach to controlling this risk applies a statistical test during the discovery process, using a critical value adjusted to take account of the size of the search space. However, a problem with the direct-adjustment strategy is that it may discard numerous true patterns. This paper investigates the assignment of different critical values to different areas of the search space as an approach to alleviating this problem, using a variant of a technique originally developed for other purposes. This approach is shown to be effective at increasing the number of discoveries while still maintaining strict control over the risk of false discoveries.
Complex Event Processing in EPC Sensor Network Middleware for Both RFID and WSN
Authors: Weixin Wang, Jongwoo Sung, Daeyoung Kim
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

In an integration system of RFID and wireless sensor network (WSN), RFID is used to identify objects while WSN can provide context environment information of these objects. Thus, it increases system intelligent in pervasive computing. We propose the EPC Sensor Network (ESN) architecture as an integration system of RFID and WSN. This ESN architecture is based on EPCglobal architecture, the de facto international standard for RFID. The core of ESN is the middleware part which is also implemented in our work. In this paper, complex event processing (CEP) technology is used in our ESN middleware which can handle large volume of events from distributed RFID and sensor readers in real time. Through filtering, grouping, aggregating and constructing complex event, ESN middleware provides a more meaningful report for the clients and increases system automation.
Semantic-based Web Service Matchmaking Algorithm in Biomedicine
Authors: Wenjie Li, Wenjing Guo
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Web service matchmaking is an important aspect of the Web service discovery, and some efficient matching algorithms of matchmaking services are required in a dynamic biomedical environment especially. The main shortcoming of the current approaches of publishing and discovering Web service in biomedical informatics, which are basing on WSDL and UDDI, is that lacking of much flexibility and expressiveness in the service descriptions. Hence the algorithm for Web service matchmaking based on semantic is proposed in this paper, in which Web services are described and advertised by OWL-S, and experimental results indicates the matchmaking degree is improved between different parameters of Web service description and capability of users’ requirements, which can provide better service choice for the users.
PECB: prediction of enzyme catalytic residues based on Naive Bayes classification
Authors: Kunpeng Zhang, Yun Xu, Guoliang Chen
Venue: International Journal of Bioinformatics Research and Applications (2008)

In the post-genome era, huge numbers of protein structures accumulate, but little is known about their function. It is time consuming and labour intensive to investigate them, e.g., enzyme catalytic properties, through in vivo or in vitro work. So in silico predictions could be a promising strategy to greatly shrink the list of potential targets. This work incorporated both structural and physico-chemical information into a Naive Bayes classification system, and gained much better performance. The ten-fold cross validation results of this method could reach 88.6% of sensitivity and 93.7% of specificity. The improvement of prediction accuracy is detailed in this paper. The PECB is also applied to predict other important sites.
Security metrics for source code structures
Authors: Istehad Chowdhury, Brian Chan, Mohammad Zulkernine
Venue: Proceedings of the fourth international workshop on Software engineering for secure systems (2008)

Software security metrics are measurements to assess security related imperfections (or perfections) introduced during software development. A number of security metrics have been proposed. However, all the perspectives of a software system have not been provided specific attention. While most security metrics evaluate software from a system-level perspective, it can also be useful to analyze defects at a lower level, i.e., at the source code level. To address this issue, we propose some code-level security metrics which can be used to suggest the level of security of a code segment. We provide guidelines about where and how these metrics can be used to improve source code structures. We have also conducted two case studies to demonstrate the applicability of the proposed metrics.
Segmentation of the Left Ventricle from Cardiac MR Images Based on Radial GVF Snake
Authors: Jia Liang, Gangyi Ding, Yuwei Wu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Segmentation of the left ventricle (LV) is a hot topic in cardiac magnetic resonance (MR) images analysis and still remains challenging. In this paper, we propose a novel method, radial gradient vector flow (GVF) snake, to segment LV automatically. Left ventricle centroid and region of interest (ROI) are located using temporal intensity difference along with Hough transform. Taking the centroid as an origin, the ROI could be transformed into polar coordinates where myocardium looks more like a horizontal band rather than a circle. This shape characteristic enables snake to evolve towards 1D radial direction instead of 2D image plane, which simplifies snake energy functions to 1D. A line-like shape constraint is adopted to conquer papillary muscle and weak boundaries. After endocardium extraction, GVF external force modified skillfully reactivates snake forward to epicardial contour successively. Several experiments are presented to demonstrate the effectiveness and robustness of the proposed method.
Microcontrollers and modern control methods
Authors: Vladimír Vašek, Petr Dostálek, Jan Dolinay, Dagmar Janáčová, Karel Kolomazník
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

The aim of this paper is to present overview of the microcontrollers which are usable for the controllers based on the modern control algorithms. In this paper are described necessities of the self tuning controllers. In our applications, we are focused to the microcontrollers Motorola and National Semiconductor that are commonly used for process control. Microcontrollers were divided into two categories: 8-bit and 16-bit. In the part of the work dedicated to 8-bit microcontrollers, the properties of M68HC08 (Motorola) and COP8 (National Semiconductor) are described. The part, which deals with 16-bit microcontrollers, contains description of M68HC16 (Motorola) and CR16 (National Semiconductor). Finally has been evaluated CPU performance of selected microcontrollers in clock cycles needed for factorial computation.
Revisiting the Hidden Terminal Problem in a CSMA/CA Wireless Network
Authors: Athanasia Tsertou, David I. Laurenson
Venue: IEEE Transactions on Mobile Computing (2008)

Recently research interest in the performance analysis of wireless networks was revived. An issue of an utmost importance in this class of networks, classified as one of the severest reasons for the degradation of their performance, is the hidden terminal problem. In this paper we argue that an accurate analysis of the effect of hidden nodes in the performance of a random access protocol is still an open issue. Firstly, we thoroughly explain the reasons behind the limitations of previous modelling methods, and show that their performance is reliable only for certain configurations. Secondly, and most importantly, we propose a novel method of modelling time that uses a fixed-length channel slot as the unit of time and does not rely on renewal theory. With these features the model is able to successfully take into account the desynchronisation of nodes in a hidden terminal environment. Our analytical model is shown to have a very close match to simulation results for an IEEE 802.11 MAC protocol and for all the system parameters considered, unlike conventional methods.
Priority Encoding Transmission Based Multiple Description Video Coding over Packet Loss Network
Authors: Huihui Bai, Yao Zhao, Ce Zhu
Venue: Proceedings of the Data Compression Conference (2008)

In this paper, an effective scheme of multiple description video coding is proposed for transmission over packet loss network. Using priority encoding transmission, we attempt to overcome the limitation of specific scalable video codec and apply FEC-based multiple description to a common video coder, such as the standard H.264. According to different motion characteristics between frames, an original video sequence is divided into several sub-sequences as messages, so in each message better temporal correlation can be maintained for better estimation when information losses occur. Based on priority encoding transmission, unequal protections are assigned in each message. Furthermore, the priority is designed in view of packet loss rate of channels and the significance of bit streams. Experimental results validate the effectiveness of the proposed scheme with better performance than the equal protection scheme.
A study on eyelid localization considering image focus for iris recognition
Authors: Young Kyoon Jang, Byung Jun Kang, Kang Ryoung Park
Venue: Pattern Recognition Letters (2008)

This paper proposes a robust detection algorithm that can be used to detect eyelid region for iris recognition. This research has the following four advantages and contributions compared to the previous works. First, we interpolate the detected eyelashes and specular reflections, which enable us to determine a more accurate searching area of eyelid. Second, we are able to define a limited eyelid searching area by finding the cross position between the eyelids and the outer boundary of the irises. Third, by using eyelid detection mask considering focus value, we can enhance the eyelid detection performance even in the case of defocused iris image. Fourth, by applying the rotation term into the parabolic Hough transform which fits the detected eyelid candidate points, we can detect the accurate eyelid position even in the case of rotated eye. As the experimental results show, the detection accuracy rates were 91.33% and 98.45% when detecting the upper and lower eyelids, respectively.
Software Maintenance Management: Evaluation and Continuous Improvement (Practitioners)
Authors: Alain April, Alain Abran
Venue:  (2008)

In most software organizations, the budget for software maintenance is much larger than for software development. However, there is much less management attention focus on software maintenance than on software development. This book illustrates how process improvement models popular with software development can be applied to software maintainers. In particular, this book presents a new way of capturing the uniqueness of software maintenance activities in a model-based process improvement approach. The focus of this book is, therefore, on the uniqueness of software maintenance activities, on how to assess the software maintenance using the Software Maintenance Maturity Model (S3m model) and how to figure out improvement paths.
A short-message robust steganographic method for effective information recovery under transmission losses of cellular networks
Authors: Klimis S. Ntalianis
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

In this paper a wavelet-based steganographic method is proposed for robust short-message hiding. The message is embedded into the most significant wavelet coefficients of a cover image to provide invisibility and resistance against lossy transmission over cellular networks, compression or other distortion. The architecture consists of three modules. In the first module the initial message is enciphered by an encryption algorithm. The enciphered message is imprinted onto a white-background image to construct the message-image to be hidden. In the second module the cover image is decomposed into two levels with seven subbands, using the DWT. Next Qualified Significant Wavelet Trees (QSWTs), which are paths of significant wavelet coefficients, are estimated for the highest energy pair of subbands. During the third module the message-image is redundantly embedded to the coefficients of the best QSWTs and the IDWT is applied to provide the stego-image. The robustness and efficiency of the proposed steganographic system is evaluated under various loss rates, combined with different JPEG compression ratios.
QDSL: a queuing model for systems with differential service levels
Authors: Shiva Chaitanya, Bhuvan Urgaonkar, Anand Sivasubramaniam
Venue: ACM SIGMETRICS Performance Evaluation Review (2008)

A feature exhibited by many modern computing systems is their ability to improve the quality of output they generate for a given input by spending more computing resources on processing it. Often this improvement comes at the price of degraded performance in the form of reduced throughput or increased response time. We formulate QDSL, a class of constrained optimization problems defined in the context of a queueing server equipped with multiple levels of service. Solutions to QDSL provide rules for dynamically varying the service level to achieve desired trade-offs between output quality and performance. Our approach involves reducing restricted versions of such systems to Markov Decision Processes. We find two variants of such systems worth studying: (i) VarSL, in which a single request may be serviced using a combination of multiple levels during its lifetime and (ii) FixSL in which the service level may not change during the lifetime of a request. Our modeling indicates that optimal service level selection policies in these systems correspond to very simple rules that can be implemented very efficiently in realistic, online systems. We find our policies to be useful in two response-time-sensitive real-world systems: (i) qSecStore, an iSCSI-based secure storage system that has access to multiple encryption functions, and (ii) qPowServer, a server with DVFS-capable processor. As a representative result, in an instance of qSecStore serving disk requests derived from the well-regarded TPC-H traces, we are able to improve the fraction of requests using more reliable encryption functions by 40-60%, while meeting performance targets. In a simulation of qPowServer employing realistic DVFS parameters, we are able to improve response times significantly while only violating specified server-wide power budgets by less than 5W.
Adaptive geometry compression based on four-point interpolatory subdivision schemes with labels
Authors: Hui Zhang, Jun-Hai Yong, Jean-Claude Paul
Venue: International Journal of Computer Mathematics (2007)

We propose an adaptive geometry compression method with labels based on four-point interpolatory subdivision schemes. It can work on digital curves of arbitrary dimensions. With the geometry compression method, a digital curve is adaptively compressed into several segments with different compression levels. Each segment is a four-point subdivision curve with a subdivision step. Labels are recorded in data compression to facilitate merging the segments in data decompression. We provide high-speed four-point interpolatory subdivision curve generation methods for efficiently decompressing the compressed data. For an arbitrary positive integer k, formulae for the number of resultant control points of a four-point subdivision curve after k subdivision steps are provided. Some formulae for calculating points at the kth subdivision step are also presented. The time complexity of the new approaches is O(n), where n is the number of points in the given digital curve. Examples are provided to illustrate the efficiency of the proposed approaches.
Workshop on testing, analysis and verification of web software (TAV-WEB 2008)
Authors: Tevfik Bultan, Tao Xie
Venue: Proceedings of the 2008 international symposium on Software testing and analysis (2008)

TAV-WEB 2008 is the third in a series of workshops that focus on testing, analysis and verification of web software. The goal of these workshops has been to bring together researchers from academic, research, and industrial communities interested in the emerging area of dependable Web software development, to present and discuss their recent research results.
Using Ontologies and Vocabularies for Dynamic Linking
Authors: Sean Bechhofer, Yeliz Yesilada, Robert Stevens, Simon Jupp, Bernard Horan
Venue: IEEE Internet Computing (2008)

Ontology-based linking offers a solution to some of the problems with static, restricted, and inflexible traditional Web linking. Conceptual hypermedia provides navigation between Web resources, supported by a conceptual model, in which an ontology's definitions and structure, together with the lexical labels, drive the consistency of link provision and the linking's dynamic aspects. Lightweight standard representations make it possible to use existing vocabularies to support Web navigation and browsing. In this way, the navigation and linking of diverse resources (including those not in our control) based on a community understanding of the domain can be consistently managed.
Finite-memory automata
Authors: M. Kaminski, N. Francez
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

A model of computation dealing with infinite alphabets is proposed. The model is based on replacing the equality test by unification. It appears to be a natural generalization of the classical Rabin-Scott finite-state automata and possesses many of their properties.
Development of a DICOM server for the reception and storage of medical images in digital format
Authors: Francisco J. Novoa, Antonio F. Castro, Javier Pereira, Alejandro Pazos
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

Recent progress in digital medical imaging has ineluctably created a need for efficient management, for a mechanism that is able to gather and store all the modalities of medical images, regardless of the device that generated them. The DICOM standard defines a protocol for the communication between such devices. This article presents a software server that communicates with DICOM compatible machines and stores their studies. It has been validated and tested in real environments.
Collaborative Interpretative Service Assisted Design System Based on Hierarchical Case Based Approach
Authors: Huan-Yu Lin, Shian-Shyong Tseng, Jui-Feng Weng, Jun-Ming Su
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

Museum is the important learning environment, which assists learners to learn directly from objects and living, and its interpretative services play an important role in museums to help learners learn more about the exhibitions. However, the development of intelligent interpretative services is costly, time consuming, and needs many kinds of domain knowledge. How to provide a platform to help experts of different domain work collaboratively to reduce the construction cost of designing an intelligent interpretative service for new requirements is an important issue. Thus, we propose a Collaborative Interpretative Service Assisted Design System (CISAD), containing Requirement Integration Process to assist designers to collaboratively determine the requirements of the new service, and Intelligent Query Processor to reuse previous successful application from coarse-grained to fine-grained to improve the reliability and reduce the construction cost of the solution application. Finally, we show an example to describe the construction process of an interpretative service for elder people by CISAD.
Standardising the lift of an association rule
Authors: P. D. McNicholas, T. B. Murphy, M. O'Regan
Venue: Computational Statistics Data Analysis (2008)

The lift of an association rule is frequently used, both in itself and as a component in formulae, to gauge the interestingness of a rule. The range of values that lift may take is used to standardise lift so that it is more effective as a measure of interestingness. This standardisation is extended to account for minimum support and confidence thresholds. A method of visualising standardised lift, through the relationship between lift and its upper and lower bounds, is proposed. The application of standardised lift as a measure of interestingness is demonstrated on college application data and social questionnaire data. In the latter case, negations are introduced into the mining paradigm and an argument for this inclusion is put forward. This argument includes a quantification of the number of extra rules that arise when negations are considered.
Uniqueness in the generalized representation by fuzzy sets
Authors: Fathi B. Saidi, Ali Jaballah
Venue: Fuzzy Sets and Systems (2008)

The concept of representation of a given family of sets by a fuzzy set in such a way that the level sets of the fuzzy set are precisely the given sets is widely used in the literature for the classification and study of fuzzy algebraic structures on the same underlying set. The problem of existence of such fuzzy sets was investigated by various authors. As far as we know, the problem of uniqueness of such fuzzy sets was not studied before. We establish, among other things, necessary and sufficient conditions under which uniqueness is guaranteed in the cases of complete as well as partial representations of the level sets of the fuzzy set.