ppxscal/embedding_network huggingface dataset:
A QoS WMN with mobility support
Authors: Edward Bortnikov, Israel Cidon, Idit Keidar, Tal Kol, Arkady Vaisman
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2008)

We present QMesh, a software package that allows utilizing multiple geographically scattered Windows desktops as a wireless mesh network infrastructure with seamless user mobility support. QMesh supports its users through standard protocols, and does not require any client software installation. We optimize the solution's quality of service (QoS) by providing a centralized management infrastructure, which allows an assignment of users to Internet gateways that balances between distance and load considerations. QMesh is implemented as a Windows XP driver, on top of the Mesh Connectivity Layer (MCL) toolkit from Microsoft Research that provides basic routing capabilities. To the best of our knowledge, this is the first mobile mesh solution implemented within the Win32 kernel space.
An iterative algorithm for a quasivariational inequality system related to HJB equation
Authors: Shuzi Zhou, Zhanyong Zou
Venue: Journal of Computational and Applied Mathematics (2008)

This paper presents a new iterative algorithm for a quasivariational inequality system related to HJB equation. A domain decomposition method based on this algorithm is proposed. The convergence theorems have been established.
Collective Work
Authors: Charles Petrie
Venue: IEEE Internet Computing (2008)

The Internet can help us identify when our efforts conflict with others and when they present opportunities for collaborations that could yield impressive gains. This column examines some science fiction scenarios that show how such functionality could help individuals achieve their goals with ad hoc processes. It also points out some of the substantial engineering and scientific barriers that remain before the great potential can be actualized.
Activity-sensitive flip-flop and latch selection for reduced energy
Authors: Seongmoo Heo, Ronny Krashinsky, Krste Asanovic
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

This paper presents new techniques to evaluate the energy and delay of flip-flop and latch designs and shows that no single existing design performs well across the wide range of operating regimes present in complex systems. We propose the use of a selection of flip-flop and latch designs, each tuned for different activation patterns and speed requirements. We illustrate our technique on a pipelined MIPS processor datapath running SPECint95 benchmarks, where we reduce total flip-flop and latch energy by over 60% without increasing cycle time.
Adaptive Automatic Segmentation of HEp-2 Cells in Indirect Immunofluorescence Images
Authors: Yu-Len Huang, Yu-Lang Jao, Tsu-Yi Hsieh, Chia-Wei Chung
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

Indirect immunofluorescence (IIF) with HEp-2 cells is used for the detection of antinuclear autoantibodies (ANA) in systemic autoimmune diseases. An automatic inspection system for ANA testing can be divided into HEp-2 cell detection, fluorescence pattern classification and computer aided diagnosis phases. This study focused on the first phase of cell detecting and locating. This study presented an adaptive edged-based segmentation method for automatically detecting outlines of fluorescence cells in IIF images. The proposed method evaluated 2573 cells with six distinct fluorescence patterns from 45 images. The results of computer simulations revealed that the proposed method always identified cell outlines as were obtained by manual sketched. Such a method provides robust and fast automatic segmentation of HEp-2 fluorescent patterns in ANA testing.
Toward incorporating a task-stage identification technique into the long-term document support process
Authors: I-Chin Wu, Duen-Ren Liu, Pei-Cheng Chang
Venue: Information Processing and Management: an International Journal (2008)

Effective knowledge management in a knowledge-intensive environment can place heavy demands on the information filtering (IF) strategies used to model workers' long-term task-needs. Because of the growing complexity of knowledge-intensive work tasks, a profiling technique is needed to deliver task-relevant documents to workers. In this study, we propose an IF technique with task-stage identification that provides effective codification-based support throughout the execution of a task. Task-needs pattern similarity analysis based on a correlation value is used to identify a worker's task-stage (the pre-focus, focus formulation, or post-focus task-stage). The identified task-stage is then incorporated into a profile adaptation process to generate the worker's current task profile. The results of a pilot study conducted in a research institute confirm that there is a low or negative correlation between search sessions and transactions in the pre-focus task-stage, whereas there is at least a moderate correlation between search sessions/transactions in the post-focus stage. Compared with the traditional IF technique, the proposed IF technique with task-stage identification achieves, on average, a 19.49% improvement in task-relevant document support. The results confirm the effectiveness of the proposed method for knowledge-intensive work tasks.
Preconditioning and convergence in the right norm
Authors: Andy Wathen
Venue: International Journal of Computer Mathematics (2007)

