ppxscal/embedding_network huggingface dataset:
Automation of parallel programming in modeling of multiphase media. Optimal parallelization
Authors: V. V. Pekunov
Venue: Automation and Remote Control (2008)

A flexible approach to automation of parallel programming of the problems of mechanics of the multiphase media was proposed. It is based on the object-event model of program generation. The model structure was described. The principles of interpretation and the technology of model translation into the program code were formulated. For solution of the aforementioned mechanical problems with spatial parallelization, strategies of reduction and optimization of data exchange were proposed. Part of exchanges was eliminated owing to periodic extrapolation. The least squares method with adjustable weight coefficients in the objective function was used. For optimization of the rest of exchanges, a special problem of nonlinear Boolean optimization was solved.
A weighted least squares method for scattered data fitting
Authors: Tianhe Zhou, Danfu Han
Venue: Journal of Computational and Applied Mathematics (2008)

In this paper, we present a weighted least squares method to fit scattered data with noise. Existence and uniqueness of a solution are proved and an error bound is derived. The numerical experiments illustrate that our weighted least squares method has better performance than the traditional least squares method in case of noisy data.
Heuristic algorithms for two machine re-entrant flow shop
Authors: Caixia Jing, Guochun Tang, Xingsan Qian
Venue: Theoretical Computer Science (2008)

This paper focuses on a two machine re-entrant flow shop scheduling problem with the objective of minimizing makespan. In the re-entrant flow shop considered here, each job has the processing route (M"1, M"2, M"1, M"2, ..., M"1, M"2). We present heuristic algorithms, some are modified from existing algorithms and some are newly developed. Extensive computational experiments are performed to evaluate the performance of the heuristics. Results of the experiments show that the performance of heuristics is significantly affected by the distribution of workloads on machines and some of them are excellent.
FESORIA: An integrated system for analysis, management and smart presentation of audio/video streaming services
Authors: Xabiel García Pañeda, David Melendi, Manuel Vilas, Roberto García, Víctor García, Isabel Rodríguez
Venue: Multimedia Tools and Applications (2008)

Due to the elevated consumption of resources, the high cost of the production of contents and the quality of service required in audio/video streaming services, it is extremely important to optimize all the elements involved in the deployment of these services. With this goal in mind, provider companies have developed their management and presentation tools. At the same time, some specific tools for audio/video streaming analysis have appeared. Data are collected from servers and proxies by analyzing their log files in order to generate different types of reports. In spite of their utility, there is a disconnection between these types of tools. In this way, several important relationships between collected data are lost and the influence of other important aspects such as the behaviour of the users and their relationship with the subject or the length of the contents is not considered. This generates inaccurate analyses and the impossibility to improve the presentation, for example by generating recommendations using the information gathered from the analysis tool. Fesoria is a system which combines both characteristics. It is an analysis tool and, at the same time, a system to manage the whole audio/video service. Fesoria is able to process the logs gathered from the streaming servers and proxies, and combine the extracted information with other types of data, such as content metadata, content distribution networks architecture, user preferences, etc. All this information is analyzed in order to generate reports on service performance, access evolution and users' preferences, and thus to improve the presentation of the services. The system has been used in real audio/video services since 2001 with satisfactory results.
Mobility pattern recognition in mobile ad-hoc networks
Authors: S. M. Mousavi, H. R. Rabiee, M. Moshref, A. Dabirmoghaddam
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a self-configuring network without using any existing infrastructure. Network nodes in a mobile Ad-hoc network move in some motion patterns called mobility models. The mobility models play a very important role in determining the protocol performance in MANET. Thus, it is essential to study and analyze various mobility models and their effect on MANET protocols. If we can recognize the mobility pattern of motion of mobile nodes in our environment we can customize our network protocols to deal with that existing mobility model. In this paper we introduce a new method for classification and pattern recognition of mobility traces into mobility models in mobile Ad-hoc networks. This method uses a simple learning based classification method to recognize the existing mobility model in raw mobility traces which was collected from real motion of mobile Ad-hoc nodes or mobility traces generated by mobility simulators. Our simulation results prove ability of our proposed method to accurately classify given unknown mobility traces into various mobility models.
Advanced Security for Virtual Organizations: The Pros and Cons of Centralized vs Decentralized Security Models
Authors: R. O. Sinnott, D. W. Chadwick, T. Doherty, D. Martin, A. Stell, G. Stewart, L. Su, J. Watt
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Grids allow for collaborative e-Research to be undertaken, often across institutional and national boundaries. Typically this is through the establishment of virtual organizations (VOs) where policies on access and usage of resources across partner sites are defined and subsequently enforced. For many VOs, these agreements have been lightweight and erred on the side of flexibility with minimal constraints on the kinds of jobs a user is allowed to run or the amount of resources that can be consumed. For many new domains such as e-Health, such flexibility is simply not tenable. Instead, precise definitions of what jobs can be run, and what data can be accessed by who need to be defined and enforced by sites. The role based access control model (RBAC) provides a well researched paradigm for controlling access to large scale dynamic VOs. However, the standard RBAC model assumes a single domain with centralised role management. When RBAC is applied to VOs, it does not specify how or where roles should be defined or made known to the distributed resource sites (who are always deemed to be autonomous to make access control decisions). Two main possibilities exist based on either a centralized or decentralized approach to VO role management. We present the advantages and disadvantages of the centralized and decentralized role models and describe how we have implemented them in a range of security focused e-Research domains at the National e-Science Centre (NeSC) at the University of Glasgow.
Beware the IDs of March
Authors: Daniel E. Geer Jr., Daniel G. Conway
Venue: IEEE Security and Privacy (2008)

