OpenRaiser/Intern-Atlas huggingface dataset:
Stereo image Transference & Retrieval over SMS
Venue: arXiv cs.MM 2012
Year: 2012

Paper presents the way of transferring stereo images using SMS over GSM network. Generally, Stereo image is composed of two stereoscopic images in such way that gives three dimensional affect when viewed. GSM have two short messaging services, which can transfer images and sounds etc. Such services are known as; MMS (Multimedia Messaging Service) and EMS (Extended Messaging Service). EMS can send Predefined sounds, animation and images but have limitation that it does not support widely. MMS can send much higher contents than EMS but need 3G and other network capability in order to send large size data up to 1000 bytes. Other limitations are Portability, content adaption etc. Our major aim in this paper is to provide an alternative way of sending stereo images over SMS which is widely supported than EMS. We develop an application using J2ME Platform.
A MDA approach for defining WS-Policy semantic non-functional properties
Venue: arXiv cs.SE 2012
Year: 2012

A lot of works has been especially interested to the functional aspect of Web services. Nevertheless, it is necessary to describe their non-functional properties such as the security characteristics and the quality of service. The WS-Policy standard was recommended in 2007 to describe Web services policies including the non-functional properties. However, it doesn't provide any information of their meaning necessary for automatic processes. In this paper, we propose a Model Driven Architecture approach founded on W3C standards to generate WSDL language based files including semantic policies. We use a package of WSDL and WS-Policy profiles and transformations rules to generate Web services interfaces files including policies. We extend a XML schema profile according to SAWSDL standard to define semantic non-functional properties domains. This work contributes to minimize the development cost of Web services including semantic policies. Moreover, the generated services can be automatically processed in discovery, selection and negotiation tasks.
Community detection and tracking on networks from a data fusion perspective
Venue: arXiv cs.SI 2012
Year: 2012

Community structure in networks has been investigated from many viewpoints, usually with the same end result: a community detection algorithm of some kind. Recent research offers methods for combining the results of such algorithms into timelines of community evolution. This paper investigates community detection and tracking from the data fusion perspective. We avoid the kind of hard calls made by traditional community detection algorithms in favor of retaining as much uncertainty information as possible. This results in a method for directly estimating the probabilities that pairs of nodes are in the same community. We demonstrate that this method is accurate using the LFR testbed, that it is fast on a number of standard network datasets, and that it is has a variety of uses that complement those of standard, hard-call methods. Retaining uncertainty information allows us to develop a Bayesian filter for tracking communities. We derive equations for the full filter, and marginalize it to produce a potentially practical version. Finally, we discuss closures for the marginalized filter and the work that remains to develop this into a principled, efficient method for tracking time-evolving communities on time-evolving networks.
A United Image Force for Deformable Models and Direct Transforming Geometric Active Contorus to Snakes by Level Sets
Venue: arXiv cs.CV 2012
Year: 2012

A uniform distribution of the image force field around the object fasts the convergence speed of the segmentation process. However, to achieve this aim, it causes the force constructed from the heat diffusion model unable to indicate the object boundaries accurately. The image force based on electrostatic field model can perform an exact shape recovery. First, this study introduces a fusion scheme of these two image forces, which is capable of extracting the object boundary with high precision and fast speed. Until now, there is no satisfied analysis about the relationship between Snakes and Geometric Active Contours (GAC). The second contribution of this study addresses that the GAC model can be deduced directly from Snakes model. It proves that each term in GAC and Snakes is correspondent and has similar function. However, the two models are expressed using different mathematics. Further, since losing the ability of rotating the contour, adoption of level sets can limits the usage of GAC in some circumstances.
Feature Selection via Regularized Trees
Venue: arXiv cs.LG 2012
Year: 2012