The convergence of numerical approximations to the solutions of differential equations is a key aspect of numerical analysis and scientific computing. Iterative solution methods for the systems of linear(ized) equations which often result are also underpinned by analyses of convergence. In the function space setting, it is widely appreciated that there are appropriate ways in which to assess convergence and it is well-known that different norms are not equivalent. In the finite dimensional linear algebra setting, however, all norms are equivalent and little attention is often paid to the norms used. In this paper, we highlight this consideration in the context of preconditioning for minimum residual methods (MINRES and GMRES/GCR/ORTHOMIN) and argue that even in the linear algebra setting there is a 'right' norm in which to consider convergence: stopping an iteration which is rapidly converging in an irrelevant or highly scaled norm at some tolerance level may still give a poor answer.
Dynamic Web Service Composition: A New Approach in Building Reliable Web Service
Authors: Pat Pik Wah Chan, Michael R. Lyu
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

The use of services, especially Web services, became a common practice. In Web services, standard communication protocols and simple broker-request architectures are needed to facilitate exchange of services, and this standardization simplifies interoperability. In the coming few years, services are expected to dominate software industry. There are increasing amount of Web services being made available in the Internet, and an efficient Web services composition algorithm would help to integrate different algorithm together to provide a variety of services. In this paper, we provide a dynamic Web service composition algorithm with verification of Petri-Nets. Each Web service is described by Web Service Definition Language (WSDL) and their interactions withother services are described by Web Service Choreography Interface (WSCI). Our algorithm compose the Web services with the information provided by these two descriptions. After the composition, we verify the Web service to be deadlock free with modeling the Web service as a Petri-Net. We conduct a series of experiments to evaluate the correctness and performance of the composed Web service.
Modelling Spirituality, Wellness and Quality of Life: A Study in Redang and Perhentian Islands
Authors: Mahadzirah Mohamad, Borhanudin Mohd Yusof, Morliyati Mohammad, Abdul Manan Ali
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

This paper reports findings of a study that was conducted to effect two major objectives. Firstly, to ascertain the criteria or factors that measure Quality of Life (QOL) from the perspectives of Perhentian and Redang island communities. Secondly, to test a hypothesised proposed model that illustrates the relationships between Spirituality, Wellness and QOL. Factor analysis was performed to determine the underlying factors of Spirituality, Wellness and QOL before proceeding to applying Structural Equation Modelling (SEM), using AMOS 7 to the data set. The findings of the study suggest that the hypothesised model fits the sample data adequately. In addition, the findings of the study supported two hypotheses proposed in the study. Firstly, there is a direct relationship between Spirituality and Wellness and, secondly, there is a direct relationship between Wellness and QOL. However, the study failed to support the third hypothesis that asserts there is a direct relationship between Spirituality and QOL. The implications of the study suggest that community’s QOL can be improved by enhancing the community’s different aspect of wellness which is turn is influenced by its spirituality level. In addition, factors termed as Employment and Family Bond are crucial to improve QOL.
Neuromazes: 3-dimensional spiketrain processors
Authors: Andrzej Buller, Michal Joachimczak, Juan Liu, Adam Stefanski
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

Neuromazes are pulsed neural networks synthesized in a 3-dimensional cellular space. They are being developed for the artificial brains of future generation robots. In neuromazes there are two processing elements: dendrite-cells that return a pulse at clock t if one and only one pulse entered it at clock t-1 and threshold-cells that return a pulse at clock t if its counter was 2 or more at clock t-1. At every clock t the weighted sum of pulses that entered the threshold-cell at clock t-1 is added to the discharged or not discharged counter. The weights can be -1 or 0 or 1. Every cell receives pulses from k defined neighbors and sends pulses to up to 6-k defined neighbors (k≤6). We present NeuroMaze™ 3.0 Pro--a software tool for rapid prototyping of neuromaze-based modules for artificial brains. Some related designs are presented here.
Algebraic computations and applications to geometry (abstract only)
Authors: Elias P. Tsigaridas
Venue: ACM Communications in Computer Algebra (2008)