In the latest numbers column, Dan Geer and Dan Conway examine the metrics of identity theft.
Mobile Agents for Service Discovery in Ad Hoc Networks
Authors: R. Tobias Meier, Jürgen Dunkel, Yoshiaki Kakuda, Tomoyuki Ohta
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Recently sophisticated protocols for routing in ad hoc networks have been proposed, but there is still little work on service discovery in such volatile environments. In this paper a mobile agent-based scheme for service discovery in ad hoc networks is introduced. Mobile agents are traveling through the network, collecting the dynamically changing service information. The travel route and the number of travel agents are adjusted according to the information state and the change of network topology. In a quantitative analysis the proposed algorithm is compared with the flooding scheme. The usefulness of the approach is proved by an implementation for mobile devices using J2ME and Bluetooth.
Development of Epicardial Mapping System for Studying Atrial Fibrillation
Authors: Cuiwei Yang, Weijia Lu, Tuo Zhou, Xiaomei Wu, Zuxiang Fang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Epicardial mapping system is an important tool for studying electrophysiological characteristics of a trialfibrillation (AF). AF is the most common arrhythmia and is becoming more prevalent each year. Most invivo experimental research on AF is performed by simultaneous epicardial mapping technique. An epicardial mapping system is developed to record electrical activities from 128 sites at the same time,with a spacing of 3.5-5.0mm. The initial purpose ofthis research is to display the electrical signals on the whole-atrial epicardial surface and store these data for subsequent analysis. 128 unipolar electrodes arranged in eight flexible patches were adopted to detect signal on the surface of whole atrium. Each electrode patch was designed to adaptable to the corresponding epicardial surface of canine atrium. The system contained an amplifier with 128 isolated channels and a data acquisition card based on USB communication. Random acquisition duration of interested data during sinus or AF rhythm could be recorded. Animal tests were operated on four mongreldogs, in which two were models of chronic AF. Result shows that this system can perform successfully in a surgical setting. This system may be a special and portable tool for whole-atrium epicardial mapping and therefore useful for studying AF.
A unified theory of structural tractability for constraint satisfaction problems
Authors: David Cohen, Peter Jeavons, Marc Gyssens
Venue: Journal of Computer and System Sciences (2008)

In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decomposition methods can be characterised in terms of finding guarded decompositions satisfying certain specified additional conditions. Using the guarded decomposition framework we are also able to define a new form of decomposition, which we call a spread-cut. We show that the discovery of width-k spread-cut decompositions is tractable for each k, and that spread-cut decompositions strongly generalise many existing decomposition methods. Finally we exhibit a family of hypergraphs H"n, for n=1,2,3..., where the minimum width of any hypertree decomposition of each H"n is 3n, but the width of the best spread-cut decomposition is only 2n+1.
Multiestimation-based adaptive control of robotic manipulators with applications to master slave tandems
Authors: A. Ibeas, M. de la Sen
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

A multiestimation-based adaptive controller is designed for robotic manipulators. Multiestimation based techniques can improve the transient response of adaptive systems by switching between the various estimation schemes. The switching process is subject to a minimum dwell or residence time in order to guarantee stability. Then, the multiestimation scheme is applied to the teleoperation of robotic manipulators. The robots are controlled by using an impedance type control, which is a typical architecture of control in teleoperation processes.
A novel image processing approach for qualitative road traffic data analysis
Authors: M. Y. Siyal
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

