Query: Algorithms for Large, Sparse Network Alignment Problems

Relevant passages:
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs <=SEP=> Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Detection of maximum common subgraph (MCS) is useful for matching, comparing and evaluate the similarity of patterns. MCS is a well known NP-complete problem for which optimal and suboptimal algorithms are known from the literature. Nevertheless, until now no effort has been done for characterizing their performance. The lack of a large database of graphs makes the task of comparing the performance of different graph matching algorithms difficult, and often the selection of an algorithm is made on the basis of a few experimental results available. In this paper, three optimal and well-known algorithms for maximum common subgraph detection are described. Moreover a large database containing various categories of pairs of graphs (e.g. random graphs, meshes, bounded valence graphs), is presented, and the performance of the three algorithms is evaluated on this database. Article Type Communicated by Submitted Revised Regular Paper U. Brandes September 2005 January 2007 D. Conte et al., Maximum Common Subgraph, JGAA, 11(1) 99–143 (2007) 100

Probabilistic Subgraph Matching Based on Convex Relaxation <=SEP=> We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with a regularization term that measures differences of the relational structure. For the resulting quadratic integer program, a mathematically tight relaxation is derived by exploiting the degrees of freedom of the embedding space of positive semidefinite matrices. We show that the global minimum of the relaxed convex problem can be interpreted as probability distribution over the original space of matching matrices, providing a basis for efficiently sampling all close-to-optimal combinatorial matchings within the original solution space. As a result, the approach can even handle completely ambiguous situations, despite uniqueness of the relaxed convex problem. Exhaustive numerical experiments demonstrate the promising performance of the approach which – up to a single inevitable regularization parameter that weights feature similarity against structural similarity – is free of any further tuning parameters.

Clustering by passing messages between data points. <=SEP=> Clustering data by identifying a subset of representative examples is important for processing sensory signals and detecting patterns in data. Such "exemplars" can be found by randomly choosing an initial subset of data points and then iteratively refining it, but this works well only if that initial choice is close to a good solution. We devised a method called "affinity propagation," which takes as input measures of similarity between pairs of data points. Real-valued messages are exchanged between data points until a high-quality set of exemplars and corresponding clusters gradually emerges. We used affinity propagation to cluster images of faces, detect genes in microarray data, identify representative sentences in this manuscript, and identify cities that are efficiently accessed by airline travel. Affinity propagation found clusters with much lower error than other methods, and it did so in less than one-hundredth the amount of time.

A Comparison of String Metrics for Matching Names and Records <=SEP=> We describe an open-source Java toolkit of methods for matching names and records. We summarize results obtained from using various string distance metrics on the task of matching entity names: these metrics include distance functions proposed by several different communities, including edit-distance metrics, fast heuristic string comparators, token-based distance metrics, and hybrid methods. We then describe an extension to the toolkit which allows records to be compared. We discuss some issues involved in performing a similar comparison for record-matching techniques, and finally present results for some baseline record-matching algorithms which are based on string comparisons between fields.

Thirty Years Of Graph Matching In Pattern Recognition <=SEP=> A recent paper posed the question: “Graph Matching: What are we really talking about?”. Far from providing a definite answer to that question, in this paper we will try to characterize the role that graphs play within the Pattern Recognition field. To this aim two taxonomies are presented and discussed. The first includes almost all the graph matching algorithms proposed from the late seventies, and describes the different classes of algorithms. The second taxonomy considers the types of common applications of graph-based techniques in the Pattern Recognition and Machine Vision field.

Development and validation of blue ray, an optical modem for the MEDUSA class AUVs <=SEP=> Wireless optical communications are emerging as a viable solution for high-speed data transmission over short ranges in the ocean, complementing mainstream acoustic communication systems that operate over much longer ranges, but at lower data rates. The current drive to develop cooperative autonomous vehicular systems to carry out surveying and other complex missions in the ocean critically depends on the existence of such communication links to share sensory and coordination information. This paper presents a compact, low power consumption, cost-efficient, and lightweight optical modem designed for fast data transmission between MEDUSA underwater vehicles at ranges on the order of 10 m. The transmitter uses LEDs for ON-OFF keying, while the receiver front-end adopts a transimpedance architecture with a photodiode detector. This simplistic transmission and reception technique reduces the overall design and hardware complexities compared to, e.g., laser diodes and photomultiplier tubes. The LEDs are arranged in a circular array, with a photodiode at the centre to enable half-duplex operation. These modems are designed to achieve data rates of 20-200 kb/s over short-range, line-of-sight, configurations. A transparent casing is customised to fit the Medusa vehicles, with proper alignment for inter-vehicle communication when they move in formation.

