OpenRaiser/Intern-Atlas huggingface dataset:
Towards an intelligence based conceptual framework for e-maintenance
Venue: arXiv cs.MA 2012
Year: 2012

Since the time when concept of e-maintenance was introduced, most of the works insisted on the relevance of the underlying Information and Communication Technologies infrastructure. Through a review of current e-maintenance conceptual approaches and realizations, this paper aims to reconsider the predominance of ICT within e-maintenance projects and literature. The review brings to light the importance of intelligence as a fundamental dimension of e-maintenance that is to be led in a holistic predefined manner rather than isolated efforts within ICT driven approaches. As a contribution towards an intelligence based e-maintenance conceptual framework, a proposal is outlined in this paper to model e-maintenance system as an intelligent system. The proposed frame is based on CogAff architecture for intelligent agents. Within the proposed frame, more importance was reserved to the environment that the system is to be continuously aware of: Plant Environment, Internal and External Enterprise Environment and Human Environment. In addition to the abilities required for internal coherent behavior of the system, requirements for maintenance activities support are also mapped within the same frame according to corresponding levels of management. A case study was detailed in this paper sustaining the applicability of the proposal in relation to the classification of existing e-maintenance platforms. However, more work is needed to enhance exhaustiveness of the frame to serve as a comparison tool of existing e-maintenance systems. At the conceptual level, our future work is to use the proposed frame in an e-maintenance project.
Secure and Energy-Efficient Data Aggregation in Wireless Sensor Networks
Venue: arXiv cs.CR 2012
Year: 2012

Data aggregation in intermediate nodes (called aggregator nodes) is an effective approach for optimizing consumption of scarce resources like bandwidth and energy in Wireless Sensor Networks (WSNs). However, in-network processing poses a problem for the privacy of the sensor data since individual data of sensor nodes need to be known to the aggregator node before the aggregation process can be carried out. In applications of WSNs, privacy-preserving data aggregation has become an important requirement due to sensitive nature of the sensor data. Researchers have proposed a number of protocols and schemes for this purpose. He et al. (INFOCOM 2007) have proposed a protocol - called CPDA - for carrying out additive data aggregation in a privacy-preserving manner for application in WSNs. The scheme has been quite popular and well-known. In spite of the popularity of this protocol, it has been found that the protocol is vulnerable to attack and it is also not energy-efficient. In this paper, we first present a brief state of the art survey on the current privacy-preserving data aggregation protocols for WSNS. Then we describe the CPDA protocol and identify its security vulnerability. Finally, we demonstrate how the protocol can be made secure and energy efficient.
A Report on Multilinear PCA Plus Multilinear LDA to Deal with Tensorial Data: Visual Classification as An Example
Venue: arXiv cs.CV 2012
Year: 2012

In practical applications, we often have to deal with high order data, such as a grayscale image and a video sequence are intrinsically 2nd-order tensor and 3rd-order tensor, respectively. For doing clustering or classification of these high order data, it is a conventional way to vectorize these data before hand, as PCA or FDA does, which often induce the curse of dimensionality problem. For this reason, experts have developed many methods to deal with the tensorial data, such as multilinear PCA, multilinear LDA, and so on. In this paper, we still address the problem of high order data representation and recognition, and propose to study the result of merging multilinear PCA and multilinear LDA into one scenario, we name it \textbf{GDA} for the abbreviation of Generalized Discriminant Analysis. To evaluate GDA, we perform a series of experiments, and the experimental results demonstrate our GDA outperforms a selection of competing methods such (2D)$^2$PCA, (2D)$^2$LDA, and MDA.
How much could we cover a set by c.e sets?
Venue: arXiv cs.FL 2012
Year: 2012

"How much c.e. sets could cover a given set?" in this paper we are going to answer this question. Also, in this approach some old concepts come into a new arrangement. The major goal of this article is to introduce an appropriate definition for this purpose. Introduction In Computability Theory (Recursion Theory) in the first step we wish to recognize the sets which could be enumerated by Turing machines (equivalently, algorithms) and in the next step we will compare these sets by some reasonable order (Like Turing degree). Also sometimes with some extra information (Oracles) a class of non c.e. sets show the same behavior as c.e. sets (Post hierarchy and related theorems). Here we try another approach: "Let A be an arbitrary set and we wish to recognize how much this set might be covered by a c.e. set?" Although in some sense this approach could be seen in some definitions of Recursion Theory, but at the best of our knowledge it didn't considered as an approach yet, even though it is able to shed a light on some subjects of Computability of sets. Defining this approach is not quite straightforward and there are some obstacles to define them. To overcome these difficulties we modify the definitions. We have an alternative problem here when we consider recursive sets and not c.e. sets. In this case, the problem would be: "Let A be an arbitrary set and we wish to know that how much this set might be covered by a recursive Set?" Here, we try the first definition and the first problem.
Data-Driven Execution of Fast Multipole Methods
Venue: arXiv cs.NA 2012
Year: 2012