We propose a tree regularization framework, which enables many tree models to perform feature selection efficiently. The key idea of the regularization framework is to penalize selecting a new feature for splitting when its gain (e.g. information gain) is similar to the features used in previous splits. The regularization framework is applied on random forest and boosted trees here, and can be easily applied to other tree models. Experimental studies show that the regularized trees can select high-quality feature subsets with regard to both strong and weak classifiers. Because tree models can naturally deal with categorical and numerical variables, missing values, different scales between variables, interactions and nonlinearities etc., the tree regularization framework provides an effective and efficient feature selection solution for many practical problems.
On the minimality of Hamming compatible metrics
Venue: arXiv cs.IT 2012
Year: 2012

A Hamming compatible metric is an integer-valued metric on the words of a finite alphabet which agrees with the usual Hamming distance for words of equal length. We define a new Hamming compatible metric, compute the cardinality of a sphere with respect to this metric, and show this metric is minimal in the class of all "well-behaved" Hamming compatible metrics.
Two Hands Are Better Than One (up to constant factors)
Venue: arXiv cs.CC 2012
Year: 2012

We study the difference between the standard seeded model of tile self-assembly, and the "seedless" two-handed model of tile self-assembly. Most of our results suggest that the two-handed model is more powerful. In particular, we show how to simulate any seeded system with a two-handed system that is essentially just a constant factor larger. We exhibit finite shapes with a busy-beaver separation in the number of distinct tiles required by seeded versus two-handed, and exhibit an infinite shape that can be constructed two-handed but not seeded. Finally, we show that verifying whether a given system uniquely assembles a desired supertile is co-NP-complete in the two-handed model, while it was known to be polynomially solvable in the seeded model.
Slick Packets
Venue: arXiv cs.NI 2012
Year: 2012

Source-controlled routing has been proposed as a way to improve flexibility of future network architectures, as well as simplifying the data plane. However, if a packet specifies its path, this precludes fast local re-routing within the network. We propose SlickPackets, a novel solution that allows packets to slip around failures by specifying alternate paths in their headers, in the form of compactly-encoded directed acyclic graphs. We show that this can be accomplished with reasonably small packet headers for real network topologies, and results in responsiveness to failures that is competitive with past approaches that require much more state within the network. Our approach thus enables fast failure response while preserving the benefits of source-controlled routing.
Identifying and Analysis of Scene Mining Methods Beased on Scenes Extracted Features
Venue: arXiv cs.MM 2012
Year: 2012

Scene mining is a subset of image mining in which scenes are classified to a distinct set of classes based on analysis of their content. In other word in scene mining, a label is given to visual content of scene, for example, mountain, beach. Scene mining is used in applications such as medicine, movie, information retrieval, computer vision, recognition of traffic scene. Reviewing of represented methods shows there are various methods in scene mining. Scene mining applications extension and existence of various scenes, make comparison of methods hard. Scene mining can be followed by identifying scene mining components and representing a framework to analyzing and evaluating methods. In this paper, at first, components of scene mining are introduced, then a framework based on extracted features of scene is represented to classify scene mining methods. Finally, these methods are analyzed and evaluated via a proposal framework.
Some Observations on Optimal Frequency Selection in DVFS-based Energy Consumption Minimization
Venue: arXiv cs.DC 2012
Year: 2012