Theory application by school-based occupational therapists. <=SEP=> OBJECTIVES
Recent literature indicates that there is an inconsistent use of theory to guide clinical actions by occupational therapists, including those working in pediatrics. The purpose of this study was to describe school-based therapists' theory application by collecting information about what frames of reference they used and why.


METHOD
Of the 72 school-based therapists in the mid-Atlantic states who agreed to respond to a questionnaire, 51 (70.8%) returned the questionnaire. Information about demographics, what frames of reference were used, and why they were used was obtained from the questionnaire.


RESULTS
Respondents reported using a multitheoretical approach, with sensory integration theory and neurodevelopmental theory being the predominate frames of reference applied but not the only ones used. The frames of reference were used on the basis of several factors, including the children's needs and the respondent's education.


CONCLUSION
Formal and continuing education seems to have a great effect on school-based occupational therapists as they develop their personal conceptual frameworks.

Agnostic Estimation of Mean and Covariance <=SEP=> We consider the problem of estimating the mean and covariance of a distribution from i.i.d. samples in the presence of a fraction of malicious noise. This is in contrast to much recent work where the noise itself is assumed to be from a distribution of known type. The agnostic problem includes many interesting special cases, e.g., learning the parameters of a single Gaussian (or finding the best-fit Gaussian) when a fraction of data is adversarially corrupted, agnostically learning mixtures, agnostic ICA, etc. We present polynomial-time algorithms to estimate the mean and covariance with error guarantees in terms of information-theoretic lower bounds. As a corollary, we also obtain an agnostic algorithm for Singular Value Decomposition.

Robotics-logistics: Challenges for automation of logistic processes <=SEP=> Robotics-logistics can be understood as the field of activities in which applications of industrial robot-technologies are offered and demanded in order to ensure the optimization of internal material flows. According to a survey conducted by BIBA in 2007, the area of robotics-logistics has great need for modernization. Robotics-Logistics activities can be classified in several scenarios as unloading / loading of goods and palletizing / depalletizing of goods. Possible scenarios for research and development activities within theses fields are given.

Clothing identification via deep learning: forensic applications <=SEP=> Attribute-based identification systems are essential for forensic investigations because they help in identifying individuals. An item such as clothing is a visual attribute because it can usually be used to describe people. The method proposed in this article aims to identify people based on the visual information derived from their attire. Deep learning is used to train the computer to classify images based on clothing content. We first demonstrate clothing classification using a large scale dataset, where the proposed model performs relatively poorly. Then, we use clothing classification on a dataset containing popular logos and famous brand images. The results show that the model correctly classifies most of the test images with a success rate that is higher than 70%. Finally, we evaluate clothing classification using footage from surveillance cameras. The system performs well on this dataset, labelling 70% of the test images correctly.

Human Postures Recognition Based on D-S Evidence Theory and Multi-sensor Data Fusion <=SEP=> Body Sensor Networks (BSNs) are conveying notable attention due to their capabilities in supporting humans in their daily life. In particular, real-time and noninvasive monitoring of assisted livings is having great potential in many application domains, such as health care, sport/fitness, e-entertainment, social interaction and e-factory. And the basic as well as crucial feature characterizing such systems is the ability of detecting human actions and behaviors. In this paper, a novel approach for human posture recognition is proposed. Our BSN system relies on an information fusion method based on the D-S Evidence Theory, which is applied on the accelerometer data coming from multiple wearable sensors. Experimental results demonstrate that the developed prototype system is able to achieve a recognition accuracy between 98.5% and 100% for basic postures (standing, sitting, lying, squatting).

Weight-averaged consistency targets improve semi-supervised deep learning results <=SEP=> The recently proposed Temporal Ensembling has achieved state-of-the-art results in several semi-supervised learning benchmarks. It maintains an exponential moving average of label predictions on each training example, and penalizes predictions that are inconsistent with this target. However, because the targets change only once per epoch, Temporal Ensembling becomes unwieldy when learning large datasets. To overcome this problem, we propose Mean Teacher, a method that averages model weights instead of label predictions. As an additional benefit, Mean Teacher improves test accuracy and enables training with fewer labels than Temporal Ensembling. Without changing the network architecture, Mean Teacher achieves an error rate of 4.35% on SVHN with 250 labels, outperforming Temporal Ensembling trained with 1000 labels. We also show that a good network architecture is crucial to performance. Combining Mean Teacher and Residual Networks, we improve the state of the art on CIFAR-10 with 4000 labels from 10.55% to 6.28%, and on ImageNet 2012 with 10% of the labels from 35.24% to 9.11%.