Fast multipole methods have O(N) complexity, are compute bound, and require very little synchronization, which makes them a favorable algorithm on next-generation supercomputers. Their most common application is to accelerate N-body problems, but they can also be used to solve boundary integral equations. When the particle distribution is irregular and the tree structure is adaptive, load-balancing becomes a non-trivial question. A common strategy for load-balancing FMMs is to use the work load from the previous step as weights to statically repartition the next step. The authors discuss in the paper another approach based on data-driven execution to efficiently tackle this challenging load-balancing problem. The core idea consists of breaking the most time-consuming stages of the FMMs into smaller tasks. The algorithm can then be represented as a Directed Acyclic Graph (DAG) where nodes represent tasks, and edges represent dependencies among them. The execution of the algorithm is performed by asynchronously scheduling the tasks using the QUARK runtime environment, in a way such that data dependencies are not violated for numerical correctness purposes. This asynchronous scheduling results in an out-of-order execution. The performance results of the data-driven FMM execution outperform the previous strategy and show linear speedup on a quad-socket quad-core Intel Xeon system.
Codes Satisfying the Chain Condition with a Poset Weights
Venue: arXiv cs.IT 2012
Year: 2012

In this paper we extend the concept of generalized Wei weights for poset-weight codes and show that all linear codes C satisfy the chain condition if support of C is a subposet totally ordered.
MIMO Multiple Access Channel with an Arbitrarily Varying Eavesdropper
Venue: arXiv cs.IT 2012
Year: 2012

A two-transmitter Gaussian multiple access wiretap channel with multiple antennas at each of the nodes is investigated. The channel matrices at the legitimate terminals are fixed and revealed to all the terminals, whereas the channel matrix of the eavesdropper is arbitrarily varying and only known to the eavesdropper. The secrecy degrees of freedom (s.d.o.f.) region under a strong secrecy constraint is characterized. A transmission scheme that orthogonalizes the transmit signals of the two users at the intended receiver and uses a single-user wiretap code is shown to be sufficient to achieve the s.d.o.f. region. The converse involves establishing an upper bound on a weighted-sum-rate expression. This is accomplished by using induction, where at each step one combines the secrecy and multiple-access constraints associated with an adversary eavesdropping a carefully selected group of sub-channels.
Improved Method for Searching of Interleavers Using Garello's Method
Venue: arXiv cs.IT 2012
Year: 2012

In this paper an improved method for searching good interleavers from a certain set is proposed. The first few terms, corresponding to maximum distance of approximately 40 of the distance spectra, for turbo codes using these interleavers are determined by means of Garello's method. The method is applied to find quadratic permutation polynomials (QPP) based interleavers. Compared to previous methods for founding QPP based interleavers, the search complexity is reduced, allowing to find interleavers of higher length. This method has been applied for QPP interleavers with lengths from the LTE (Long Term Evolution) standard up to 1504. The analyzed classes are those with the largest spread QPP (LS-QPP), with the D parameter equal to that of LTE interleaver (D_L_T_E-QPP), and the class consisting of all QPP interleavers for lengths up to 1008. The distance spectrum optimization is made for all classes. For the class of LS-QPP interleavers of small lengths, the search led to superior or at least equal performances with those of the LTE standard. For larger lengths the search in the class of D_L_T_E-QPP interleavers is preferred. The interleavers from the entire class of QPPs lead, in general, to weaker FER (Frame Error Rate) performance.
Coding Delay Analysis of Chunked Codes over Line Networks
Venue: arXiv cs.IT 2012
Year: 2012

In this paper, we analyze the coding delay and the average coding delay of Chunked network Codes (CC) over line networks with Bernoulli losses and deterministic regular or Poisson transmissions. Chunked codes are an attractive alternative to random linear network codes due to their lower complexity. Our results, which include upper bounds on the delay and the average delay, are the first of their kind for CC over networks with such probabilistic traffics. These results demonstrate that a stand-alone CC or a precoded CC provides a better tradeoff between the computational complexity and the convergence speed to the network capacity over the probabilistic traffics compared to arbitrary deterministic traffics. The performance of CC over the latter traffics has already been studied in the literature.
High performance computing network for cloud environment using simulators
Venue: arXiv cs.DC 2012
Year: 2012