In recent years, the issue of energy consumption in parallel and distributed computing systems has attracted a great deal of attention. In response to this, many energy-aware scheduling algorithms have been developed primarily using the dynamic voltage-frequency scaling (DVFS) capability which has been incorporated into recent commodity processors. Majority of these algorithms involve two passes: schedule generation and slack reclamation. The former pass involves the redistribution of tasks among DVFS-enabled processors based on a given cost function that includes makespan and energy consumption; and, while the latter pass is typically achieved by executing individual tasks with slacks at a lower processor frequency. In this paper, a new slack reclamation algorithm is proposed by approaching the energy reduction problem from a different angle. Firstly, the problem of task slack reclamation by using combinations of processors' frequencies is formulated. Secondly, several proofs are provided to show that (1) if the working frequency set of processor is assumed to be continues, the optimal energy will be always achieved by using only one frequency, (2) for real processors with a discrete set of working frequencies, the optimal energy is always achieved by using at most two frequencies, and (3) these two frequencies are adjacent/neighbouring when processor energy consumption is a convex function of frequency. Thirdly, a novel algorithm to find the best combination of frequencies to result the optimal energy is presented. The presented algorithm has been evaluated based on results obtained from experiments with three different sets of task graphs: 3000 randomly generated task graphs, and 600 task graphs for two popular applications (Gauss-Jordan and LU decomposition). The results show the superiority of the proposed algorithm in comparison with other techniques.
Single bit full adder design using 8 transistors with novel 3 transistors XNOR gate
Venue: arXiv cs.OH 2012
Year: 2012

In present work a new XNOR gate using three transistors has been presented, which shows power dissipation of 550.7272$μ$W in 0.35$μ$m technology with supply voltage of 3.3V. Minimum level for high output of 2.05V and maximum level for low output of 0.084V have been obtained. A single bit full adder using eight transistors has been designed using proposed XNOR cell, which shows power dissipation of 581.542$μ$W. Minimum level for high output of 1.97V and maximum level for low output of 0.24V is obtained for sum output signal. For carry signal maximum level for low output of 0.32V and minimum level for high output of 3.2V have been achieved. Simulations have been performed by using SPICE based on TSMC 0.35$μ$m CMOS technology. Power consumption of proposed XNOR gate and full adder has been compared with earlier reported circuits and proposed circuit's shows better performance in terms of power consumption and transistor count.
Hybrid LS-LMMSE Channel Estimation Technique for LTE Downlink Systems
Venue: arXiv cs.NI 2012
Year: 2012

In this paper, we propose to improve the performance of the channel estimation for LTE Downlink systems under the effect of the channel length. As LTE Downlink system is a MIMO-OFDMA based system, a cyclic prefix (CP) is inserted at the beginning of each transmitted OFDM symbol in order to mitigate both inter-carrier interference (ICI) and inter-symbol interference (ISI). The inserted CP is usually equal to or longer than the channel length. However, the cyclic prefix can be shorter because of some unforeseen channel behaviour. Previous works have shown that in the case where the cyclic prefix is equal to or longer than the channel length, LMMSE performs better than LSE but at the cost of computational complexity .In the other case, LMMSE performs also better than LS only for low SNR values. However, LS shows better performance for LTE Downlink systems for high SNR values. Therefore, we propose a hybrid LS-LMMSE channel estimation technique robust to the channel length effect. MATLAB Monte-Carlo simulations are used to evaluate the performance of the proposed estimator in terms of Mean Square Error (MSE) and Bit Error Rate (BER) for 2x2 LTE Downlink systems.
Criteria of stabilizability for switching-control systems with solvable linear approximations
Venue: arXiv cs.SY 2012
Year: 2012

We study the stability and stabilizability of a continuous-time switched control system that consists of the time-invariant $n$-dimensional subsystems \dot{x}=A_ix+B_i(x)u\quad (x\in\mathbb{R}^n, t\in\mathbb{R}_+ \textrm{and} u\in\mathbb{R}^{m_i}),\qquad \textrm{where} i\in{1,...,N} and a switching signal $σ(\bcdot)\colon\mathbb{R}_+\rightarrow{1,...,N}$ which orchestrates switching between these subsystems above, where $A_i\in\mathbb{R}^{n\times n}, n\ge1, N\ge2, m_i\ge1$, and where $B_i(\bcdot)\colon\mathbb{R}^n\rightarrow\mathbb{R}^{n\times m_i}$ satisfies the condition $\|B_i(x)\|\le\bbbeta\|x\|\;\forall x\in\mathbb{R}^n$. We show that, if ${A_1,...,A_N}$ generates a solvable Lie algebra over the field $\mathbbm{C}$ of complex numbers and there exists an element $\bbA$ in the convex hull $\mathrm{co}{A_1,...,A_N}$ in $\mathbb{R}^{n\times n}$ such that the affine system $\dot{x}=\bbA x$ is exponentially stable, then there is a constant $\bbdelta>0$ for which one can design "sufficiently many" piecewise-constant switching signals $σ(t)$ so that the switching-control systems \dot{x}(t)=A_{σ(t)}x(t)+B_{σ(t)}(x(t))u(t),\quad x(0)\in\mathbb{R}^n\textrm{and} t\in\mathbb{R}_+ are globally exponentially stable, for any measurable external inputs $u(t)\in\mathbb{R}^{m_{σ(t)}}$ with $|u(t)|\le\bbdelta$.
Optimal Fuzzy Model Construction with Statistical Information using Genetic Algorithm
Venue: arXiv cs.AI 2012
Year: 2012

