OpenRaiser/Intern-Atlas huggingface dataset:
A O(E) Time Shortest Path Algorithm For Non Negative Weighted Undirected Graphs
Venue: arXiv cs.DS 2009
Year: 2009

In most of the shortest path problems like vehicle routing problems and network routing problems, we only need an efficient path between two points source and destination, and it is not necessary to calculate the shortest path from source to all other nodes. This paper concentrates on this very idea and presents an algorithm for calculating shortest path for (i) nonnegative weighted undirected graphs (ii) unweighted undirected graphs. The algorithm completes its execution in O(E) for all graphs except few in which longer path (in terms of number of edges) from source to some node makes it best selection for that node. The main advantage of the algorithms is its simplicity and it does not need complex data structures for implementations.
Biologically Inspired Execution Framework for Vulnerable Workflow Systems
Venue: arXiv cs.CR 2009
Year: 2009

The main objective of the research is to introduce a biologically inspired execution framework for workflow systems under threat due to some intrusion attack. Usually vulnerable systems need to be stop and put into wait state, hence to insure the data security and privacy while being recovered. This research ensures the availability of services and data to the end user by keeping the data security, privacy and integrity intact. To achieve the specified goals, the behavior of chameleons and concept of hibernation has been considered in combination. Hence the workflow systems become more robust using biologically inspired methods and remain available to the business consumers safely even in a vulnerable state.
A Simple Conceptual Generator for the Internet Graph
Venue: arXiv cs.NI 2009
Year: 2009

The evolution of the Internet during the last years, has lead to a dramatic increase of the size of its graph at the Autonomous System (AS) level. Soon - if not already - its size will make the latter impractical for use from the research community, e.g. for protocol testing. Reproducing a smaller size, snapshot of the AS graph is thus important. However, the first step towards this direction is to obtain the ability to faithfully reproduce the full AS topology. The objective of our work, is to create a generator able to accurately emulate and reproduce the distinctive properties of the Internet graph. Our approach is based on (a) the identification of the jellyfish-like structure [1] of the Internet and (b) the consideration of the peer-to-peer and customer-provider relations between ASs. We are the first to exploit the distinctive structure of the Internet graph together with utilizing the information provided by the AS relationships in order to create a tool with the aforementioned capabilities. Comparing our generator with the existing ones in the literature, the main difference is found on the fact that our tool does not try to satisfy specific metrics, but tries to remain faithful to the conceptual model of the Internet structure. In addition, our approach can lead to (i) the identification of important attributes and patterns in the Internet AS topology, as well as, (ii) the extraction of valuable information on the various relationships between ASs and their effect on the formulation of the Internet structure. We implement our graph generator and we evaluate it using the largest and most recent available dataset for the AS topology. Our evaluations, clearly show the ability of our tool to capture the structural properties of the Internet topology at the AS level with high accuracy.
Routing Technique Based on Clustering for Data Duplication Prevention in Wireless Sensor Network
Venue: arXiv cs.NI 2009
Year: 2009

Wireless Sensor Networks is important to nodes energy consumption for long activity of sensor nodes because nodes that compose sensor network are small size, and battery capacity is limited. For energy consumption decrease of sensor nodes, sensor networks routing technique is divided by flat routing and hierarchical routing technique. Specially, hierarchical routing technique is energy efficient routing protocol to pare down energy consumption of whole sensor nodes and to scatter energy consumption of sensor nodes by forming cluster and communicating with cluster head. but though hierarchical routing technique based on clustering is advantage more than flat routing technique, this is not used for reason that is not realistic. The reason that is not realistic is because hierarchical routing technique does not consider data transmission radius of sensor node in actually. so this paper propose realistic routing technique base on clustering.
Breast Cancer Detection Using Multilevel Thresholding
Venue: arXiv cs.CV 2009
Year: 2009

This paper presents an algorithm which aims to assist the radiologist in identifying breast cancer at its earlier stages. It combines several image processing techniques like image negative, thresholding and segmentation techniques for detection of tumor in mammograms. The algorithm is verified by using mammograms from Mammographic Image Analysis Society. The results obtained by applying these techniques are described.
Software Security Rules, SDLC Perspective
Venue: arXiv cs.SE 2009
Year: 2009

Software has become an integral part of everyday life. Everyday, millions of people perform transaction through internet, ATM, mobile phone, they send email and Egreetings, and use word processing and spreadsheet for various purpose. People use software bearing in mind that it is reliable and can be trust upon and the operation they perform is secured. Now, if these software have exploitable security hole then how can they be safe for use. Security brings value to software in terms of peoples trust. The value provided by secure software is of vital importance because many critical functions are entirely dependent on the software. That is why security is a serious topic which should be given proper attention during the entire SDLC, right from the beginning. For the proper implementation of security in the software, twenty one security rules are proposed in this paper along with validation results. It is found that by applying these rules as per given implementation mechanism, most of the vulnerabilities are eliminated in the software and a more secure software can be built.
Exception Agent Detection System for IP Spoofing Over Online Environments
Venue: arXiv cs.CR 2009
Year: 2009