Real-time qualitative road traffic data analysis is the cornerstone for any modern transport system. So far, most of the analysis is done manually and the use of image processing techniques for qualitative analysis is at its early stage. In this paper we concentrate on qualitative analysis of a traffic scene, which is describing the traffic scene similar to the description of a traffic expert when viewing the scene. The results demonstrate that the system can be used in real-world traffic situation and the results are reported on-line in a graphical form.
Retrieving multiple light sources in the presence of specular reflections and texture
Authors: Pascal Lagger, Pascal Fua
Venue: Computer Vision and Image Understanding (2008)

Recovering multiple point light sources from a sparse set of photographs in which objects of unknown texture can move is challenging. This is because both diffuse and specular reflections appear to slide across surfaces, which is a well known physical fact. What is seldom demonstrated, however, is that it can be taken advantage of to address the light source recovery problem. In this paper, we therefore show that, if approximate 3D models of the moving objects are available or can be computed from the images, we can solve the problem without any a priori constraints on the number of sources, on their color, or on the surface albedos. Our approach involves finding local maxima in individual images, checking them for consistency across images, retaining the apparently specular ones, and having them vote in a Hough-like scheme for potential light source directions. The precise directions of the sources and their relative power are then obtained by optimizing a standard lighting model. As a byproduct we also obtain an estimate of various material parameters such as the unlighted texture and specular properties. We show that the resulting algorithm can operate in presence of arbitrary textures and an unknown number of light sources of possibly different unknown colors. We also estimate its accuracy using ground-truth data.
Modelling of Artificial Neural Network Controller for Electric Drive in Virtual Laboratory
Authors: Mikhail Gorobetz, Anatoly Levchenkov
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

In this paper authors presents modelling of neural network controller to control speed of DC drive. Main tasks of this research are to use artificial neural network for speed control of DC drive in virtual laboratory.The feed-forward back-propagation neural network is used for controller. Levenberg-Marquardt back-propagation algorithm is proposed as a training method. Neural network is trained to maintain rotation speed of DC drive in defined interval.Results of modelling show the possibility to use neural network controller for speed control of DC drive.
Non-polynomial spline for solution of boundary-value problems in plate deflection theory
Authors: J. Rashidinia, R. Jalilian
Venue: International Journal of Computer Mathematics (2007)

In this paper a non-polynomial quintic spline function is applied to the numerical solution of a certain fourth-order, two-point boundary-value problem occurring in plate deflection theory. Direct methods of orders two, four, and six have been obtained which lead to five-diagonal linear systems. Boundary formulae of various orders have been developed to retain the bandwidth of the coefficient matrix as five. Convergence analysis of the sixth-order method is given. Numerical results are provided to demonstrate the superiority of our methods.
Software development governance (SDG)
Authors: Yael Dubinsky
Venue: Companion of the 30th international conference on Software engineering (2008)

Governance in a specific organization is an iterative process that starts with the assignment of roles and decision rights as per goals that are set, continues with the establishment of a set of mechanisms to be activated on a specific scope within the organization, and ends with the assessment that leads to the refinement of the goals accordingly. This one-day workshop focuses on software development governance and deals with the issues that are special to software organizations.
Scheduling algorithm for multi-item requests with time constraints in mobile computing environments
Authors: Jun Chen, Ganping Huang, Victor C. S. Lee
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

On-demand broadcast is an effective wireless data dissemination technique to enhance system scalability and capability to handle dynamic user access patterns. Previous studies on time-critical on-demand data broadcast were under the assumption that each client requests only one data item at a time. Little work, however, has considered the ondemand broadcast with time-critical multi-item requests. In this paper, we study the problem arising in this new environment and observe that existing single item based scheduling algorithms are unable to manage multi-item requests efficiently. Thus, a new scheduling algorithm that combines the benefit of data item scheduling and request scheduling is proposed. The performance results show that the proposed algorithm is superior to other classical algorithms under a variety of factors. Our algorithm not only reduces deadline-missing ratio of requests, but also saves broadcast channel bandwidth.
Vers une int&eacute;gration du RFID et de la cartographie pour une visite autonome du mus&eacute;e des arts et m&eacute;tiers
Authors: S. Merdassi, R. Yahia-Aissa, R. Pellerin, I. Réchiniac-Astic, E. Gressier_Soudan
Venue: Proceedings of the 4th French-speaking conference on Mobility and ubiquity computing (2008)