Learning partial differential equations via data discovery and sparse optimization. <=SEP=> We investigate the problem of learning an evolution equation directly from some given data. This work develops a learning algorithm to identify the terms in the underlying partial differential equations and to approximate the coefficients of the terms only using data. The algorithm uses sparse optimization in order to perform feature selection and parameter estimation. The features are data driven in the sense that they are constructed using nonlinear algebraic equations on the spatial derivatives of the data. Several numerical experiments show the proposed method's robustness to data noise and size, its ability to capture the true features of the data, and its capability of performing additional analytics. Examples include shock equations, pattern formation, fluid flow and turbulence, and oscillatory convection.

Ensembles of nested dichotomies for multi-class problems <=SEP=> Nested dichotomies are a standard statistical technique for tackling certain polytomous classification problems with logistic regression. They can be represented as binary trees that recursively split a multi-class classification task into a system of dichotomies and provide a statistically sound way of applying two-class learning algorithms to multi-class problems (assuming these algorithms generate class probability estimates). However, there are usually many candidate trees for a given problem and in the standard approach the choice of a particular tree is based on domain knowledge that may not be available in practice. An alternative is to treat every system of nested dichotomies as equally likely and to form an ensemble classifier based on this assumption. We show that this approach produces more accurate classifications than applying C4.5 and logistic regression directly to multi-class problems. Our results also show that ensembles of nested dichotomies produce more accurate classifiers than pairwise classification if both techniques are used with C4.5, and comparable results for logistic regression. Compared to error-correcting output codes, they are preferable if logistic regression is used, and comparable in the case of C4.5. An additional benefit is that they generate class probability estimates. Consequently they appear to be a good general-purpose method for applying binary classifiers to multi-class problems.

A Case Study on Korean Wave: Focused on K-POP Concert by Korean Idol Group in Paris, June 2011 <=SEP=> The study dealt with Korean Wave focusing on K-POP and analyzed its success factors, the changes in Korean Wave and the future directions for development. Also the study has compared the results of the idol groups’ performance, held by SM Entertainment in June 2011 in Paris, and the perspective of Korean and French media. Key reasons were examined to analyze what led K-POP to play a crucial part in spreading the Korean Wave: The expansion of the age of its takers ranging from teens to females in their 20s; the fusion of a variety of cultural elements including oriental dance and occidental pop; the systematic system of idol training; marketing activities based on social media, etc. For the expansion of Korean Wave including K-POP and its successful positioning in the world market, there are several suggestions to make which are inventing the differentiated contents and highly appealing stories, approaching the local customers while considering local features, operating co-marketing with other cultural products.

Nonclassical Computation - A Dynamical Systems Perspective <=SEP=> In this chapter we investigate computation from a dynamical systems perspective. A dynamical system is described in terms of its abstract state space, the system’s current state within its state space, and a rule that determines its motion through its state space. In a classical computational system, that rule is given explicitly by the computer program; in a physical system, that rule is the underlying physical law governing the behaviour of the system. So a dynamical systems approach to computation allows us to take a unified view of computation in classical discrete systems and in systems performing non-classical computation. In particular, it gives a route to a computational interpretation of physical embodied systems exploiting the natural dynamics of their material substrates. We start with autonomous (closed) dynamical systems: those whose dynamics is not an explicit function of time, in particular, those with no inputs from an external environment. We begin with computationally conventional discrete systems, examining their computational abilities from a dynamical systems perspective. The aim here is both to introduce the necessary dynamical systems concepts, and to demonstrate how classical computation can be viewed from this perspective. We then move on to continuous dynamical systems, such as those inherent in the complex dynamics of matter, and show how these too can be interpreted computationally, and see how the material embodiment can give such computation “for free”, without the need to explicitly implement the dynamics. We next broaden the outlook to open (non-autonomous) dynamical systems, where the dynamics is a function of time, in the form of inputs from an external environment, and which may be in a closely coupled feedback loop with that environment. We finally look at constructive, or developmental, dynamical systems, where the structure of the state space is changing during the computation. This includes vari-