Over the recent years, IP and email spoofing gained much importance for security concerns due to the current changes in manipulating the system performance in different online environments. Intrusion Detection System (IDS) has been used to secure these environments for sharing their data over network and host based IDS approaches. However, the rapid growth of intrusion events over Internet and local area network become responsible for the distribution of different threats and vulnerabilities in the computing systems. The current signature detection approach used by IDS, detects unclear actions based on analyzing and describing the action patterns such as time, text, password etc and has been faced difficulties in updating information, detect unknown novel attacks, maintenance of an IDS which is necessarily connected with analyzing and patching of security holes, and the lack of information on user privileges and attack signature structure. Thus, this paper proposes an EADS (Exception agent detection system) for securing the header information carried by IP over online environments. The study mainly concerns with the deployment of new technique for detecting and eliminating the unknown threats attacks during the data sharing over online environments.
A Way to Understand Various Patterns of Data Mining Techniques for Selected Domains
Venue: arXiv cs.DB 2009
Year: 2009

This has much in common with traditional work in statistics and machine learning. However, there are important new issues which arise because of the sheer size of the data. One of the important problem in data mining is the Classification-rule learning which involves finding rules that partition given data into predefined classes. In the data mining domain where millions of records and a large number of attributes are involved, the execution time of existing algorithms can become prohibitive, particularly in interactive applications.
Generalized Discriminant Analysis algorithm for feature reduction in Cyber Attack Detection System
Venue: arXiv cs.CR 2009
Year: 2009

This Generalized Discriminant Analysis (GDA) has provided an extremely powerful approach to extracting non linear features. The network traffic data provided for the design of intrusion detection system always are large with ineffective information, thus we need to remove the worthless information from the original high dimensional database. To improve the generalization ability, we usually generate a small set of features from the original input variables by feature extraction. The conventional Linear Discriminant Analysis (LDA) feature reduction technique has its limitations. It is not suitable for non linear dataset. Thus we propose an efficient algorithm based on the Generalized Discriminant Analysis (GDA) feature reduction technique which is novel approach used in the area of cyber attack detection. This not only reduces the number of the input features but also increases the classification accuracy and reduces the training and testing time of the classifiers by selecting most discriminating features. We use Artificial Neural Network (ANN) and C4.5 classifiers to compare the performance of the proposed technique. The result indicates the superiority of algorithm.
A New Computational Schema for Euphonic Conjunctions in Sanskrit Processing
Venue: arXiv cs.CL 2009
Year: 2009

Automated language processing is central to the drive to enable facilitated referencing of increasingly available Sanskrit E texts. The first step towards processing Sanskrit text involves the handling of Sanskrit compound words that are an integral part of Sanskrit texts. This firstly necessitates the processing of euphonic conjunctions or sandhis, which are points in words or between words, at which adjacent letters coalesce and transform. The ancient Sanskrit grammarian Panini's codification of the Sanskrit grammar is the accepted authority in the subject. His famed sutras or aphorisms, numbering approximately four thousand, tersely, precisely and comprehensively codify the rules of the grammar, including all the rules pertaining to sandhis. This work presents a fresh new approach to processing sandhis in terms of a computational schema. This new computational model is based on Panini's complex codification of the rules of grammar. The model has simple beginnings and is yet powerful, comprehensive and computationally lean.
Construction of a Non-2-colorable k-uniform Hypergraph with Few Edges
Venue: arXiv cs.DM 2009
Year: 2009

We show how to construct a non-2-colorable k-uniform hypergraph with (2^(1 + o(1)))^k edges. By the duality of hypergraphs and monotone k-CNF-formulas this gives an unsatisfiable monotone k-CNF with (2^(1 + o(1)))^k clauses
Digital Image Watermarking for Arbitrarily Shaped Objects Based On SA-DWT
Venue: arXiv cs.GR 2009
Year: 2009

Many image watermarking schemes have been proposed in recent years, but they usually involve embedding a watermark to the entire image without considering only a particular object in the image, which the image owner may be interested in. This paper proposes a watermarking scheme that can embed a watermark to an arbitrarily shaped object in an image. Before embedding, the image owner specifies an object of arbitrary shape that is of a concern to him. Then the object is transformed into the wavelet domain using in place lifting shape adaptive DWT(SADWT) and a watermark is embedded by modifying the wavelet coefficients. In order to make the watermark robust and transparent, the watermark is embedded in the average of wavelet blocks using the visual model based on the human visual system. Wavelet coefficients n least significant bits (LSBs) are adjusted in concert with the average. Simulation results shows that the proposed watermarking scheme is perceptually invisible and robust against many attacks such as lossy compression (e.g.JPEG, JPEG2000), scaling, adding noise, filtering, etc.
Combining Training and Quantized Feedback in Multi-Antenna Reciprocal Channels
Venue: arXiv cs.IT 2009
Year: 2009