Real algebraic numbers are the real numbers that are real roots of univariate polynomials with integer coefficients. We study exact algorithms, from a theoretical and an implementation point of view, based on integer arithmetic of arbitrary precision, for computations with real algebraic numbers and applications of these algorithms on problems and algorithms in non linear computational geometry. In order to construct a real algebraic number we must compute the real roots of a univariate polynomial with integer cofficients. We unify and simplify the theory behind the subdivision based algorithms for real root isolation and we improve the complexity of the algorithm that is based on the continued fraction expansion of the real numbers. The best known complexity bound up today is achieved using new techniques. Moreover, we prove that the bound holds for non square-free polynomials and that in the same complexity bound we can compute the multiplicities of the real roots. We prove a new bound for the expected complexity of the algorithm based on continued fractions. We generalize the real root isolation algorithms to bivariate polynomial systems. Our experimental analysis proves the effectiveness of our methods. The algorithms that we consider for computations with real algebraic numbers are construction, comparison, sign evaluation and quantifier elimination. If the degree of the polynomial is small, i.e. ≤ 4 in the univariate case and ≤ 2 in the bivariate case, we propose special purpose algorithms that have constant arithmetic complexity. For all the algorithms we present a C++ implementation and an experimental analysis. In computational geometry we study the predicates needed by the algorithms for the arrangement of elliptic arcs in the plane and the computation of the Voronoi diagram of ellipses, also in the plane. Finally, given a convex lattice polygon we study algorithms for decomposing it to two other convex lattice polygons, such that their Minkowski sum is the original polygon.
Requirements Elicitation Using Goal-Based Organizational Model
Authors: Aneesh Krishna, He Lu
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Domain knowledge is crucial for the quality of requirements. The systems analysts, who have adequate knowledge of software often don’t understand the organizational context well. The Tropos methodology proposes a set of concepts, which are effective in capturing the organizational context, the interactions between the software system and the human agents. Based on the Tropos methodology, Software System-Business Model (SS-BM), which integrates the Software System Actor (SSA) fromearly requirements organizational model has been proposed.In this paper, a methodological approach of applying the SS-BM to requirements list elicitation is presented. In the proposed method, requirements items were mapped to SS-BM elements based on their semantic meanings. The mapped requirements list and SS-BM were analyzed in a specific sequence according to multiple checking points. The problems of requirements list were identified in the analysis process. For each kind of problem identified a possible improvement is proposed. Quality indicators were used to summarize the quality of requirements at the end of the elicitation process.
An adaptive reservation time division multiple access control protocol for robot inter-communication
Authors: Junpei Arai, Akio Koyama, Leonard Barolli
Venue: International Journal of Wireless and Mobile Computing (2008)

In autonomous distributed robot systems, many robots cooperate together to carry out many difficult tasks that single robots cannot realise. But, in order to cooperate together the robots should communicate with each other. Therefore, the inter-communication among robots is a very important problem to be solved. In this paper, we propose an Adaptive Reservation-Time Division Multiple Access (AR-TDMA) medium access control protocol which can realise a real-time communication among robots in a heterogeneous environment by using a reservation mechanism. Also, by using an adaptive time slot allocation method, the protocol has a flexible behaviour and can deal with the changes of number of robots. Furthermore, the proposed protocol can reduce the packet collision probability.
Moment Invariants Based Human Mistrustful and Suspicious Motion Detection, Recognition and Classification
Authors: Hashim Yasin, Shoab Ahmad Khan
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

In this paper, we present human mistrustful motion detection & classification using Hu Moment Invariants feature descriptions. A new method for recognition & classification that is Moment Invariant based Classifier (MIBC) has been proposed. The basis of the MIBC is the different seven φ values of Hu Moment Invariants itself and the Euclidean Distance measure between these φ values of all image frames of each type of motion. These values of Moment Invariants and Euclidean Distances are compared with other values and Euclidean Distances of all image frames of different or same type of motion. The performance of MIBC is evaluated with other types of methodologies & classifiers like Mahalanobis Distance (MD) classifier, Linear Bayes Gaussian (LBG) classifier, Quadratic Bayes Gaussian (QBG) classifier and Fuzzy K-Nearest Neighbor (FKNN) classifier using temporal template motion detection technique. The performance evaluation is done in the context of accuracy, time and speed. Experiments are conducted on five types of suspicious motions: Bending down, Gun Shot, Jumping up, Kicking front and Punching forward.
Chromatic-index critical multigraphs of order 20
Authors: Stefan Grünewald
Venue: Journal of Graph Theory (2000)

A multigraph M with maximum degree &Delta;(M) is called critical, if the chromatic index &chi;2(M) > &Delta;(M) and &chi;2(M - e) = &chi;2(M) - 1 for each edge e of M. The weak critical graph conjecture [1, 7] claims that there exists a constant c > 0 such that every critical multigraph M with at most c &middot; &Delta;(M) vertices has odd order. We disprove this conjecture by constructing critical multigraphs of order 20 with maximum degree k for all k e 5. &copy; 2000 John Wiley Sons, Inc. J Graph Theory 33: 240245, 2000
Dielectric properties and ac electrical conductivity studies of MIS type Schottky diodes at high temperatures
Authors: A. Tataroğlu, İ. Yücedağ, Ş. Altindal
Venue: Microelectronic Engineering (2008)