An acute bout of self-myofascial release increases range of motion without a subsequent decrease in muscle activation or force. <=SEP=> Foam rolling is thought to improve muscular function, performance, overuse, and joint range of motion (ROM); however, there is no empirical evidence demonstrating this. Thus, the objective of the study was to determine the effect of self-myofascial release (SMR) via foam roller application on knee extensor force and activation and knee joint ROM. Eleven healthy male (height 178.9 ± 3.5 cm, mass 86.3 ± 7.4 kg, age 22.3 ± 3.8 years) subjects who were physically active participated. Subjects' quadriceps maximum voluntary contraction force, evoked force and activation, and knee joint ROM were measured before, 2 minutes, and 10 minutes after 2 conditions: (a) 2, 1-minute trials of SMR of the quadriceps via a foam roller and (b) no SMR (Control). A 2-way analysis of variance (condition × time) with repeated measures was performed on all dependent variables recorded in the precondition and postcondition tests. There were no significant differences between conditions for any of the neuromuscular dependent variables. However, after foam rolling, subjects' ROM significantly (p < 0.001) increased by 10° and 8° at 2 and 10 minutes, respectively. There was a significant (p < 0.01) negative correlation between subjects' force and ROM before foam rolling, which no longer existed after foam rolling. In conclusion, an acute bout of SMR of the quadriceps was an effective treatment to acutely enhance knee joint ROM without a concomitant deficit in muscle performance.

Computer Forensics Field Triage Process Model <=SEP=> With the proliferation of digital based evidence, the need for the timely identification, analysis and interpretation of digital evidence is becoming more crucial. In many investigations critical information is required while at the scene or within a short period of time measured in hours as opposed to days. The traditional cyber forensics approach of seizing a system(s)/media, transporting it to the lab, making a forensic image(s), and then searching the entire system for potential evidence, is no longer appropriate in some circumstances. In cases such as child abductions, pedophiles, missing or exploited persons, time is of the essence. In these types of cases, investigators dealing with the suspect or crime scene need investigative leads quickly; in some cases it is the difference between life and death for the victim(s). The Cyber Forensic Field Triage Process Model (CFFTPM) proposes an onsite or field approach for providing the identification, analysis and interpretation of digital evidence in a short time frame, without the requirement of having to take the system(s)/media back to the lab for an in-depth examination or acquiring a complete forensic image(s). The proposed model adheres to commonly held forensic principles, and does not negate the ability that once the initial field triage is concluded, the system(s)/storage media be transported back to a lab environment for a more thorough examination and analysis. The CFFTPM has been successfully used in various real world cases, Journal of Digital Forensics, Security and Law, Vol. 1(2) 20 and its investigative importance and pragmatic approach has been amply demonstrated. Furthermore, the derived evidence from these cases has not been challenged in the court proceedings where it has been introduced. The current article describes the CFFTPM in detail, discusses the model’s forensic soundness, investigative support capabilities and practical considerations.

SATIRE: a software architecture for smart AtTIRE <=SEP=> Personal instrumentation and monitoring services that collect and archive the physical activities of a user have recently been introduced for various medical, personal, safety, and entertainment purposes. A general software architecture is needed to support different categories of such monitoring services. This paper presents a software architecture, implementation, and preliminary evaluation of SATIRE, a wearable personal monitoring service transparently embedded in user garments. SATIRE records the owner's activity and location for subsequent automated uploading and archiving. The personal archive can later be searched for particular events to answer questions regarding past and present user activity, location, and behavior patterns. A short feasibility and usage study of a prototype based on MicaZ motes provides a proof of concept for the SATIRE architecture.

CDN brokering <=SEP=> Content distribution networks (CDNs) increase the capacity of individual Web sites and attempt to deliver content from caches that are located “closer” to end-users than the origin servers that provide the content. CDN brokering provides CDNs a way to interoperate by allowing one CDN to intelligently redirect clients dynamically to other CDNs. This paper describes the goals, architecture, and performance of a CDN brokerage system. Our system has been deployed on the Internet on a provisional basis, and our architectural ideas have helped advance the evolution of Internet standards for interoperating CDNs.

Editing Description Logic Ontologies with the Protégé OWL Plugin <=SEP=> The growing interest in the Semantic Web and the Web Ontology Language (OWL) will reveal the potential of Description Logics in industrial projects. The rich semantics of OWL provide powerful reasoning capabilities that help build, maintain and query domain models for many purposes. However, before OWL can unfold its full potential, user-friendly tools with a scalable architecture are required. We present the OWL Plugin, an extension of the Protégé ontology development environment, which can be used to define classes and properties, to edit logical class expressions, to invoke reasoners, and to link ontologies into the Semantic Web. We analyze some of the challenges for developers of Description Logic editors, and discuss some of our user interface design decisions.