The communication between a multiple-antenna transmitter and multiple receivers (users) with either a single or multiple-antenna each can be significantly enhanced by providing the channel state information at the transmitter (CSIT) of the users, as this allows for scheduling, beamforming and multiuser multiplexing gains. The traditional view on how to enable CSIT has been as follows so far: In time-division duplexed (TDD) systems, uplink (UL) and downlink (DL) channel reciprocity allows the use of a training sequence in the UL direction, which is exploited to obtain an UL channel estimate. This estimate is in turn recycled in the next downlink slot. In frequency-division duplexed (FDD) systems, which lack the UL and DL reciprocity, the CSIT is provided via the use of a dedicated feedback link of limited capacity between the receivers and the transmitter. In this paper, we focus on TDD systems and put this classical approach in question. In particular, we show that the traditional TDD setup above fails to fully exploit the channel reciprocity in its true sense. In fact, we show that the system can benefit from a combined CSIT acquisition strategy mixing the use of limited feedback and that of a training sequence. This combining gives rise to a very interesting joint estimation and detection problem for which we propose two iterative algorithms. An outage rate based framework is also developed which gives the optimal resource split between training and feedback. We demonstrate the potential of this hybrid combining in terms of the improved CSIT quality under a global training and feedback resource constraint.
Technology Integration around the Geographic Information: A State of the Art
Venue: arXiv cs.CY 2009
Year: 2009

One of the elements that have popularized and facilitated the use of geographical information on a variety of computational applications has been the use of Web maps; this has opened new research challenges on different subjects, from locating places and people, the study of social behavior or the analyzing of the hidden structures of the terms used in a natural language query used for locating a place. However, the use of geographic information under technological features is not new, instead it has been part of a development and technological integration process. This paper presents a state of the art review about the application of geographic information under different approaches: its use on location based services, the collaborative user participation on it, its contextual-awareness, its use in the Semantic Web and the challenges of its use in natural languge queries. Finally, a prototype that integrates most of these areas is presented.
Domain Decomposition Based High Performance Parallel Computing
Venue: arXiv cs.DC 2009
Year: 2009

The study deals with the parallelization of finite element based Navier-Stokes codes using domain decomposition and state-ofart sparse direct solvers. There has been significant improvement in the performance of sparse direct solvers. Parallel sparse direct solvers are not found to exhibit good scalability. Hence, the parallelization of sparse direct solvers is done using domain decomposition techniques. A highly efficient sparse direct solver PARDISO is used in this study. The scalability of both Newton and modified Newton algorithms are tested.
Système de Communications Sans Fil Très Haut Débit à 60 GHz
Venue: arXiv cs.NI 2009
Year: 2009

This paper presents the study and the realization at IETR of a high data rate 60 GHz wireless communications system. The system uses a simple single carrier architecture. The receiver architecture is based on a differential demodulation which minimizes the intersymbol interference (ISI) effect and a signal processing unit composed of a joint frame and byte synchronization block and a conventional RS (255, 239) decoder. The byte synchronization technique provides a high preamble detection probability and a very small value of the false detection probability. First measurement results show a good communication link quality in line of sight environments with directional antennas.
Machine Learning: When and Where the Horses Went Astray?
Venue: arXiv cs.AI 2009
Year: 2009

Machine Learning is usually defined as a subfield of AI, which is busy with information extraction from raw data sets. Despite of its common acceptance and widespread recognition, this definition is wrong and groundless. Meaningful information does not belong to the data that bear it. It belongs to the observers of the data and it is a shared agreement and a convention among them. Therefore, this private information cannot be extracted from the data by any means. Therefore, all further attempts of Machine Learning apologists to justify their funny business are inappropriate.
Co-word Analysis using the Chinese Character Set
Venue: arXiv cs.CL 2009
Year: 2009

Until recently, Chinese texts could not be studied using co-word analysis because the words are not separated by spaces in Chinese (and Japanese). A word can be composed of one or more characters. The online availability of programs that separate Chinese texts makes it possible to analyze them using semantic maps. Chinese characters contain not only information, but also meaning. This may enhance the readability of semantic maps. In this study, we analyze 58 words which occur ten or more times in the 1652 journal titles of the China Scientific and Technical Papers and Citations Database. The word occurrence matrix is visualized and factor-analyzed.
A Near-Optimal Scheme for TCP ACK Pacing to Maintain Throughput in Wireless Networks
Venue: arXiv cs.NI 2009
Year: 2009