Cloud computing is the next generation computing. Adopting the cloud computing is like signing up new form of a website. The GUI which controls the cloud computing make is directly control the hardware resource and your application. The difficulty part in cloud computing is to deploy in real environment. Its' difficult to know the exact cost and it's requirement until and unless we buy the service not only that whether it will support the existing application which is available on traditional data center or had to design a new application for the cloud computing environment. The security issue, latency, fault tolerance are some parameter which we need to keen care before deploying, all this we only know after deploying but by using simulation we can do the experiment before deploying it to real environment. By simulation we can understand the real environment of cloud computing and then after it successful result we can start deploying your application in cloud computing environment. By using the simulator it will save us lots of time and money.
Remote Sensing and Control for Establishing and Maintaining Digital Irrigation
Venue: arXiv cs.SY 2012
Year: 2012

The remotely sensed data from an unknown location is transmitted in real time through internet and gathered in a PC. The data is collected for a considerable period of time and analyzed in PC as to assess the suitability and fertility of the land for establishing an electronic plantation in that area. The analysis also helps deciding the plantation of appropriate plants in the location identified. The system performing this task with appropriate transducers installed in remote area, the methodologies involved in transmission and data gathering are reported.. The second part of the project deals with data gathering from remote site and issuing control signals to remote appliances in the site; all performed through internet. Therefore, this control scheme is a duplex system monitoring the irrigation activities by collecting data in one direction and issuing commands on the opposite direction. This scheme maintains the digital irrigation systems effectively and efficiently as to utilize the resources optimally for yielding enhanced production. The methodologies involved in extending the two way communication of data are presented.
A comparative evaluation of two algorithms of detection of masses on mammograms
Venue: arXiv cs.CV 2012
Year: 2012

In this paper, we implement and carry out the comparison of two methods of computer-aided-detection of masses on mammograms. The two algorithms basically consist of 3 steps each: segmentation, binarization and noise suppression using different techniques for each step. A database of 60 images was used to compare the performance of the two algorithms in terms of general detection efficiency, conservation of size and shape of detected masses.
Partition Sort Revisited: Reconfirming the Robustness in Average Case and much more!
Venue: arXiv cs.DS 2012
Year: 2012

In our previous work there was some indication that Partition Sort could be having a more robust average case O(nlogn) complexity than the popular Quick Sort. In our first study in this paper, we reconfirm this through computer experiments for inputs from Cauchy distribution for which expectation theoretically does not exist. Additionally, the algorithm is found to be sensitive to parameters of the input probability distribution demanding further investigation on parameterized complexity. The results on this algorithm for Binomial inputs in our second study are very encouraging in that direction.
Distributional Measures of Semantic Distance: A Survey
Venue: arXiv cs.CL 2012
Year: 2012

The ability to mimic human notions of semantic distance has widespread applications. Some measures rely only on raw text (distributional measures) and some rely on knowledge sources such as WordNet. Although extensive studies have been performed to compare WordNet-based measures with human judgment, the use of distributional measures as proxies to estimate semantic distance has received little attention. Even though they have traditionally performed poorly when compared to WordNet-based measures, they lay claim to certain uniquely attractive features, such as their applicability in resource-poor languages and their ability to mimic both semantic similarity and semantic relatedness. Therefore, this paper presents a detailed study of distributional measures. Particular attention is paid to flesh out the strengths and limitations of both WordNet-based and distributional measures, and how distributional measures of distance can be brought more in line with human notions of semantic distance. We conclude with a brief discussion of recent work on hybrid measures.
Worst-case Optimal Join Algorithms
Venue: arXiv cs.DB 2012
Year: 2012

Efficient join processing is one of the most fundamental and well-studied tasks in database research. In this work, we examine algorithms for natural join queries over many relations and describe a novel algorithm to process these queries optimally in terms of worst-case data complexity. Our result builds on recent work by Atserias, Grohe, and Marx, who gave bounds on the size of a full conjunctive query in terms of the sizes of the individual relations in the body of the query. These bounds, however, are not constructive: they rely on Shearer's entropy inequality which is information-theoretic. Thus, the previous results leave open the question of whether there exist algorithms whose running time achieve these optimal bounds. An answer to this question may be interesting to database practice, as it is known that any algorithm based on the traditional select-project-join style plans typically employed in an RDBMS are asymptotically slower than the optimal for some queries. We construct an algorithm whose running time is worst-case optimal for all natural join queries. Our result may be of independent interest, as our algorithm also yields a constructive proof of the general fractional cover bound by Atserias, Grohe, and Marx without using Shearer's inequality. This bound implies two famous inequalities in geometry: the Loomis-Whitney inequality and the Bollobás-Thomason inequality. Hence, our results algorithmically prove these inequalities as well. Finally, we discuss how our algorithm can be used to compute a relaxed notion of joins.
Type-Preserving Flow Analysis and Interprocedural Unboxing (Extended Version)
Venue: arXiv cs.PL 2012
Year: 2012