Fast and Flexible Indoor Scene Synthesis via Deep Convolutional Generative Models <=SEP=> We present a new, fast and flexible pipeline for indoor scene synthesis that is based on deep convolutional generative models. Our method operates on a top-down image-based representation, and inserts objects iteratively into the scene by predicting their category, location, orientation and size with separate neural network modules. Our pipeline naturally supports automatic completion of partial scenes, as well as synthesis of complete scenes. Our method is significantly faster than the previous image-based method and generates result that outperforms state-of-the-art generative scene models in terms of faithfulness to training data and perceived visual quality.

When Is It Too Early for Single Sport Specialization? <=SEP=> Over the past 15 years, there has been an increase in youth sports participation with a concomitant increase in early year-round training in a single sport. Many factors contribute to the desire of parents and coaches to encourage early single sport specialization, including the desire to give the young athlete an edge in competition, pursuit of scholarships, and potential professional status, and the ability to label a young athlete as elite at an early age. Despite these perceived advantages, some data suggest that early sport specialization does not lead to a competitive advantage over athletes who participate in multiple sports. Although the data are limited, there is some evidence that early sport specialization may put the young athlete at risk for overuse injuries. The focus of this review is to highlight the evidence regarding early sport specialization and risk for injury; discuss the risk factors for overuse injury in high-risk sports including ice hockey, swimming, gymnastics, and baseball; and discuss future potential research that would help define the risk of injury for young athletes who participate in early sport specialization.

Coordinated Power Control of Variable-Speed Diesel Generators and Lithium-Battery on a Hybrid Electric Boat <=SEP=> This paper presents coordinated power management strategies for a hybrid electric boat (HEB) based on dynamic load's power distribution approach using diesel generators and batteries. Two variable-speed diesel generator sets connecting to dc-bus via fully controlled rectifiers serve as the main power supply source; one lithium-battery pack linked to dc-bus through a bidirectional DC/DC converter serves as an auxiliary power supply source. The power requirement of the thrusters and other onboard equipment is represented by a load power profile. The main contribution of this paper is focused on the load power sharing of the HEB between the two variable-speed diesel generators and the lithium-battery pack, through the fluctuations extracted from load power and their assignation to the batteries. Another important issue is that when the total load demand is low, one of the diesel generator set will be switched off to improve the diesel-fuel efficiency. The output powers of the diesel generators and the batteries are controlled based on the power distribution strategy via the converters controlling. The performances of the proposed hybrid power system control are evaluated through simulations in MATALB/Simulink, and through reduced-scale experimental tests carried out for a specific driving cycle of the HEB.

Multiple description-DASH: Pragmatic video streaming maximizing end-users' quality of experience <=SEP=> Over the past few years, adaptive bitrate streaming protocols, such as DASH, have risen to enhance the End-Users' experience towards video consumption over the Internet. Current methods perform a smoother playback (i.e., fewer re-buffering states) trading off with quality fluctuations due to the client-server link state. The proposed work goes a step further and introduces an innovative lightweight streaming solution by taking advantage of bandwidth aggregation over multiple paths using multiple content sources at the same time. This pragmatic evolving approach outperforms the QoE delivered by current DASH-based or P2P-based solutions and leverages the scope of action made available to the media delivery chain actors. The proposed solution has been implemented and is compared to a DASH-based approach used in most existing VoD use-cases through a first set of experiments. Results demonstrate the strong advantages in terms of quality delivered at the End-User's side and buffer occupancy. Discussion on the necessary trade-offs is also tackled.

Optimizing power-accuracy trade-off in approximate adders <=SEP=> Approximate circuit design has gained significance in recent years targeting applications like media processing where full accuracy is not required. In this paper, we propose an approximate adder in which the approximate part of the sum is obtained by finding a single optimal level that minimises the mean error distance. Therefore hardware needed for the approximate part computation can be removed, which effectively results in very low power consumption. We compare the proposed adder with various approximate adders in the literature in terms of power and accuracy metrics. The power savings of our adder is shown to be 17% to 55% more than power savings of the existing approximate adders over a significant range of accuracy values. Further, in an image addition application, this adder is shown to provide the best trade-off between PSNR and power.