We describe current works related to technological building blocks able to help people visiting museums. We present the use of RFID tags through a mobile phone and web enabled indoor maps. The paper concludes with future works.
Bag-of-visual-words expansion using visual relatedness for video indexing
Authors: Yu-Gang Jiang, Chong-Wah Ngo
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Bag-of-visual-words (BoW) has been popular for visual classification in recent years. In this paper, we propose a novel BoW expansion method to alleviate the effect of visual word correlation problem. We achieve this by diffusing the weights of visual words in BoW based on visual word relatedness, which is rigorously defined within a visual ontology. The proposed method is tested in video indexing experiment on TRECVID-2006 video retrieval benchmark, and an improvement of 7% over the traditional BoW is reported.
Anti-spam legislation: An analysis of laws and their effectiveness
Authors: Guido Schryen
Venue: Information and Communications Technology Law (2007)

More than half of worldwide e-mail traffic (an estimated total of several billion e-mails per day) consists of spam. This is becoming a considerable disturbance to telecommunications. Spam is also closely related to other kinds of cybercrime as it possibly contains malicious software or is pursuing some kind of fraudulent aim such as phishing. As well as technical and organizational measures, many countries have introduced anti-spam legislation. However, today's worldwide legislative coverage of spam is heterogeneous, and its effectiveness is discussed controversially. This article describes important parameters by which anti-spam legislation can vary and gives an overview and analysis of worldwide anti-spam legislation, including the European Directive 2002/58/EC and the United States CANSPAM Act 2003, and international cooperation, such as the London Action Plan. The article then proceeds to discuss the effectiveness of current laws and identifies problems resulting from the fact that an international phenomenon is being addressed by national legislation. Finally, the article presents suggestions for overcoming some of these problems.
Localized bases in L2(0,1) and their use in the analysis of Brownian motion
Authors: Palle E. T. Jorgensen, Anilesh Mohari
Venue: Journal of Approximation Theory (2008)

Motivated by problems on Brownian motion, we introduce a recursive scheme for a basis construction in the Hilbert space L^2(0,1) which is analogous to that of Haar and Walsh. More generally, we find a new decomposition theory for the Hilbert space of square-integrable functions on the unit-interval, both with respect to Lebesgue measure, and also with respect to a wider class of self-similar measures @m. That is, we consider recursive and orthogonal decompositions for the Hilbert space L^2(@m) where @m is some self-similar measure on [0,1]. Up to two specific reflection symmetries, our scheme produces infinite families of orthonormal bases in L^2(0,1). Our approach is as versatile as the more traditional spline constructions. But while singly generated spline bases typically do not produce orthonormal bases, each of our present algorithms does.
Ode to a Sailor
Authors: Donna Carnes
Venue: Queue (2008)

Ode to a Sailor DONNA CARNES sailor, fleeting mood image of you; all sailor in bear grace, rough hands and poetic dream; etched in sunlight at land¿s end; teacher in the rough most elegant and simple.
Symbolic computation of moments of sampling distributions
Authors: E. Di Nardo, G. Guarino, D. Senato
Venue: Computational Statistics Data Analysis (2008)

By means of the notion of umbrae indexed by multisets, a general method to express estimators and their products in terms of power sums is derived. A connection between the notion of multiset and integer partition leads immediately to a way to speed up procedures. Comparisons of computational times with known procedures show how this approach turns out to be more efficient in eliminating much unnecessary computation.
Shortest Paths In Euclidean Graphs
Authors: R. Sedgewick
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

We analyze a simple method for finding shortest paths in Euclidean graphs (where vertices are points in a Euclidean space and edge weights are distances between points). For many graph models, the running time of the algorithm to find the shortest path between a specified pair of vertices in a graph with V vertices and E edges is shown to be O(V) as compared with O (V log V + E) required by the classical (Dijkstra) algorithm.
Eigenvalue of fourth-order m-point boundary value problem with derivatives
Authors: Xinguang Zhang, Lishan Liu
Venue: Computers Mathematics with Applications (2008)

This paper deals with the existence of positive solutions for the fourth-order nonlinear ordinary differential equation x^@?(t)=@lg(t)f(t,x(t),x^''(t)),0=0 are constants such that @r=@a@d+@a@c+@b@d>0, and @x"i@?(0,1),@h"i@?[0,+~)(i=1,2,...,m-2). By means of a fixed-point theorem due to Krasnaselskii, some new existence results of positive solutions for the above multi-point boundary value problem are obtained, which improve the main results of Graef et al. [J.R. Graef, C. Qian, B. Yang, A three-point boundary value problem for nonlinear fourth-order differential equations, J. Math. Anal. Appl. 287 (2003) 217-233]. An example is given to demonstrate the main results of this paper.