Dielectric properties and ac electrical conductivity of the Al/SiO"2/p-Si (MIS) Schottky diodes were studied in the frequency and temperature range of 10kHz-1MHz and 300-400K, respectively. Experimental results show that the dielectric constant (@e'), dielectric loss (@e''), loss tangent (tan@d), ac electrical conductivity (@s"a"c) and the electric modulus were found a strong function of frequency and temperature. The values of the @e', @e'' and tan@d decrease with increasing frequencies due to the interface states capacitance and a decrease in conductance with increasing frequency. Also, these values increase with increasing temperature. The @s"a"c is found to increase with increasing frequency and increasing temperature. The variation of conductivity as a function of temperature and frequency reveals non-adiabatic hopping of charge carriers between impurities localized states. In addition, the experimental dielectric data have been analyzed by considering electric modulus formalism.
Classifying EEG for brain-computer interface: learning optimal filters for dynamical system features
Authors: Le Song, Julien Epps
Venue: Computational Intelligence and Neuroscience (2007)

Classification of multichannel EEG recordings during motor imagination has been exploited successfully for brain-computer interfaces (BCI). In this paper, we consider EEG signals as the outputs of a networked dynamical system (the cortex), and exploit synchronization features from the dynamical system for classification. Herein, we also propose a new framework for learning optimal filters automatically from the data, by employing a Fisher ratio criterion. Experimental evaluations comparing the proposed dynamical system features with the CSP and the AR features reveal their competitive performance during classification. Results also show the benefits of employing the spatial and the temporal filters optimized using the proposed learning approach.
A study of differentiation errors in large-eddy simulations based on the EDQNM theory
Authors: J. Berland, C. Bogey, C. Bailly
Venue: Journal of Computational Physics (2008)

This paper is concerned with the investigation of numerical errors in large-eddy simulations by means of two-point turbulence modeling. Based on the eddy-damped quasi-normal Markovian (EDQNM) theory, a stochastic model is developed in order to predict the time evolution of the kinetic energy spectrum obtained by a large-eddy simulation (LES), including the effects of the numerics. Using this framework, the influence of the accuracy of the approximate space differencing schemes on LES quality is studied, for decaying homogeneous isotropic incompressible turbulence, with Reynolds numbers Re"@l based on the transverse Taylor scale equal to 780, 2500 and 8000. The results show that the discretization of the filtered Navier-Stokes equations leads to differentiation and aliasing errors. Error spectra are also presented, and indicate that the numerical errors are mainly originating from the approximate differentiation. In addition, increasing the order of accuracy of the differencing schemes or using algorithms optimized in the Fourier space is found to widen the range of well-resolved scales. Unfortunately, for all the schemes, the smaller scales with wavenumbers close to the grid cut-off wavenumber, are badly calculated and generate differentiation errors over the whole energy spectrum. The eventual use of explicit filtering to remove spurious motions with short wavelength is finally shown to significantly improve LES accuracy.
Challenges of Timing Verification Tools in the Automotive Domain
Authors: Pascal Montag, Steffen Görzig, Paul Levi
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

Every embedded real-time system is inevitably time-restricted. Therefore, worst-case execution times (WCETs) have to be known. The static timing analysis of embedded software promises the calculation of safe upper time bounds. We present the results of a case study which reveal the special challenges of this methodology in the automotive domain. For most of the encountered problems we describe our solutions or propose possible methods for a solution.
The benefits and challenges of executable acceptance testing
Authors: Shelly S. Park, Frank Maurer
Venue: Proceedings of the 2008 international workshop on Scrutinizing agile practices or shoot-out at the agile corral (2008)

In this paper, we argue that executable acceptance test driven development (EATDD) allows tighter integration between the software requirements and the implementation. We argue that EATDD improves communication between all project stakeholders. We give an overview of why previous approaches to requirements specifications are less than impressive and how executable acceptance tests help fix problems. In addition, we argue for multi-modal executable acceptance tests and how it can help improve the requirements specification. We provide some of the immediate research questions that need to be addressed in order to push forward more wide-spread use of executable acceptance test driven development.
Identifying Causal Effects from Data for the Clinical Ventilation Process Modelling
Authors: Bin Han, Guoliang Li, Tzeyun Leong, Yanchun Zhang, Lihu Li, Wei Liu, Lei Zhu, Weidong Xu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Proper modeling of the ventilation process is crucial to the effective operation of computerized ventilator management systems. We aim to develop a ventilation modeling technique, which depends less on lung dynamics assumptions, is able to describe the ventilation process quantitatively, and includes only clinically available parameters. We propose a Granger-causality based technique to identify causal relationships among ventilation variables, as the structural constraints typically provided by the subjective theory, controlled experiments or directed acyclic graphs (DAGs) are not available. We examine the performance of the proposed modeling methodology from different perspectives with real data. Domain knowledge confirmed and experiments show that the model out performs the VectorAutoregression (VAR) and Neural Network methods. The proposed method provides initial insights into the databased ventilation process modeling.