Substrate Integrated Waveguide (SIW) Rotman Lens and Its Ka-Band Multibeam Array Antenna Applications <=SEP=> A new type of substrate integrated waveguide (SIW) multibeam antenna is proposed for mobile satellite communications using beam switching and diversity techniques. It employs an SIW Rotman lens as the beamforming network. The prototype of a single multibeam antenna is implemented at 28.5 GHz with seven input ports and an antenna array constructed by nine SIW linear slot arrays, which can generate a corresponding number of beams along one dimension. Several such antennas are grouped in two different ways to cover a 2-D solid angle with multiple beams. Experiment results show that the 2-D solid angle around (-40deg, 40deg) X (-35deg, 35deg) or (-25deg, 25deg) x (-35deg, 35deg) are covered with 20 or 25 beams with 5 -dB beamwidth, respectively. It is demonstrated that this type of printed multibeam antenna is a good choice for communication applications where mobility and high gain are simultaneously required.

From Trust in Automation to Decision Neuroscience: Applying Cognitive Neuroscience Methods to Understand and Improve Interaction Decisions Involved in Human Automation Interaction <=SEP=> Human automation interaction (HAI) systems have thus far failed to live up to expectations mainly because human users do not always interact with the automation appropriately. Trust in automation (TiA) has been considered a central influence on the way a human user interacts with an automation; if TiA is too high there will be overuse, if TiA is too low there will be disuse. However, even though extensive research into TiA has identified specific HAI behaviors, or trust outcomes, a unique mapping between trust states and trust outcomes has yet to be clearly identified. Interaction behaviors have been intensely studied in the domain of HAI and TiA and this has led to a reframing of the issues of problems with HAI in terms of reliance and compliance. We find the behaviorally defined terms reliance and compliance to be useful in their functionality for application in real-world situations. However, we note that once an inappropriate interaction behavior has occurred it is too late to mitigate it. We therefore take a step back and look at the interaction decision that precedes the behavior. We note that the decision neuroscience community has revealed that decisions are fairly stereotyped processes accompanied by measurable psychophysiological correlates. Two literatures were therefore reviewed. TiA literature was extensively reviewed in order to understand the relationship between TiA and trust outcomes, as well as to identify gaps in current knowledge. We note that an interaction decision precedes an interaction behavior and believe that we can leverage knowledge of the psychophysiological correlates of decisions to improve joint system performance. As we believe that understanding the interaction decision will be critical to the eventual mitigation of inappropriate interaction behavior, we reviewed the decision making literature and provide a synopsis of the state of the art understanding of the decision process from a decision neuroscience perspective. We forward hypotheses based on this understanding that could shape a research path toward the ability to mitigate interaction behavior in the real world.

Predicting Students’ Performance using Modified ID3 Algorithm <=SEP=> The ability to predict performance of students is very crucial in our present education system. We can use data mining concepts for this purpose. ID3 algorithm is one of the famous algorithms present today to generate decision trees. But this algorithm has a shortcoming that it is inclined to attributes with many values. So , this research aims to overcome this shortcoming of the algorithm by using gain ratio(instead of information gain) as well as by giving weights to each attribute at every decision making point. Several other algorithms like J48 and Naive Bayes classification algorithm are also applied on the dataset. The WEKA tool was used for the analysis of J48 and Naive Bayes algorithms. The results are compared and presented. The dataset used in our study is taken from the School of Computing Sciences and Engineering (SCSE), VIT University. Keyworddata mining, educational data mining (EDM), decision tree, gain ratio, weighted ID3

Improving read performance of STT-MRAM based main memories through Smash Read and Flexible Read <=SEP=> Spin Transfer Torque Magnetoresistive RAM (STT-MRAM) has been recently deemed as one promising main memory alternative for high-end mobile processors. With process technology scaling, the amplitude of write current approaches that of read current in deep sub-micrometer STT-MRAM arrays. As a result, read disturbance errors (RDEs) emerge. Both high current restore required (HCRR) reads and low current long latency (LCLL) reads can guarantee read reliability and utterly remove RDEs. However, both of them degrade system performance, because of extra restores or a longer read latency. And neither of them always achieves the better performance when running a wide variety of applications. In this paper, we present two architectural techniques to boost read performance for STT-MRAM based main memories in the presence of RDEs. We first propose Smash Read (S-RD) to shorten the latency of HCRR reads by injecting a larger read current. We further introduce Flexible Read (F-RD) to dynamically adopt different types of read schemes, S-RD and LCLL, to maximize main memory system performance. On average, our techniques improve system performance by 9~13% and reduces total energy by 4~8% over all existing read schemes including HCRR and LCLL.