Fuzzy rule based models have a capability to approximate any continuous function to any degree of accuracy on a compact domain. The majority of FLC design process relies on heuristic knowledge of experience operators. In order to make the design process automatic we present a genetic approach to learn fuzzy rules as well as membership function parameters. Moreover, several statistical information criteria such as the Akaike information criterion (AIC), the Bhansali-Downham information criterion (BDIC), and the Schwarz-Rissanen information criterion (SRIC) are used to construct optimal fuzzy models by reducing fuzzy rules. A genetic scheme is used to design Takagi-Sugeno-Kang (TSK) model for identification of the antecedent rule parameters and the identification of the consequent parameters. Computer simulations are presented confirming the performance of the constructed fuzzy logic controller.
General Methodology for developing UML models from UI
Venue: arXiv cs.SE 2012
Year: 2012

In recent past every discipline and every industry have their own methods of developing products. It may be software development, mechanics, construction, psychology and so on. These demarcations work fine as long as the requirements are within one discipline. However, if the project extends over several disciplines, interfaces have to be created and coordinated between the methods of these disciplines. Performance is an important quality aspect of Web Services because of their distributed nature. Predicting the performance of web services during early stages of software development is significant. In Industry, Prototype of these applications is developed during analysis phase of Software Development Life Cycle (SDLC). However, Performance models are generated from UML models. Methodologies for predicting the performance from UML models is available. Hence, In this paper, a methodology for developing Use Case model and Activity model from User Interface is presented. The methodology is illustrated with a case study on Amazon.com.
Early Performance Prediction of Web Services
Venue: arXiv cs.PF 2012
Year: 2012

Web Service is an interface which implements business logic. Performance is an important quality aspect of Web services because of their distributed nature. Predicting the performance of web services during early stages of software development is significant. In this paper we model web service using Unified Modeling Language, Use Case Diagram, Sequence Diagram, Deployment Diagram. We obtain the Performance metrics by simulating the web services model using a simulation tool Simulation of Multi-Tier Queuing Architecture. We have identified the bottle neck resources.
Pbm: A new dataset for blog mining
Venue: arXiv cs.AI 2012
Year: 2012

Text mining is becoming vital as Web 2.0 offers collaborative content creation and sharing. Now Researchers have growing interest in text mining methods for discovering knowledge. Text mining researchers come from variety of areas like: Natural Language Processing, Computational Linguistic, Machine Learning, and Statistics. A typical text mining application involves preprocessing of text, stemming and lemmatization, tagging and annotation, deriving knowledge patterns, evaluating and interpreting the results. There are numerous approaches for performing text mining tasks, like: clustering, categorization, sentimental analysis, and summarization. There is a growing need to standardize the evaluation of these tasks. One major component of establishing standardization is to provide standard datasets for these tasks. Although there are various standard datasets available for traditional text mining tasks, but there are very few and expensive datasets for blog-mining task. Blogs, a new genre in web 2.0 is a digital diary of web user, which has chronological entries and contains a lot of useful knowledge, thus offers a lot of challenges and opportunities for text mining. In this paper, we report a new indigenous dataset for Pakistani Political Blogosphere. The paper describes the process of data collection, organization, and standardization. We have used this dataset for carrying out various text mining tasks for blogosphere, like: blog-search, political sentiments analysis and tracking, identification of influential blogger, and clustering of the blog-posts. We wish to offer this dataset free for others who aspire to pursue further in this domain.
Automatic Detection of Diabetes Diagnosis using Feature Weighted Support Vector Machines based on Mutual Information and Modified Cuckoo Search
Venue: arXiv cs.LG 2012
Year: 2012