Interprocedural flow analysis can be used to eliminate otherwise unnecessary heap allocated objects (unboxing), and in previous work we have shown how to do so while maintaining correctness with respect to the garbage collector. In this paper, we extend the notion of flow analysis to incorporate types, enabling analysis and optimization of typed programs. We apply this typed analysis to specify a type preserving interprocedural unboxing optimization, and prove that the optimization preserves both type and GC safety along with program semantics. We also show that the unboxing optimization can be applied independently to separately compiled program modules, and prove via a contextual equivalence result that unboxing a module in isolation preserves program semantics.
Design and Implementation of IEEE 802.15.4 Mac Protocol on FPGA
Venue: arXiv cs.NI 2012
Year: 2012

The IEEE 802.15.4 is a wireless standard introduced for low power, low cost wireless communication with moderate data rates. In the next few years, it is expected that Low Rate Wireless Personal Area Networks (LR-WPAN) will be used in a wide variety of embedded applications, including home automation, industrial sensing and control, environmental monitoring and sensing. In these applications, numerous embedded devices running on batteries are distributed in an area communicating via wireless radios. This work presents a method which can be used for comparing current consumption of wireless data transfer embedded systems. This paper implements a small subset of the IEEE 802.15.4 protocol to achieve a point to point communication. The implemented protocol uses 802.15.4 MAC compliant data and acknowledgment packets. Current consumption is measured while doing one data packet transmission. Measurements are compared with existing work. IEEE 802.15.4 protocol implementation is done using Verilog language. Code implementation is done in such a manner so that it can be ported to any platform with minimal changes. It can also be modified to suit any special experimental setup requirements.
Blind Carrier Phase Recovery for General 2π/M-rotationally Symmetric Constellations
Venue: arXiv cs.IT 2012
Year: 2012

This paper introduces a novel blind carrier phase recovery estimator for general 2Π/M-rotationally symmetric constellations. This estimation method is a generalization of the non-data-aided (NDA) nonlinear Phase Metric Method (PMM) estimator already designed for general quadrature amplitude constellations. This unbiased estimator is seen here as a fourth order PMM then generalized to Mth order (Mth PMM) in such manner that it covers general 2Π/M-rotationally symmetric constellations such as PAM, QAM, PSK. Simulation results demonstrate the good performance of this Mth PMM estimation algorithm against competitive blind phase estimators already published for various modulation systems of practical interest.
Spread spectrum magnetic resonance imaging
Venue: arXiv cs.OH 2012
Year: 2012

We propose a novel compressed sensing technique to accelerate the magnetic resonance imaging (MRI) acquisition process. The method, coined spread spectrum MRI or simply s2MRI, consists of pre-modulating the signal of interest by a linear chirp before random k-space under-sampling, and then reconstructing the signal with non-linear algorithms that promote sparsity. The effectiveness of the procedure is theoretically underpinned by the optimization of the coherence between the sparsity and sensing bases. The proposed technique is thoroughly studied by means of numerical simulations, as well as phantom and in vivo experiments on a 7T scanner. Our results suggest that s2MRI performs better than state-of-the-art variable density k-space under-sampling approaches
Accomplish the Application Area in Cloud Computing
Venue: arXiv cs.NI 2012
Year: 2012

In the cloud computing application area of accomplish, we find the fact that cloud computing covers a lot of areas are its main asset. At a top level, it is an approach to IT where many users, some even from different companies get access to shared IT resources such as servers, routers and various file extensions, instead of each having their own dedicated servers. This offers many advantages like lower costs and higher efficiency. Unfortunately there have been some high profile incidents where some of the largest cloud providers have had outages and even lost data, and this underscores that it is important to have backup, security and disaster recovery capabilities. In education field, it gives better choice and flexibility to IT departments than others. The platform and applications you use can be on-premises, off-premises, or a combination of both, depending on your academic organization's needs. With cloud computing in education, you get powerful software and massive computing resources where and when you need them. Use cloud services to best combine: *On-demand computing and storage. *A familiar development experience with on-demand scalability. *Online services for anywhere, anytime access to powerful web-based tools.
Facticity as the amount of self-descriptive information in a data set
Venue: arXiv cs.IT 2012
Year: 2012

Using the theory of Kolmogorov complexity the notion of facticity ϕ(x) of a string is defined as the amount of self-descriptive information it contains. It is proved that (under reasonable assumptions: the existence of an empty machine and the availability of a faithful index) facticity is definite, i.e. random strings have facticity 0 and for compressible strings 0 < ϕ(x) < 1/2 |x| + O(1). Consequently facticity measures the tension in a data set between structural and ad-hoc information objectively. For binary strings there is a so-called facticity threshold that is dependent on their entropy. Strings with facticty above this threshold have no optimal stochastic model and are essentially computational. The shape of the facticty versus entropy plot coincides with the well-known sawtooth curves observed in complex systems. The notion of factic processes is discussed. This approach overcomes problems with earlier proposals to use two-part code to define the meaningfulness or usefulness of a data set.