171,833 research outputs found
Fuzzy C-Mean And Genetic Algorithms Based Scheduling For Independent Jobs In Computational Grid
The concept of Grid computing is becoming the most important research area in the high performance computing. Under this concept, the jobs scheduling in Grid computing has more complicated problems to discover a diversity of available resources, select the appropriate applications and map to suitable resources. However, the major problem is the optimal job scheduling, which Grid nodes need to allocate the appropriate resources for each job. In this paper, we combine Fuzzy C-Mean and Genetic Algorithms which are popular algorithms, the Grid can be used for scheduling. Our model presents the method of the jobs classifications based mainly on Fuzzy C-Mean algorithm and mapping the jobs to the appropriate resources based mainly on Genetic algorithm. In the experiments, we used the workload historical information and put it into our simulator. We get the better result when compared to the traditional algorithms for scheduling policies. Finally, the paper also discusses approach of the jobs classifications and the optimization engine in Grid scheduling
Damage identification in structural health monitoring: a brief review from its implementation to the Use of data-driven applications
The damage identification process provides relevant information about the current state of a structure under inspection, and it can be approached from two different points of view. The first approach uses data-driven algorithms, which are usually associated with the collection of data using sensors. Data are subsequently processed and analyzed. The second approach uses models to analyze information about the structure. In the latter case, the overall performance of the approach is associated with the accuracy of the model and the information that is used to define it. Although both approaches are widely used, data-driven algorithms are preferred in most cases because they afford the ability to analyze data acquired from sensors and to provide a real-time solution for decision making; however, these approaches involve high-performance processors due to the high computational cost. As a contribution to the researchers working with data-driven algorithms and applications, this work presents a brief review of data-driven algorithms for damage identification in structural health-monitoring applications. This review covers damage detection, localization, classification, extension, and prognosis, as well as the development of smart structures. The literature is systematically reviewed according to the natural steps of a structural health-monitoring system. This review also includes information on the types of sensors used as well as on the development of data-driven algorithms for damage identification.Peer ReviewedPostprint (published version
Within-socket Myoelectric Prediction of Continuous Ankle Kinematics for Control of a Powered Transtibial Prosthesis
Objective. Powered robotic prostheses create a need for natural-feeling user interfaces and robust control schemes. Here, we examined the ability of a nonlinear autoregressive model to continuously map the kinematics of a transtibial prosthesis and electromyographic (EMG) activity recorded within socket to the future estimates of the prosthetic ankle angle in three transtibial amputees. Approach. Model performance was examined across subjects during level treadmill ambulation as a function of the size of the EMG sampling window and the temporal \u27prediction\u27 interval between the EMG/kinematic input and the model\u27s estimate of future ankle angle to characterize the trade-off between model error, sampling window and prediction interval. Main results. Across subjects, deviations in the estimated ankle angle from the actual movement were robust to variations in the EMG sampling window and increased systematically with prediction interval. For prediction intervals up to 150 ms, the average error in the model estimate of ankle angle across the gait cycle was less than 6°. EMG contributions to the model prediction varied across subjects but were consistently localized to the transitions to/from single to double limb support and captured variations from the typical ankle kinematics during level walking. Significance. The use of an autoregressive modeling approach to continuously predict joint kinematics using natural residual muscle activity provides opportunities for direct (transparent) control of a prosthetic joint by the user. The model\u27s predictive capability could prove particularly useful for overcoming delays in signal processing and actuation of the prosthesis, providing a more biomimetic ankle response
Complex network classification using partially self-avoiding deterministic walks
Complex networks have attracted increasing interest from various fields of
science. It has been demonstrated that each complex network model presents
specific topological structures which characterize its connectivity and
dynamics. Complex network classification rely on the use of representative
measurements that model topological structures. Although there are a large
number of measurements, most of them are correlated. To overcome this
limitation, this paper presents a new measurement for complex network
classification based on partially self-avoiding walks. We validate the
measurement on a data set composed by 40.000 complex networks of four
well-known models. Our results indicate that the proposed measurement improves
correct classification of networks compared to the traditional ones
Designing labeled graph classifiers by exploiting the R\'enyi entropy of the dissimilarity representation
Representing patterns as labeled graphs is becoming increasingly common in
the broad field of computational intelligence. Accordingly, a wide repertoire
of pattern recognition tools, such as classifiers and knowledge discovery
procedures, are nowadays available and tested for various datasets of labeled
graphs. However, the design of effective learning procedures operating in the
space of labeled graphs is still a challenging problem, especially from the
computational complexity viewpoint. In this paper, we present a major
improvement of a general-purpose classifier for graphs, which is conceived on
an interplay between dissimilarity representation, clustering,
information-theoretic techniques, and evolutionary optimization algorithms. The
improvement focuses on a specific key subroutine devised to compress the input
data. We prove different theorems which are fundamental to the setting of the
parameters controlling such a compression operation. We demonstrate the
effectiveness of the resulting classifier by benchmarking the developed
variants on well-known datasets of labeled graphs, considering as distinct
performance indicators the classification accuracy, computing time, and
parsimony in terms of structural complexity of the synthesized classification
models. The results show state-of-the-art standards in terms of test set
accuracy and a considerable speed-up for what concerns the computing time.Comment: Revised versio
A complex network approach to stylometry
Statistical methods have been widely employed to study the fundamental
properties of language. In recent years, methods from complex and dynamical
systems proved useful to create several language models. Despite the large
amount of studies devoted to represent texts with physical models, only a
limited number of studies have shown how the properties of the underlying
physical systems can be employed to improve the performance of natural language
processing tasks. In this paper, I address this problem by devising complex
networks methods that are able to improve the performance of current
statistical methods. Using a fuzzy classification strategy, I show that the
topological properties extracted from texts complement the traditional textual
description. In several cases, the performance obtained with hybrid approaches
outperformed the results obtained when only traditional or networked methods
were used. Because the proposed model is generic, the framework devised here
could be straightforwardly used to study similar textual applications where the
topology plays a pivotal role in the description of the interacting agents.Comment: PLoS ONE, 2015 (to appear
- …