Diabetes is a major health problem in both developing and developed countries and its incidence is rising dramatically. In this study, we investigate a novel automatic approach to diagnose Diabetes disease based on Feature Weighted Support Vector Machines (FW-SVMs) and Modified Cuckoo Search (MCS). The proposed model consists of three stages: Firstly, PCA is applied to select an optimal subset of features out of set of all the features. Secondly, Mutual Information is employed to construct the FWSVM by weighting different features based on their degree of importance. Finally, since parameter selection plays a vital role in classification accuracy of SVMs, MCS is applied to select the best parameter values. The proposed MI-MCS-FWSVM method obtains 93.58% accuracy on UCI dataset. The experimental results demonstrate that our method outperforms the previous methods by not only giving more accurate results but also significantly speeding up the classification procedure.
A Time Decoupling Approach for Studying Forum Dynamics
Venue: arXiv cs.SI 2012
Year: 2012

Online forums are rich sources of information about user communication activity over time. Finding temporal patterns in online forum communication threads can advance our understanding of the dynamics of conversations. The main challenge of temporal analysis in this context is the complexity of forum data. There can be thousands of interacting users, who can be numerically described in many different ways. Moreover, user characteristics can evolve over time. We propose an approach that decouples temporal information about users into sequences of user events and inter-event times. We develop a new feature space to represent the event sequences as paths, and we model the distribution of the inter-event times. We study over 30,000 users across four Internet forums, and discover novel patterns in user communication. We find that users tend to exhibit consistency over time. Furthermore, in our feature space, we observe regions that represent unlikely user behaviors. Finally, we show how to derive a numerical representation for each forum, and we then use this representation to derive a novel clustering of multiple forums.
Nimble@ITCEcnoGrid: A Grid in Research Domain for Weather Forecasting
Venue: arXiv cs.DC 2012
Year: 2012

Computer Technology has Revolutionized Science. This has motivated scientists to develop mathematical model to simulate salient features of Physical universe. These models can approximate reality at many levels of scale such as atomic nucleus, Earth's biosphere & weather/climate assessment. If the computer power is greater, the greater will be the accuracy in approximation i.e. close will be the approximation to the reality. The speed of the computer required for solution of such problems require computers with processing power of teraflops to Pets flops speed.. The way to speed up the computation is to "parallelize" it. One of the approach is to use multimillion dollar Supercomputer or use Computational Grid (which is also called poor man's supercomputer) having geographically distributed resources e.g. SETI@home (Used to detect radio waves emitted by intelligent civilizations outside earth) has 4.6 million participants computers. There are many alternatives tools available to achieve this goal like Globus Toolkit, Entropia, Legion, BOINC etc but they are mainly based on Linux platform. As majority of the computers available are windows based, so it will be easy to develop a larger network of computers which will use the free cycles of the computer to solve the complex problem at window platform. Nimble@ITCEcnoGrid has been developed. It includes the feature of Inter Thread Communication which is missing in any of the toolkits available. Nimble@ITCEcnoGrid Framework (A Fast Grid with Inter-thread communication with Economic Based Policy) was tested for computation of 'PI' up to 120 decimal points. Encouraged by the speed the same system has been utilized to computes the Momentum, Thermodynamics and Continuity equations for the Weather Forecasting using the Windows based Desktop computers.