The advent of fourth generation technologies in wireless networks and the rapid growth of 3G have heralded an era that will require researchers to find reliable and easily implement-able solutions to the problem of poor TCP performance in the wireless environment. Since a large part of the Internet is TCP-based, solving this problem will be instrumental in determining if the move from wired to wireless will be seamless or not. This paper proposes a scheme that uses the base station's ability to predict the time at which the link may be going down and to estimate the period for which the mobile would be unreachable due to conditions like fading. By using cross-layer and ACK pacing algorithms, the base station prevents the fixed host from timing out while waiting for ACKs from the mobile. This in turn prevents TCP on the fixed host from bringing down the throughput drastically due to temporary network conditions, caused by mobility or the unreliability of wireless links. Experimental results indicate a reasonable increase in throughput when the ACK holding scheme is used.
A Novel Cross Layer Scheme for Multi-Channel Hybrid Cognitive Ad-hoc Networks
Venue: arXiv cs.NI 2009
Year: 2009

A special scenario of the topology in the hybrid Cognitive Ad-hoc networks is studied and a novel cross layer scheme is proposed in this paper. The proposed scheme integrated the attributes both of the new performance evaluation machine check time metric and the topology space in special scenario. The topology and power consumption of each node can all be optimized due to the minimum link occupation with the help of this scheme. Simulation results show that the novel scheme can give schedule guarantee to the multi-channel networks in the variable node loads and transmission powers, and make the node stable to support multi-hops at the same time.
On the Pricing of Recommendations and Recommending Strategically
Venue: arXiv cs.GT 2009
Year: 2009

If you recommend a product to me and I buy it, how much should you be paid by the seller? And if your sole interest is to maximize the amount paid to you by the seller for a sequence of recommendations, how should you recommend optimally if I become more inclined to ignore you with each irrelevant recommendation you make? Finding an answer to these questions is a key challenge in all forms of marketing that rely on and explore social ties; ranging from personal recommendations to viral marketing. In the first part of this paper, we show that there can be no pricing mechanism that is "truthful" with respect to the seller, and we use solution concepts from coalitional game theory, namely the Core, the Shapley Value, and the Nash Bargaining Solution, to derive provably "fair" prices for settings with one or multiple recommenders. We then investigate pricing mechanisms for the setting where recommenders have different "purchase arguments". Here we show that it might be beneficial for the recommenders to withhold some of their arguments, unless anonymity-proof solution concepts, such as the anonymity-proof Shapley value, are used. In the second part of this paper, we analyze the setting where the recommendee loses trust in the recommender for each irrelevant recommendation. Here we prove that even if the recommendee regains her initial trust on each successful recommendation, the expected total profit the recommender can make over an infinite period is bounded. This can only be overcome when the recommendee also incrementally regains trust during periods without any recommendation. Here, we see an interesting connection to "banner blindness", suggesting that showing fewer ads can lead to a higher long-term profit.
Sequence Folding, Lattice Tiling, and Multidimensional Coding
Venue: arXiv cs.IT 2009
Year: 2009

Folding a sequence $S$ into a multidimensional box is a well-known method which is used as a multidimensional coding technique. The operation of folding is generalized in a way that the sequence $S$ can be folded into various shapes and not just a box. The new definition of folding is based on a lattice tiling for the given shape $\cS$ and a direction in the $D$-dimensional integer grid. Necessary and sufficient conditions that a lattice tiling for $\cS$ combined with a direction define a folding of a sequence into $\cS$ are derived. The immediate and most impressive application is some new lower bounds on the number of dots in two-dimensional synchronization patterns. This can be also generalized for multidimensional synchronization patterns. The technique and its application for two-dimensional synchronization patterns, raise some interesting problems in discrete geometry. We will also discuss these problems. It is also shown how folding can be used to construct multidimensional error-correcting codes. Finally, by using the new definition of folding, multidimensional pseudo-random arrays with various shapes are generated.
Standards for Language Resources
Venue: arXiv cs.CL 2009
Year: 2009

The goal of this paper is two-fold: to present an abstract data model for linguistic annotations and its implementation using XML, RDF and related standards; and to outline the work of a newly formed committee of the International Standards Organization (ISO), ISO/TC 37/SC 4 Language Resource Management, which will use this work as its starting point.
Expressing the Behavior of Three Very Different Concurrent Systems by Using Natural Extensions of Separation Logic
Venue: arXiv cs.LO 2009
Year: 2009

Separation Logic is a non-classical logic used to verify pointer-intensive code. In this paper, however, we show that Separation Logic, along with its natural extensions, can also be used as a specification language for concurrent-system design. To do so, we express the behavior of three very different concurrent systems: a Subway, a Stopwatch, and a 2x2 Switch. The Subway is originally implemented in LUSTRE, the Stopwatch in Esterel, and the 2x2 Switch in Bluespec.