id
stringlengths
9
10
submitter
stringlengths
2
52
authors
stringlengths
4
6.51k
title
stringlengths
4
246
comments
stringlengths
1
523
journal-ref
stringlengths
4
345
doi
stringlengths
11
120
report-no
stringlengths
2
243
categories
stringlengths
5
98
license
stringclasses
9 values
abstract
stringlengths
33
3.33k
versions
list
update_date
timestamp[s]
authors_parsed
list
prediction
stringclasses
1 value
probability
float64
0.95
1
1208.0084
Jaroslaw Szlichta
Jaroslaw Szlichta, Parke Godfrey, Jarek Gryz
Fundamentals of Order Dependencies
VLDB2012
Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 11, pp. 1220-1231 (2012)
null
null
cs.DB
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Dependencies have played a significant role in database design for many years. They have also been shown to be useful in query optimization. In this paper, we discuss dependencies between lexicographically ordered sets of tuples. We introduce formally the concept of order dependency and present a set of axioms (inference rules) for them. We show how query rewrites based on these axioms can be used for query optimization. We present several interesting theorems that can be derived using the inference rules. We prove that functional dependencies are subsumed by order dependencies and that our set of axioms for order dependencies is sound and complete.
[ { "version": "v1", "created": "Wed, 1 Aug 2012 03:51:05 GMT" } ]
2012-08-02T00:00:00
[ [ "Szlichta", "Jaroslaw", "" ], [ "Godfrey", "Parke", "" ], [ "Gryz", "Jarek", "" ] ]
new_dataset
0.988225
1208.0259
Pedro Hipola
Antonio Munoz-Canavate, Pedro Hipola
Electronic administration in Spain: from its beginnings to the present
null
Government Information Quarterly, vol 28, 1, January 2011, pp. 74-90
10.1016/j.giq.2010.05.008
null
cs.CY cs.DL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This study presents the basic lines of electronic administration in Spain. The complexity of the Spanish political-administrative system makes such a study challenging, in view of the considerable degree of autonomy and competences of the regional administrative bodies and local agencies with respect to the central government, the former being more visible in the 17 regions of Spain. Nonetheless, the central government maintains a series of legal instruments that allow a certain common framework of action to be imposed, aside from what is put into effect through diverse programs aimed precisely to develop common tools for the regions and municipalities of Spain. After an introduction that provides some necessary background, this study describes the legislative framework in which Spain's electronic administrative system has developed. The data included in the study refer to investment in information and communication technologies (ICT) and the services offered by the different Administrations on the internet; internet access by citizens, homes, businesses, and employees, as well as the interactivity existing with administrations by means of the internet; the origins and rise of various political initiatives of the Central Government involving electronic administration; and finally, the situation of civil service personnel, as catalysts of the success of Information Society in the Public Administration within Spain.
[ { "version": "v1", "created": "Wed, 1 Aug 2012 16:02:35 GMT" } ]
2012-08-02T00:00:00
[ [ "Munoz-Canavate", "Antonio", "" ], [ "Hipola", "Pedro", "" ] ]
new_dataset
0.99009
1208.0275
K. Selcuk Candan
K. Sel\c{c}uk Candan, Rosaria Rossini, Maria Luisa Sapino, Xiaolan Wang
sDTW: Computing DTW Distances using Locally Relevant Constraints based on Salient Feature Alignments
VLDB2012
Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 11, pp. 1519-1530 (2012)
null
null
cs.DB
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Many applications generate and consume temporal data and retrieval of time series is a key processing step in many application domains. Dynamic time warping (DTW) distance between time series of size N and M is computed relying on a dynamic programming approach which creates and fills an NxM grid to search for an optimal warp path. Since this can be costly, various heuristics have been proposed to cut away the potentially unproductive portions of the DTW grid. In this paper, we argue that time series often carry structural features that can be used for identifying locally relevant constraints to eliminate redundant work. Relying on this observation, we propose salient feature based sDTW algorithms which first identify robust salient features in the given time series and then find a consistent alignment of these to establish the boundaries for the warp path search. More specifically, we propose alternative fixed core&adaptive width, adaptive core&fixed width, and adaptive core&adaptive width strategies which enforce different constraints reflecting the high level structural characteristics of the series in the data set. Experiment results show that the proposed sDTW algorithms help achieve much higher accuracy in DTWcomputation and time series retrieval than fixed core & fixed width algorithms that do not leverage local features of the given time series.
[ { "version": "v1", "created": "Wed, 1 Aug 2012 16:49:49 GMT" } ]
2012-08-02T00:00:00
[ [ "Candan", "K. Selçuk", "" ], [ "Rossini", "Rosaria", "" ], [ "Sapino", "Maria Luisa", "" ], [ "Wang", "Xiaolan", "" ] ]
new_dataset
0.979949
1208.0287
Jens Dittrich
Jens Dittrich, Jorge-Arnulfo Quian\'e-Ruiz, Stefan Richter, Stefan Schuh, Alekh Jindal, J\"org Schad
Only Aggressive Elephants are Fast Elephants
VLDB2012
Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 11, pp. 1591-1602 (2012)
null
null
cs.DB
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Yellow elephants are slow. A major reason is that they consume their inputs entirely before responding to an elephant rider's orders. Some clever riders have trained their yellow elephants to only consume parts of the inputs before responding. However, the teaching time to make an elephant do that is high. So high that the teaching lessons often do not pay off. We take a different approach. We make elephants aggressive; only this will make them very fast. We propose HAIL (Hadoop Aggressive Indexing Library), an enhancement of HDFS and Hadoop MapReduce that dramatically improves runtimes of several classes of MapReduce jobs. HAIL changes the upload pipeline of HDFS in order to create different clustered indexes on each data block replica. An interesting feature of HAIL is that we typically create a win-win situation: we improve both data upload to HDFS and the runtime of the actual Hadoop MapReduce job. In terms of data upload, HAIL improves over HDFS by up to 60% with the default replication factor of three. In terms of query execution, we demonstrate that HAIL runs up to 68x faster than Hadoop. In our experiments, we use six clusters including physical and EC2 clusters of up to 100 nodes. A series of scalability experiments also demonstrates the superiority of HAIL.
[ { "version": "v1", "created": "Wed, 1 Aug 2012 17:20:18 GMT" } ]
2012-08-02T00:00:00
[ [ "Dittrich", "Jens", "" ], [ "Quiané-Ruiz", "Jorge-Arnulfo", "" ], [ "Richter", "Stefan", "" ], [ "Schuh", "Stefan", "" ], [ "Jindal", "Alekh", "" ], [ "Schad", "Jörg", "" ] ]
new_dataset
0.970755
1203.4309
Muhammad Anshari Mr
Muhammad Anshari, Mohammad Nabil Almunawar, and Patrick Kim Cheng Low
CRM 2.0 within E-Health Systems: Towards Achieving Health Literacy & Customer Satisfaction
Journal of Development Informatics Vol.1, No. 1, 2012. arXiv admin note: text overlap with arXiv:1203.3923, arXiv:1204.3691, arXiv:1204.3685, arXiv:1203.3919
null
null
null
cs.OH
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Customer Relationship Management (CRM) within healthcare organization can be viewed as a strategy to attract new customers and retaining them throughout their entire lifetime of relationships. At the same time, the advancement of Web technology known as Web 2.0 plays a significant part in the CRM transition which drives social change that impacts all institutions including business and healthcare organizations. This new paradigm has been named as Social CRM or CRM 2.0 because it is based on Web 2.0. We conducted survey to examine the features of CRM 2.0 in healthcare scenario to the customer in Brunei Darussalam. We draw the conclusion that the CRM 2.0 in healthcare technologies has brought a possibility to extend the services of e-health by enabling patients, patient's families, and community at large to participate more actively in the process of health education; it helps improve health literacy through empowerment, social networking process, and online health educator. This paper is based on our works presented at ICID 2011.
[ { "version": "v1", "created": "Tue, 20 Mar 2012 03:08:48 GMT" }, { "version": "v2", "created": "Tue, 31 Jul 2012 19:03:29 GMT" } ]
2012-08-01T00:00:00
[ [ "Anshari", "Muhammad", "" ], [ "Almunawar", "Mohammad Nabil", "" ], [ "Low", "Patrick Kim Cheng", "" ] ]
new_dataset
0.974429
1207.7222
Akira Shiozaki
Akira Shiozaki
Multi-Dimensional Nonsystematic Reed-Solomon Codes
8 pages, 5 figures
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper proposes a new class of multi-dimensional nonsystematic Reed-Solomon codes that are constructed based on the multi-dimensional Fourier transform over a finite field. The proposed codes are the extension of the nonsystematic Reed-Solomon codes to multi-dimension. This paper also discusses the performance of the multi-dimensional nonsystematic Reed-Solomon codes.
[ { "version": "v1", "created": "Tue, 31 Jul 2012 12:23:35 GMT" } ]
2012-08-01T00:00:00
[ [ "Shiozaki", "Akira", "" ] ]
new_dataset
0.970322
1110.0886
David Kao
David T.-H. Kao and Ashutosh Sabharwal
Two-User Interference Channels with Local Views: On Capacity Regions of TDM-Dominating Policies
revised 22 Jun, including updated title
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We study the capacity regions of two-user interference channels where transmitters base their transmission schemes on local views of the channel state. Under the local view model, each transmitter knows only a subset of the four channel gains, which may be mismatched from the other transmitter. We consider a set of seven local views, and find that for five out of the seven local views, TDM is sufficient to achieve the qualified notion of capacity region for the linear deterministic interference channel which approximates the Gaussian interference channel. For these five local views, the qualified capacity result implies that no policy can achieve a rate point outside the TDM region without inducing a corner case of sub-TDM performance in another channel state. The common trait shared by the two remaining local views - those with the potential to outperform TDM - is transmitter knowledge of the outgoing interference link accompanied by some common knowledge of state, emphasizing their importance in creating opportunities to coordinate usage of more advanced schemes. Our conclusions are extended to bounded gap characterizations of the capacity region for the Gaussian interference channel.
[ { "version": "v1", "created": "Wed, 5 Oct 2011 03:36:35 GMT" }, { "version": "v2", "created": "Sun, 29 Jul 2012 19:39:22 GMT" } ]
2012-07-31T00:00:00
[ [ "Kao", "David T. -H.", "" ], [ "Sabharwal", "Ashutosh", "" ] ]
new_dataset
0.996405
1207.6685
Christoph Benzmueller
Christoph Benzmueller and Thomas Raths
FMLtoHOL (version 1.0): Automating First-order Modal Logics with LEO-II and Friends
4 pages
null
null
null
cs.LO cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
A converter from first-order modal logics to classical higher- order logic is presented. This tool enables the application of off-the-shelf higher-order theorem provers and model finders for reasoning within first- order modal logics. The tool supports logics K, K4, D, D4, T, S4, and S5 with respect to constant, varying and cumulative domain semantics.
[ { "version": "v1", "created": "Sat, 28 Jul 2012 07:03:16 GMT" } ]
2012-07-31T00:00:00
[ [ "Benzmueller", "Christoph", "" ], [ "Raths", "Thomas", "" ] ]
new_dataset
0.99453
1207.6831
Mourad Kmimech
Fourati Farah
Une approche IDM de transformation exog\`ene de Wright vers Ada
null
null
null
null
cs.SE
http://creativecommons.org/licenses/publicdomain/
The formal ADL Wright allows to describe the structural and behavioral aspects of abstract software architecture. The behavioral aspects are described in CSP and checked using the model-checker FDR. While the ADL Wright does not offer any means to realize such architectures abstract. The objective of this work is to open up the ADL Wright for Ada through an automated approach based on MDE. To achieve this, we have developed two Ecore meta-models: the meta-model Wright and the partial meta-model of Ada. Moreover, we have designed, built and tested our program Wright2Ada written in ATL to transform software architecture described in Wright to a concurrent program in Ada.
[ { "version": "v1", "created": "Tue, 10 Jul 2012 15:00:32 GMT" } ]
2012-07-31T00:00:00
[ [ "Farah", "Fourati", "" ] ]
new_dataset
0.958858
1205.1737
Rourab Paul
Rourab Paul, Sangeet Saha, Jkm Sadique Uz Zaman, Suman Das, Amlan Chakrabarti and Ranjan Ghosh
A simple 1-byte 1-clock RC4 design and its efficient implementation in FPGA coprocessor for secured ethernet communication
Proceedings of National Workshop on Cryptology 2012 Organized by CRSI(http://crsind.com/),INDIA Held at VIT,INDIA (06.08.12 - 08.08.12)
null
null
null
cs.AR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In the field of cryptography till date the 1-byte in 1-clock is the best known RC4 hardware design [1], while the 1-byte in 3clocks is the best known implementation [2,3]. The design algorithm in [1] considers two consecutive bytes together and processes them in 2 clocks. The design of 1-byte in 3-clocks is too much modular and clock hungry. In this paper considering the RC4 algorithm, as it is, a simpler RC4 hardware design providing higher throughput is proposed in which 1-byte is processed in 1-clock. In the design two sequential tasks are executed as two independent events during rising and falling edges of the same clock and the swapping is directly executed using a MUX-DEMUX combination. The power consumed in behavioral and structural designs of RC4 are estimated and a power optimization technique is proposed. The NIST statistical test suite is run on RC4 key streams in order to know its randomness property. The encryption and decryption designs are respectively embedded on two FPGA boards with RC4 in a custom coprocessor followed by Ethernet communication.
[ { "version": "v1", "created": "Tue, 8 May 2012 16:30:40 GMT" }, { "version": "v2", "created": "Fri, 27 Jul 2012 15:15:34 GMT" } ]
2012-07-30T00:00:00
[ [ "Paul", "Rourab", "" ], [ "Saha", "Sangeet", "" ], [ "Zaman", "Jkm Sadique Uz", "" ], [ "Das", "Suman", "" ], [ "Chakrabarti", "Amlan", "" ], [ "Ghosh", "Ranjan", "" ] ]
new_dataset
0.999625
1207.6445
Shang-Pin Sheng
Shang-Pin Sheng, Mingyan Liu
Profit Incentive In A Secondary Spectrum Market: A Contract Design Approach
12 pages, 9 figures
null
null
null
cs.CE cs.GT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper we formulate a contract design problem where a primary license holder wishes to profit from its excess spectrum capacity by selling it to potential secondary users/buyers. It needs to determine how to optimally price the excess spectrum so as to maximize its profit, knowing that this excess capacity is stochastic in nature, does not come with exclusive access, and cannot provide deterministic service guarantees to a buyer. At the same time, buyers are of different {\em types}, characterized by different communication needs, tolerance for the channel uncertainty, and so on, all of which a buyer's private information. The license holder must then try to design different contracts catered to different types of buyers in order to maximize its profit. We address this problem by adopting as a reference a traditional spectrum market where the buyer can purchase exclusive access with fixed/deterministic guarantees. We fully characterize the optimal solution in the cases where there is a single buyer type, and when multiple types of buyers share the same, known channel condition as a result of the primary user activity. In the most general case we construct an algorithm that generates a set of contracts in a computationally efficient manner, and show that this set is optimal when the buyer types satisfy a monotonicity condition.
[ { "version": "v1", "created": "Fri, 27 Jul 2012 04:25:02 GMT" } ]
2012-07-30T00:00:00
[ [ "Sheng", "Shang-Pin", "" ], [ "Liu", "Mingyan", "" ] ]
new_dataset
0.9899
1207.6452
Frank Ruskey
Khalegh Mamakani and Frank Ruskey
A New Rose : The First Simple Symmetric 11-Venn Diagram
null
null
null
null
cs.CG math.CO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
A symmetric Venn diagram is one that is invariant under rotation, up to a relabeling of curves. A simple Venn diagram is one in which at most two curves intersect at any point. In this paper we introduce a new property of Venn diagrams called crosscut symmetry, which is related to dihedral symmetry. Utilizing a computer search restricted to crosscut symmetry we found many simple symmetric Venn diagrams with 11 curves. This answers an existence question that has been open since the 1960's. The first such diagram that was discovered is shown here.
[ { "version": "v1", "created": "Fri, 27 Jul 2012 05:57:49 GMT" } ]
2012-07-30T00:00:00
[ [ "Mamakani", "Khalegh", "" ], [ "Ruskey", "Frank", "" ] ]
new_dataset
0.999279
1207.6379
Jose Bento
Jos\'e Bento, Nadia Fawaz, Andrea Montanari, Stratis Ioannidis
Identifying Users From Their Rating Patterns
Winner of the 2011 Challenge on Context-Aware Movie Recommendation (RecSys 2011 - CAMRa2011)
null
null
null
cs.IR cs.LG stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper reports on our analysis of the 2011 CAMRa Challenge dataset (Track 2) for context-aware movie recommendation systems. The train dataset comprises 4,536,891 ratings provided by 171,670 users on 23,974$ movies, as well as the household groupings of a subset of the users. The test dataset comprises 5,450 ratings for which the user label is missing, but the household label is provided. The challenge required to identify the user labels for the ratings in the test set. Our main finding is that temporal information (time labels of the ratings) is significantly more useful for achieving this objective than the user preferences (the actual ratings). Using a model that leverages on this fact, we are able to identify users within a known household with an accuracy of approximately 96% (i.e. misclassification rate around 4%).
[ { "version": "v1", "created": "Thu, 26 Jul 2012 19:27:03 GMT" } ]
2012-07-27T00:00:00
[ [ "Bento", "José", "" ], [ "Fawaz", "Nadia", "" ], [ "Montanari", "Andrea", "" ], [ "Ioannidis", "Stratis", "" ] ]
new_dataset
0.958287
1207.5856
Yue Wu
Yue Wu, Sos S. Agaian and Joseph P. Noonan
Sudoku Associated Two Dimensional Bijections for Image Scrambling
30 pages, 13 figures
null
null
null
cs.CR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Sudoku puzzles are now popular among people in many countries across the world with simple constraints that no repeated digits in each row, each column, or each block. In this paper, we demonstrate that the Sudoku configuration provides us a new alternative way of matrix element representation by using block-grid pair besides the conventional row-column pair. Moreover, we discover six more matrix element representations by using row-digit pair, digit-row pair, column-digit pair, digit-column pair, block-digit pair, and digit-block pair associated with a Sudoku matrix. These parametric Sudoku associated matrix element representations not only allow us to denote matrix elements in secret ways, but also provide us new parametric two-dimensional bijective mappings. We study these two-dimensional bijections in the problem of image scrambling and propose a simple but effective Sudoku Associated Image Scrambler only using Sudoku associated two dimensional bijections for image scrambling without bandwidth expansion. Our simulation results over a wide collection of image types and contents demonstrate the effectiveness and robustness of the proposed method. Scrambler performance analysis with comparisons to peer algorithms under various investigation methods, including human visual inspections, gray degree of scrambling, autocorrelation coefficient of adjacent pixels, and key space and key sensitivities, suggest that the proposed method outperforms or at least reaches state-of-the-art. Similar scrambling ideas are also applicable to other digital data forms such as audio and video.
[ { "version": "v1", "created": "Wed, 25 Jul 2012 00:14:50 GMT" } ]
2012-07-26T00:00:00
[ [ "Wu", "Yue", "" ], [ "Agaian", "Sos S.", "" ], [ "Noonan", "Joseph P.", "" ] ]
new_dataset
0.988371
1207.5990
Mehdi Ahmed-Nacer
Mehdi Ahmed-Nacer (INRIA Lorraine - LORIA), St\'ephane Martin (INRIA Lorraine - LORIA), Pascal Urso (INRIA Lorraine - LORIA)
File system on CRDT
null
null
null
null
cs.DC cs.DB
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this report we show how to manage a distributed hierarchical structure representing a file system. This structure is optimistically replicated, each user work on his local replica, and updates are sent to other replica. The different replicas eventually observe same view of file systems. At this stage, conflicts between updates are very common. We claim that conflict resolution should rely as little as possible on users. In this report we propose a simple and modular solution to resolve these problems and maintain data consistency.
[ { "version": "v1", "created": "Wed, 25 Jul 2012 13:50:08 GMT" } ]
2012-07-26T00:00:00
[ [ "Ahmed-Nacer", "Mehdi", "", "INRIA Lorraine - LORIA" ], [ "Martin", "Stéphane", "", "INRIA\n Lorraine - LORIA" ], [ "Urso", "Pascal", "", "INRIA Lorraine - LORIA" ] ]
new_dataset
0.970546
1207.5560
Jeffrey Jacobs
Jeffrey Power Jacobs, James Reggia
Evolving Musical Counterpoint: The Chronopoint Musical Evolution System
6 pages, 6 figures
Proceedings of the First International Workshop on Evolutionary Music, 2011 IEEE Congress on Evolutionary Computation, 6-11 (2011)
null
null
cs.SD cs.AI cs.NE
http://creativecommons.org/licenses/by-nc-sa/3.0/
Musical counterpoint, a musical technique in which two or more independent melodies are played simultaneously with the goal of creating harmony, has been around since the baroque era. However, to our knowledge computational generation of aesthetically pleasing linear counterpoint based on subjective fitness assessment has not been explored by the evolutionary computation community (although generation using objective fitness has been attempted in quite a few cases). The independence of contrapuntal melodies and the subjective nature of musical aesthetics provide an excellent platform for the application of genetic algorithms. In this paper, a genetic algorithm approach to generating contrapuntal melodies is explained, with a description of the various musical heuristics used and of how variable-length chromosome strings are used to avoid generating "jerky" rhythms and melodic phrases, as well as how subjectivity is incorporated into the algorithm's fitness measures. Next, results from empirical testing of the algorithm are presented, with a focus on how a user's musical sophistication influences their experience. Lastly, further musical and compositional applications of the algorithm are discussed along with planned future work on the algorithm.
[ { "version": "v1", "created": "Mon, 23 Jul 2012 23:25:36 GMT" } ]
2012-07-25T00:00:00
[ [ "Jacobs", "Jeffrey Power", "" ], [ "Reggia", "James", "" ] ]
new_dataset
0.991992
1207.5723
Golnaz Badkobeh
Golnaz Badkobeh and Maxime Crochemore
Fewest repetitions in infinite binary words
null
null
null
null
cs.DM
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
A square is the concatenation of a nonempty word with itself. A word has period p if its letters at distance p match. The exponent of a nonempty word is the quotient of its length over its smallest period. In this article we give a proof of the fact that there exists an infinite binary word which contains finitely many squares and simultaneously avoids words of exponent larger than 7/3. Our infinite word contains 12 squares, which is the smallest possible number of squares to get the property, and 2 factors of exponent 7/3. These are the only factors of exponent larger than 2. The value 7/3 introduces what we call the finite-repetition threshold of the binary alphabet. We conjecture it is 7/4 for the ternary alphabet, like its repetitive threshold.
[ { "version": "v1", "created": "Tue, 24 Jul 2012 15:20:47 GMT" } ]
2012-07-25T00:00:00
[ [ "Badkobeh", "Golnaz", "" ], [ "Crochemore", "Maxime", "" ] ]
new_dataset
0.999709
1207.5736
Sanjay Singh
A. Divya and Sanjay Singh
Differentiated QoS with Modified C/I Based Scheduling Algorithm
14 pages, 8 figures, Preprint submitted to 2nd world congress on Information & Communication Technologies (WICT 2012), Trivandrum
null
null
null
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Second-generation (2G) digital cellular systems constitute the majority of cellular communication deployed today. A variety of services of 2G systems has increased significantly and this will continue to grow even further in the emerging third-generation (3G) systems. Universal Mobile Telecommunication System (UMTS) is a third-generation mobile communications system which uses the Wide-Band Code Division Multiple Access (WCDMA) technique to support a wide variety of services, like speech, video telephony, Internet browsing, etc. These services require a wide range of Quality of Service (QoS) requirements. QoS is an important issue as the number of multimedia services increases day by day. Differentiated QoS methods allow the differentiation of users based on their priority levels and channel conditions so that the network can allocate the bandwidth for a particular request based on the QoS requirements. These requirements are controlled by Radio Resource Management (RRM) mechanisms. In this paper we have proposed two RRM algorithms which are modification to the existing scheduling algorithms. One is Prioritized C/I scheduling, which takes the priorities into consideration, and this algorithm serves the user with highest priority. Other algorithm is Modified Inverse C/I scheduling, which takes channel conditions into consideration and serves the users in degraded conditions, thereby improving QoS. The performance evaluation of two algorithms is done with EURANE extensions for NS-2. Simulation results shows the improvement in QoS for the users who are at equidistance from Base Station (BS) but requesting for different services by implementing Prioritized C/I scheduling and also for the users who are in degraded conditions by implementing Modified Inverse C/I scheduling when compared to Max C/I and Inverse C/I scheduling algorithm respectively.
[ { "version": "v1", "created": "Tue, 24 Jul 2012 16:07:24 GMT" } ]
2012-07-25T00:00:00
[ [ "Divya", "A.", "" ], [ "Singh", "Sanjay", "" ] ]
new_dataset
0.995219
1207.5117
Mahyuddin K. M. Nasution
Mahyuddin K. M. Nasution
Algebraic on Magic Square of Odd Order n
8 pages, Proceedings of The 1st IMT-GT Regional Conference on Mathematics, Statistics and Their Application, Toba Lake, Sumatera Utara, Indonesia: 29-36
null
null
null
cs.DM math.CO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper aims to address the relation between a magic square of odd order $n$ and a group, and their properties. By the modulo number $n$, we construct entries for each table from initial table of magic square with large number $n^2$. Generalization of the underlying idea is presented, we obtain unique group, and we also prove variants of the main results for magic cubes.
[ { "version": "v1", "created": "Sat, 21 Jul 2012 10:28:29 GMT" } ]
2012-07-24T00:00:00
[ [ "Nasution", "Mahyuddin K. M.", "" ] ]
new_dataset
0.997788
1207.5138
Raja Jitendra Nayaka Mr.
Raja Jitendra Nayaka, R. C. Biradar
Ethernet Packet Processor for SoC Application
The International Workshop Of Information Technology, Control And Automation (Itca-2012), Sl.No.27. Proceedings In Computer Science & Information Technology (Cs & It) Series
null
null
ReportNo27
cs.AR cs.NI
http://creativecommons.org/licenses/by/3.0/
As the demand for Internet expands significantly in numbers of users, servers, IP addresses, switches and routers, the IP based network architecture must evolve and change. The design of domain specific processors that require high performance, low power and high degree of programmability is the bottleneck in many processor based applications. This paper describes the design of ethernet packet processor for system-on-chip (SoC) which performs all core packet processing functions, including segmentation and reassembly, packetization classification, route and queue management which will speedup switching/routing performance. Our design has been configured for use with multiple projects ttargeted to a commercial configurable logic device the system is designed to support 10/100/1000 links with a speed advantage. VHDL has been used to implement and simulated the required functions in FPGA.
[ { "version": "v1", "created": "Sat, 21 Jul 2012 13:47:55 GMT" } ]
2012-07-24T00:00:00
[ [ "Nayaka", "Raja Jitendra", "" ], [ "Biradar", "R. C.", "" ] ]
new_dataset
0.996989
1207.5409
Deepak Kumar
Deepak Kumar, Manjeet Singh, Seema Shukla
FST Based Morphological Analyzer for Hindi Language
null
null
null
null
cs.CL cs.IR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Hindi being a highly inflectional language, FST (Finite State Transducer) based approach is most efficient for developing a morphological analyzer for this language. The work presented in this paper uses the SFST (Stuttgart Finite State Transducer) tool for generating the FST. A lexicon of root words is created. Rules are then added for generating inflectional and derivational words from these root words. The Morph Analyzer developed was used in a Part Of Speech (POS) Tagger based on Stanford POS Tagger. The system was first trained using a manually tagged corpus and MAXENT (Maximum Entropy) approach of Stanford POS tagger was then used for tagging input sentences. The morphological analyzer gives approximately 97% correct results. POS tagger gives an accuracy of approximately 87% for the sentences that have the words known to the trained model file, and 80% accuracy for the sentences that have the words unknown to the trained model file.
[ { "version": "v1", "created": "Mon, 23 Jul 2012 14:24:13 GMT" } ]
2012-07-24T00:00:00
[ [ "Kumar", "Deepak", "" ], [ "Singh", "Manjeet", "" ], [ "Shukla", "Seema", "" ] ]
new_dataset
0.977422
1207.5434
Yongge Wang
Yongge Wang
sSCADA: Securing SCADA Infrastructure Communications
null
Int. J. Communication Networks and Distributed Systems, 6(1):59--78, 2011
null
null
cs.IT cs.NI math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Distributed control systems (DCS) and supervisory control and data acquisition (SCADA) systems were developed to reduce labour costs, and to allow system-wide monitoring and remote control from a central location. Control systems are widely used in critical infrastructures such as electric grid, natural gas, water and wastewater industries. While control systems can be vulnerable to a variety of types of cyber attacks that could have devastating consequences, little research has been done to secure the control systems. American Gas Association (AGA), IEC TC57 WG15, IEEE, NIST and National SCADA Test Bed Program have been actively designing cryptographic standard to protect SCADA systems. American Gas Association (AGA) had originally been designing cryptographic standard to protect SCADA communication links and finished the report AGA 12 part 1. The AGA 12 part 2 has been transferred to IEEE P1711. This paper presents an attack on the protocols in the first draft of AGA standard (Wright et al., 2004). This attack shows that the security mechanisms in the first version of the AGA standard protocol could be easily defeated. We then propose a suite of security protocols optimised for SCADA/DCS systems which include: point-to-point secure channels, authenticated broadcast channels, authenticated emergency channels, and revised authenticated emergency channels. These protocols are designed to address the specific challenges that SCADA systems have.
[ { "version": "v1", "created": "Mon, 23 Jul 2012 16:11:49 GMT" } ]
2012-07-24T00:00:00
[ [ "Wang", "Yongge", "" ] ]
new_dataset
0.999305
1207.3445
James Currie
James D. Currie
Infinite ternary square-free words concatenated from permutations of a single word
null
null
null
null
cs.FL math.CO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We answer a question of Harju: An infinite square-free ternary word with an $n$-stem factorization exists for any $n\ge 13$. We show that there are uniform ternary morphisms of length $k$ for every $k\ge 23$. This resolves almost completely a problem of the author and Rampersad.
[ { "version": "v1", "created": "Sat, 14 Jul 2012 18:07:02 GMT" }, { "version": "v2", "created": "Fri, 20 Jul 2012 01:40:08 GMT" } ]
2012-07-23T00:00:00
[ [ "Currie", "James D.", "" ] ]
new_dataset
0.990486
1207.4530
Minghai Qin
Minghai Qin, Eitan Yaakobi, and Paul H. Siegel
Time-Space Constrained Codes for Phase-Change Memories
null
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Phase-change memory (PCM) is a promising non-volatile solid-state memory technology. A PCM cell stores data by using its amorphous and crystalline states. The cell changes between these two states using high temperature. However, since the cells are sensitive to high temperature, it is important, when programming cells, to balance the heat both in time and space. In this paper, we study the time-space constraint for PCM, which was originally proposed by Jiang et al. A code is called an \emph{$(\alpha,\beta,p)$-constrained code} if for any $\alpha$ consecutive rewrites and for any segment of $\beta$ contiguous cells, the total rewrite cost of the $\beta$ cells over those $\alpha$ rewrites is at most $p$. Here, the cells are binary and the rewrite cost is defined to be the Hamming distance between the current and next memory states. First, we show a general upper bound on the achievable rate of these codes which extends the results of Jiang et al. Then, we generalize their construction for $(\alpha\geq 1, \beta=1,p=1)$-constrained codes and show another construction for $(\alpha = 1, \beta\geq 1,p\geq1)$-constrained codes. Finally, we show that these two constructions can be used to construct codes for all values of $\alpha$, $\beta$, and $p$.
[ { "version": "v1", "created": "Thu, 19 Jul 2012 01:15:05 GMT" } ]
2012-07-20T00:00:00
[ [ "Qin", "Minghai", "" ], [ "Yaakobi", "Eitan", "" ], [ "Siegel", "Paul H.", "" ] ]
new_dataset
0.999444
1207.4625
Eric Laporte
E. Laporte (LIGM)
Appropriate Nouns with Obligatory Modifiers
null
Language research, Seoul National University 31, 2 (1995) 251-289
null
null
cs.CL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The notion of appropriate sequence as introduced by Z. Harris provides a powerful syntactic way of analysing the detailed meaning of various sentences, including ambiguous ones. In an adjectival sentence like 'The leather was yellow', the introduction of an appropriate noun, here 'colour', specifies which quality the adjective describes. In some other adjectival sentences with an appropriate noun, that noun plays the same part as 'colour' and seems to be relevant to the description of the adjective. These appropriate nouns can usually be used in elementary sentences like 'The leather had some colour', but in many cases they have a more or less obligatory modifier. For example, you can hardly mention that an object has a colour without qualifying that colour at all. About 300 French nouns are appropriate in at least one adjectival sentence and have an obligatory modifier. They enter in a number of sentence structures related by several syntactic transformations. The appropriateness of the noun and the fact that the modifier is obligatory are reflected in these transformations. The description of these syntactic phenomena provides a basis for a classification of these nouns. It also concerns the lexical properties of thousands of predicative adjectives, and in particular the relations between the sentence without the noun : 'The leather was yellow' and the adjectival sentence with the noun : 'The colour of the leather was yellow'.
[ { "version": "v1", "created": "Thu, 19 Jul 2012 12:04:26 GMT" } ]
2012-07-20T00:00:00
[ [ "Laporte", "E.", "", "LIGM" ] ]
new_dataset
0.995064
1207.4661
Sergei Goreinov
Gregory Bonik, Sergei Goreinov, Nickolai Zamarashkin
A variant of list plus CRC concatenated polar code
4 pages
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
A new family of codes based on polar codes, soft concatenation and list+CRC decoding is proposed. Numerical experiments show the performance competitive with industry standards and Tal, Vardy approach.
[ { "version": "v1", "created": "Thu, 19 Jul 2012 13:31:18 GMT" } ]
2012-07-20T00:00:00
[ [ "Bonik", "Gregory", "" ], [ "Goreinov", "Sergei", "" ], [ "Zamarashkin", "Nickolai", "" ] ]
new_dataset
0.99153
1010.2741
Behrang Nosrat Makouei
Behrang Nosrat-Makouei, Jeffrey G. Andrews and Robert W. Heath Jr
MIMO Interference Alignment Over Correlated Channels with Imperfect CSI
21 pages, 7 figures, submitted to IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing, vol.59, no.6, pp. 2783-2794, June 2011
10.1109/TSP.2011.2124458
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Interference alignment (IA), given uncorrelated channel components and perfect channel state information, obtains the maximum degrees of freedom in an interference channel. Little is known, however, about how the sum rate of IA behaves at finite transmit power, with imperfect channel state information, or antenna correlation. This paper provides an approximate closed-form signal-to-interference-plus-noise-ratio (SINR) expression for IA over multiple-input-multiple-output (MIMO) channels with imperfect channel state information and transmit antenna correlation. Assuming linear processing at the transmitters and zero-forcing receivers, random matrix theory tools are utilized to derive an approximation for the post-processing SINR distribution of each stream for each user. Perfect channel knowledge and i.i.d. channel coefficients constitute special cases. This SINR distribution not only allows easy calculation of useful performance metrics like sum rate and symbol error rate, but also permits a realistic comparison of IA with other transmission techniques. More specifically, IA is compared with spatial multiplexing and beamforming and it is shown that IA may not be optimal for some performance criteria.
[ { "version": "v1", "created": "Wed, 13 Oct 2010 19:38:45 GMT" } ]
2012-07-19T00:00:00
[ [ "Nosrat-Makouei", "Behrang", "" ], [ "Andrews", "Jeffrey G.", "" ], [ "Heath", "Robert W.", "Jr" ] ]
new_dataset
0.975636
1207.4259
Mohammad Nabil Almunawar Dr
Mohammad Nabil Almunawar
Content Based Multimedia Information Retrieval to Support Digital Libraries
15 pages, conference paper
International Conference on New Information Technologies, 23-26 July, 2001, Brunei Darussalam
null
null
cs.IR cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Content-based multimedia information retrieval is an interesting research area since it allows retrieval based on inherent characteristic of multimedia objects. For example retrieval based on visual characteristics such as colour, shapes or textures of objects in images or retrieval based on spatial relationships among objects in the media (images or video clips). This paper reviews some work done in image and video retrieval and then proposes an integrated model that can handle images and video clips uniformly. Using this model retrieval on images or video clips can be done based on the same framework.
[ { "version": "v1", "created": "Wed, 18 Jul 2012 04:11:55 GMT" } ]
2012-07-19T00:00:00
[ [ "Almunawar", "Mohammad Nabil", "" ] ]
new_dataset
0.990969
1207.3809
Julian McAuley
Julian McAuley and Jure Leskovec
Image Labeling on a Network: Using Social-Network Metadata for Image Classification
ECCV 2012; 14 pages, 4 figures
null
null
null
cs.CV cs.SI physics.soc-ph
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Large-scale image retrieval benchmarks invariably consist of images from the Web. Many of these benchmarks are derived from online photo sharing networks, like Flickr, which in addition to hosting images also provide a highly interactive social community. Such communities generate rich metadata that can naturally be harnessed for image classification and retrieval. Here we study four popular benchmark datasets, extending them with social-network metadata, such as the groups to which each image belongs, the comment thread associated with the image, who uploaded it, their location, and their network of friends. Since these types of data are inherently relational, we propose a model that explicitly accounts for the interdependencies between images sharing common properties. We model the task as a binary labeling problem on a network, and use structured learning techniques to learn model parameters. We find that social-network metadata are useful in a variety of classification tasks, in many cases outperforming methods based on image content.
[ { "version": "v1", "created": "Mon, 16 Jul 2012 20:04:12 GMT" } ]
2012-07-18T00:00:00
[ [ "McAuley", "Julian", "" ], [ "Leskovec", "Jure", "" ] ]
new_dataset
0.987799
1207.3867
Md. Hasnat Kabir Dr
M. G. Rashed, M. Hasnat Kabir, M. Sajjadur Rahim, and Sk. Enayet Ullah
CBHRP: A Cluster Based Routing Protocol for Wireless Sensor Network
11 pages
Computer Science & Engineering: An International Journal (CSEIJ), Vol.1, No.3, August 2011
10.5121/cseij.2011.1301
null
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
A new two layer hierarchical routing protocol called Cluster Based Hierarchical Routing Protocol (CBHRP) is proposed in this paper. It is an extension of LEACH routing protocol. We introduce cluster head-set idea for cluster-based routing where several clusters are formed with the deployed sensors to collect information from target field. On rotation basis, a head-set member receives data from the neighbor nodes and transmits the aggregated results to the distance base station. This protocol reduces energy consumption quite significantly and prolongs the life time of sensor network. It is found that CBHRP performs better than other well accepted hierarchical routing protocols like LEACH in term of energy consumption and time requirement.
[ { "version": "v1", "created": "Tue, 17 Jul 2012 03:38:06 GMT" } ]
2012-07-18T00:00:00
[ [ "Rashed", "M. G.", "" ], [ "Kabir", "M. Hasnat", "" ], [ "Rahim", "M. Sajjadur", "" ], [ "Ullah", "Sk. Enayet", "" ] ]
new_dataset
0.999471
1207.3921
Pasquale Panuzzo
Pasquale Panuzzo (1), Jinjing Li (2,3), Emmanuel Caux (4,5) ((1) CEA Saclay, Laboratoire AIM, Irfu/SAp, France (2) National Astronomical Observatories, China (3) GSegment Space Technologies, Inc., China (4) Universit\'e de Toulouse, UPS-OMP, IRAP, France (5) CNRS, IRAP, France)
PlotXY: a high quality plotting system for the Herschel Interactive Processing Environment (HIPE), and the astronomical community
4 pages, 6 figures, proceeding of Astronomical Data Analysis Software and Systems XXI, ASP Conf. Ser., in press
null
null
null
cs.GR astro-ph.IM
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The Herschel Interactive Processing Environment (HIPE) was developed by the European Space Agency (ESA) in collaboration with NASA and the Herschel Instrument Control Centres to provide the astronomical community a complete environment to process and analyze the data gathered by the Herschel Space Observatory. One of the most important components of HIPE is the plotting system (named PlotXY) that we present here. With PlotXY it is possible to produce easily high quality publication ready 2D plots. It provides a long list of features, with fully configurable components, and interactive zooming. The entire code of HIPE is written in Java and is open source released under the GNU Lesser General Public License version 3. A new version of PlotXY is being developed to be independent from the HIPE code base; it is available to the software development community for the inclusion in other projects at the URL http://code.google.com/p/jplot2d/.
[ { "version": "v1", "created": "Tue, 17 Jul 2012 09:06:59 GMT" } ]
2012-07-18T00:00:00
[ [ "Panuzzo", "Pasquale", "" ], [ "Li", "Jinjing", "" ], [ "Caux", "Emmanuel", "" ] ]
new_dataset
0.998873
1207.3932
Kishorjit Nongmeikapam Mr.
Kishorjit Nongmeikapam, Vidya Raj RK, Oinam Imocha Singh and Sivaji Bandyopadhyay
Automatic Segmentation of Manipuri (Meiteilon) Word into Syllabic Units
12 Pages, 5 Tables See the link http://airccse.org/journal/jcsit/0612csit11.pdf
null
10.5121/ijcsit.2012.4311
null
cs.CL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The work of automatic segmentation of a Manipuri language (or Meiteilon) word into syllabic units is demonstrated in this paper. This language is a scheduled Indian language of Tibeto-Burman origin, which is also a very highly agglutinative language. This language usages two script: a Bengali script and Meitei Mayek (Script). The present work is based on the second script. An algorithm is designed so as to identify mainly the syllables of Manipuri origin word. The result of the algorithm shows a Recall of 74.77, Precision of 91.21 and F-Score of 82.18 which is a reasonable score with the first attempt of such kind for this language.
[ { "version": "v1", "created": "Tue, 17 Jul 2012 10:14:24 GMT" } ]
2012-07-18T00:00:00
[ [ "Nongmeikapam", "Kishorjit", "" ], [ "RK", "Vidya Raj", "" ], [ "Singh", "Oinam Imocha", "" ], [ "Bandyopadhyay", "Sivaji", "" ] ]
new_dataset
0.995137
1207.3937
David Monniaux
Julien Henry (VERIMAG - IMAG), David Monniaux (VERIMAG - IMAG), Matthieu Moy (VERIMAG - IMAG)
PAGAI: a path sensitive static analyzer
Tools for Automatic Program AnalysiS (TAPAS 2012), Deauville : France (2012)
null
null
null
cs.PL cs.LO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We describe the design and the implementation of PAGAI, a new static analyzer working over the LLVM compiler infrastructure, which computes inductive invariants on the numerical variables of the analyzed program. PAGAI implements various state-of-the-art algorithms combining abstract interpretation and decision procedures (SMT-solving), focusing on distinction of paths inside the control flow graph while avoiding systematic exponential enumerations. It is parametric in the abstract domain in use, the iteration algorithm, and the decision procedure. We compared the time and precision of various combinations of analysis algorithms and abstract domains, with extensive experiments both on personal benchmarks and widely available GNU programs.
[ { "version": "v1", "created": "Tue, 17 Jul 2012 10:35:12 GMT" } ]
2012-07-18T00:00:00
[ [ "Henry", "Julien", "", "VERIMAG - IMAG" ], [ "Monniaux", "David", "", "VERIMAG - IMAG" ], [ "Moy", "Matthieu", "", "VERIMAG - IMAG" ] ]
new_dataset
0.995892
1207.3944
Alejandro Frery
Alejandro C. Frery and Julio Jacobo-Berlles and Juliana Gambini and Marta Mejail
Polarimetric SAR Image Segmentation with B-Splines and a New Statistical Model
null
Multidimensional Systems and Signal Processing, vol. 21, 319-342, 2010
10.1007/s11045-010-0113-4
null
cs.CV stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We present an approach for polarimetric Synthetic Aperture Radar (SAR) image region boundary detection based on the use of B-Spline active contours and a new model for polarimetric SAR data: the GHP distribution. In order to detect the boundary of a region, initial B-Spline curves are specified, either automatically or manually, and the proposed algorithm uses a deformable contours technique to find the boundary. In doing this, the parameters of the polarimetric GHP model for the data are estimated, in order to find the transition points between the region being segmented and the surrounding area. This is a local algorithm since it works only on the region to be segmented. Results of its performance are presented.
[ { "version": "v1", "created": "Tue, 17 Jul 2012 11:09:37 GMT" } ]
2012-07-18T00:00:00
[ [ "Frery", "Alejandro C.", "" ], [ "Jacobo-Berlles", "Julio", "" ], [ "Gambini", "Juliana", "" ], [ "Mejail", "Marta", "" ] ]
new_dataset
0.996087
0911.3456
Andreas Kl\"ockner
Andreas Kl\"ockner, Nicolas Pinto, Yunsup Lee, Bryan Catanzaro, Paul Ivanov and Ahmed Fasih
PyCUDA and PyOpenCL: A Scripting-Based Approach to GPU Run-Time Code Generation
Submitted to Parallel Computing, Elsevier
null
10.1016/j.parco.2011.09.001
null
cs.DC cs.SE
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
High-performance computing has recently seen a surge of interest in heterogeneous systems, with an emphasis on modern Graphics Processing Units (GPUs). These devices offer tremendous potential for performance and efficiency in important large-scale applications of computational science. However, exploiting this potential can be challenging, as one must adapt to the specialized and rapidly evolving computing environment currently exhibited by GPUs. One way of addressing this challenge is to embrace better techniques and develop tools tailored to their needs. This article presents one simple technique, GPU run-time code generation (RTCG), along with PyCUDA and PyOpenCL, two open-source toolkits that support this technique. In introducing PyCUDA and PyOpenCL, this article proposes the combination of a dynamic, high-level scripting language with the massive performance of a GPU as a compelling two-tiered computing platform, potentially offering significant performance and productivity advantages over conventional single-tier, static systems. The concept of RTCG is simple and easily implemented using existing, robust infrastructure. Nonetheless it is powerful enough to support (and encourage) the creation of custom application-specific tools by its users. The premise of the paper is illustrated by a wide range of examples where the technique has been applied with considerable success.
[ { "version": "v1", "created": "Wed, 18 Nov 2009 02:51:14 GMT" }, { "version": "v2", "created": "Tue, 29 Mar 2011 15:36:41 GMT" } ]
2012-07-17T00:00:00
[ [ "Klöckner", "Andreas", "" ], [ "Pinto", "Nicolas", "" ], [ "Lee", "Yunsup", "" ], [ "Catanzaro", "Bryan", "" ], [ "Ivanov", "Paul", "" ], [ "Fasih", "Ahmed", "" ] ]
new_dataset
0.994958
1202.0800
Natalia Silberstein
Natalia Silberstein, Ankit Singh Rawat, and Sriram Vishwanath
Error Resilience in Distributed Storage via Rank-Metric Codes
null
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper presents a novel coding scheme for distributed storage systems containing nodes with adversarial errors. The key challenge in such systems is the propagation of erroneous data from a single corrupted node to the rest of the system during a node repair process. This paper presents a concatenated coding scheme which is based on two types of codes: maximum rank distance (MRD) code as an outer code and optimal repair maximal distance separable (MDS) array code as an inner code. Given this, two different types of adversarial errors are considered: the first type considers an adversary that can replace the content of an affected node only once; while the second attack-type considers an adversary that can pollute data an unbounded number of times. This paper proves that the proposed coding scheme attains a suitable upper bound on resilience capacity for the first type of error. Further, the paper presents mechanisms that combine this code with subspace signatures to achieve error resilience for the second type of errors. Finally, the paper concludes by presenting a construction based on MRD codes for optimal locally repairable scalar codes that can tolerate adversarial errors.
[ { "version": "v1", "created": "Fri, 3 Feb 2012 19:11:10 GMT" }, { "version": "v2", "created": "Sun, 15 Jul 2012 08:44:56 GMT" } ]
2012-07-17T00:00:00
[ [ "Silberstein", "Natalia", "" ], [ "Rawat", "Ankit Singh", "" ], [ "Vishwanath", "Sriram", "" ] ]
new_dataset
0.986664
1204.1628
Haris Aziz
Haris Aziz
Stable marriage and roommate problems with individual-based stability
null
null
null
null
cs.GT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Research regarding the stable marriage and roommate problem has a long and distinguished history in mathematics, computer science and economics. Stability in this context is predominantly core stability or one of its variants in which each deviation is by a group of players. There has been little focus in matching theory on stability concepts such as Nash stability and individual stability in which the deviation is by a single player. Such stability concepts are suitable especially when trust for the other party is limited, complex coordination is not feasible, or when only unmatched agents can be approached. Furthermore, weaker stability notions such as individual stability may in principle circumvent the negative existence and computational complexity results in matching theory. We characterize the computational complexity of checking the existence and computing individual-based stable matchings for the marriage and roommate settings. One of our key computational results for the stable marriage setting also carries over to different classes of hedonic games for which individual-based stability has already been of much interest.
[ { "version": "v1", "created": "Sat, 7 Apr 2012 12:53:44 GMT" }, { "version": "v2", "created": "Sun, 15 Jul 2012 10:45:53 GMT" } ]
2012-07-17T00:00:00
[ [ "Aziz", "Haris", "" ] ]
new_dataset
0.966876
1207.3384
Guenda Kenza
Kenza Guenda and T. Aaron Gulliver
MDS and Self-dual Codes over Rings
null
null
null
null
cs.IT math.IT
http://creativecommons.org/licenses/by-nc-sa/3.0/
In this paper we give the structure of constacyclic codes over formal power series and chain rings. We also present necessary and sufficient conditions on the existence of MDS codes over principal ideal rings. These results allow for the construction of infinite families of MDS self-dual codes over finite chain rings, formal power series and principal ideal rings.
[ { "version": "v1", "created": "Sat, 14 Jul 2012 02:56:28 GMT" } ]
2012-07-17T00:00:00
[ [ "Guenda", "Kenza", "" ], [ "Gulliver", "T. Aaron", "" ] ]
new_dataset
0.996757
1207.3385
Guenda Kenza
Kenza Guenda and T. Aaron Gulliver
Construction of Cyclic Codes over $\mathbb{F}_2+u\mathbb{F}_2$ for DNA Computing
null
null
null
null
cs.IT math.IT
http://creativecommons.org/licenses/by-nc-sa/3.0/
We construct codes over the ring $\mathbb{F}_2+u\mathbb{F}_2$ with $u^2=0$. These code are designed for use in DNA computing applications. The codes obtained satisfy the reverse complement constraint, the $GC$ content constraint and avoid the secondary structure. they are derived from the cyclic complement reversible codes over the ring $\mathbb{F}_2+u\mathbb{F}_2$. We also construct an infinite family of BCH DNA codes.
[ { "version": "v1", "created": "Sat, 14 Jul 2012 03:07:04 GMT" } ]
2012-07-17T00:00:00
[ [ "Guenda", "Kenza", "" ], [ "Gulliver", "T. Aaron", "" ] ]
new_dataset
0.998674
1207.3387
Guenda Kenza
Kenza Guenda and T. Aaron Gulliver
Self-dual Repeated Root Cyclic and Negacyclic Codes over Finite Fields
null
null
null
null
cs.IT math.IT
http://creativecommons.org/licenses/by-nc-sa/3.0/
In this paper we investigate repeated root cyclic and negacyclic codes of length $p^rm$ over $\mathbb{F}_{p^s}$ with $(m,p)=1$. In the case $p$ odd, we give necessary and sufficient conditions on the existence of negacyclic self-dual codes. When $m=2m'$ with $m'$ odd, we characterize the codes in terms of their generator polynomials. This provides simple conditions on the existence of self-dual negacyclic codes, and generalizes the results of Dinh \cite{dinh}. We also answer an open problem concerning the number of self-dual cyclic codes given by Jia et al. \cite{jia}.
[ { "version": "v1", "created": "Sat, 14 Jul 2012 03:17:07 GMT" } ]
2012-07-17T00:00:00
[ [ "Guenda", "Kenza", "" ], [ "Gulliver", "T. Aaron", "" ] ]
new_dataset
0.995172
1207.3441
Makarius Wenzel
Makarius Wenzel
Isabelle/jEdit --- a Prover IDE within the PIDE framework
null
null
null
null
cs.LO cs.AI cs.MS
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
PIDE is a general framework for document-oriented prover interaction and integration, based on a bilingual architecture that combines ML and Scala. The overall aim is to connect LCF-style provers like Isabelle (or Coq or HOL) with sophisticated front-end technology on the JVM platform, overcoming command-line interaction at last. The present system description specifically covers Isabelle/jEdit as part of the official release of Isabelle2011-1 (October 2011). It is a concrete Prover IDE implementation based on Isabelle/PIDE library modules (implemented in Scala) on the one hand, and the well-known text editor framework of jEdit (implemented in Java) on the other hand. The interaction model of our Prover IDE follows the idea of continuous proof checking: the theory source text is annotated by semantic information by the prover as it becomes available incrementally. This works via an asynchronous protocol that neither blocks the editor nor stops the prover from exploiting parallelism on multi-core hardware. The jEdit GUI provides standard metaphors for augmented text editing (highlighting, squiggles, tooltips, hyperlinks etc.) that we have instrumented to render the formal content from the prover context. Further refinement of the jEdit display engine via suitable plugins and fonts approximates mathematical rendering in the text buffer, including symbols from the TeX repertoire, and sub-/superscripts. Isabelle/jEdit is presented here both as a usable interface for current Isabelle, and as a reference application to inspire further projects based on PIDE.
[ { "version": "v1", "created": "Sat, 14 Jul 2012 16:47:03 GMT" } ]
2012-07-17T00:00:00
[ [ "Wenzel", "Makarius", "" ] ]
new_dataset
0.999166
1207.3761
David Eppstein
David Eppstein
The Graphs of Planar Soap Bubbles
16 pages, 9 figures
null
null
null
cs.DM cs.CG math.MG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We characterize the graphs formed by two-dimensional soap bubbles as being exactly the 3-regular bridgeless planar multigraphs. Our characterization combines a local characterization of soap bubble graphs in terms of the curvatures of arcs meeting at common vertices, a proof that this characterization remains invariant under Moebius transformations, an application of Moebius invariance to prove bridgelessness, and a Moebius-invariant power diagram of circles previously developed by the author for its applications in graph drawing.
[ { "version": "v1", "created": "Mon, 16 Jul 2012 18:43:08 GMT" } ]
2012-07-17T00:00:00
[ [ "Eppstein", "David", "" ] ]
new_dataset
0.989139
1201.6181
Tobias Jung
Tobias Jung and Sylvain Martin and Damien Ernst and Guy Leduc
Contextual Multi-armed Bandits for the Prevention of Spam in VoIP Networks
Technical report, 19 pages, 5 figures
null
null
null
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper we argue that contextual multi-armed bandit algorithms could open avenues for designing self-learning security modules for computer networks and related tasks. The paper has two contributions: a conceptual one and an algorithmical one. The conceptual contribution is to formulate -- as an example -- the real-world problem of preventing SPIT (Spam in VoIP networks), which is currently not satisfyingly addressed by standard techniques, as a sequential learning problem, namely as a contextual multi-armed bandit. Our second contribution is to present CMABFAS, a new algorithm for general contextual multi-armed bandit learning that specifically targets domains with finite actions. We illustrate how CMABFAS could be used to design a fully self-learning SPIT filter that does not rely on feedback from the end-user (i.e., does not require labeled data) and report first simulation results.
[ { "version": "v1", "created": "Mon, 30 Jan 2012 11:40:06 GMT" }, { "version": "v2", "created": "Thu, 12 Jul 2012 11:55:33 GMT" } ]
2012-07-13T00:00:00
[ [ "Jung", "Tobias", "" ], [ "Martin", "Sylvain", "" ], [ "Ernst", "Damien", "" ], [ "Leduc", "Guy", "" ] ]
new_dataset
0.997757
1207.2991
Isha Gupta MS
Isha Gupta
BIGP- a new single protocol that can work as an igp (interior gateway protocol) as well as egp (exterior gateway protocol)
5 Pages, 6 Figures
null
null
null
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
EGP and IGP are the key components of the present internet infrastructure. Routers in a domain forward IP packet within and between domains. Each domain uses an intra-domain routing protocol known as Interior Gateway Protocol (IGP) like IS-IS, OSPF, RIP etc to populate the routing tables of its routers. Routing information must also be exchanged between domains to ensure that a host in one domain can reach another host in remote domain. This role is performed by inter-domain routing protocol called Exterior Gateway Protocol (EGP). Basically EGP used these days is Border Gateway Protocol (BGP). Basic difference between the both is that BGP has smaller convergence as compared to the IGP's. And IGP's on the other hand have lesser scalability as compared to the BGP. So in this paper a proposal to create a new protocol is given which can act as an IGP when we consider inter-domain transfer of traffic and acts as BGP when we consider intra-domain transfer of traffic.
[ { "version": "v1", "created": "Thu, 12 Jul 2012 15:11:15 GMT" } ]
2012-07-13T00:00:00
[ [ "Gupta", "Isha", "" ] ]
new_dataset
0.999054
1207.2556
Mariusz Grech
M. Grech and A. Kisielewicz
The Cerny conjecture for automata respecting intervals of a directed graph
null
null
null
null
cs.FL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The \v{C}ern\'y's conjecture states that for every synchronizing automaton with n states there exists a reset word of length not exceeding (n-11)^2. We prove this conjecture for a class of automata preserving certain properties of intervals of a directed graph. Our result unifies and generalizes some earlier results obtained by other authors.
[ { "version": "v1", "created": "Wed, 11 Jul 2012 07:57:57 GMT" } ]
2012-07-12T00:00:00
[ [ "Grech", "M.", "" ], [ "Kisielewicz", "A.", "" ] ]
new_dataset
0.998562
1207.2571
Cunsheng Ding
Cunsheng Ding
Cyclic Codes from Cyclotomic Sequences of Order Four
null
null
null
null
cs.IT cs.DM math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Cyclic codes are an interesting subclass of linear codes and have been used in consumer electronics, data transmission technologies, broadcast systems, and computer applications due to their efficient encoding and decoding algorithms. In this paper, three cyclotomic sequences of order four are employed to construct a number of classes of cyclic codes over $\gf(q)$ with prime length. Under certain conditions lower bounds on the minimum weight are developed. Some of the codes obtained are optimal or almost optimal. In general, the cyclic codes constructed in this paper are very good. Some of the cyclic codes obtained in this paper are closely related to almost difference sets and difference sets. As a byproduct, the $p$-rank of these (almost) difference sets are computed.
[ { "version": "v1", "created": "Wed, 11 Jul 2012 09:29:20 GMT" } ]
2012-07-12T00:00:00
[ [ "Ding", "Cunsheng", "" ] ]
new_dataset
0.998583
1207.2604
Peizhong Shi
Yun Wang, Peizhong Shi, Kai Li and Jie Wu
DQSB: A Reliable Broadcast Protocol Based on Distributed Quasi-Synchronized Mechanism for Low Duty-Cycled Wireless Sensor Networks
21 pages with 13 figures
null
null
null
cs.NI cs.DC
http://creativecommons.org/licenses/by/3.0/
In duty-cycled wireless sensor networks, deployed sensor nodes are usually put to sleep for energy efficiency according to sleep scheduling approaches. Any sleep scheduling scheme with its supporting protocols ensures that data can always be routed from source to sink. In this paper, we investigate a problem of multi-hop broadcast and routing in random sleep scheduling scheme, and propose a novel protocol, called DQSB, by quasi-synchronization mechanism to achieve reliable broadcast and less latency routing. DQSB neither assumes time synchronization which requires all neighboring nodes wake up at the same time, nor assumes duty-cycled awareness which makes it difficult to use in asynchronous WSNs. Furthermore, the benefit of quasi-synchronized mechanism for broadcast from sink to other nodes is the less latency routing paths for reverse data collection to sink because of no or less sleep waiting time. Simulation results show that DQSB outperforms the existing protocols in broadcast times performance and keeps relative tolerant broadcast latency performance, even in the case of unreliable links. The proposed DQSB protocol, in this paper, can be recognized as a tradeoff between broadcast times and broadcast latency. We also explore the impact of parameters in the assumption and the approach to get proper values for supporting DQSB.
[ { "version": "v1", "created": "Wed, 11 Jul 2012 11:34:30 GMT" } ]
2012-07-12T00:00:00
[ [ "Wang", "Yun", "" ], [ "Shi", "Peizhong", "" ], [ "Li", "Kai", "" ], [ "Wu", "Jie", "" ] ]
new_dataset
0.999417
1207.2739
Nungleppam Monoranjan Singh
N. Monoranjan Singh, K. C. Sarma
Low Cost PC Based Real Time Data Logging System Using PCs Parallel Port For Slowly Varying Signals
Published in the Journal of Assam Science Society, December 2009
J. Assam Sc. Soc. Vol. 50; No. 1,2; 36-41; December 2009
null
null
cs.AR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
A low cost PC based real time data logging system can be used in the laboratories for the measurement, monitoring and storage of the data for slowly varying signals in science and engineering stream. This can be designed and interfaced to the PCs Parallel Port, which is common to all desktop computers or Personal Computers (PCs). By the use of this data logging system one can monitor, measure and store data for slowly varying signals, which is hard to visualise the signal waveforms by ordinary CRO (Cathode Ray Oscilloscope) and DSO (Digital Storage Oscilloscope). The data so stored can be used for further study and analysis. It can be used for a wide range of applications to monitor and store data of temperature, humidity, light intensity, ECG signals etc. with proper signal conditioning circuitry.
[ { "version": "v1", "created": "Wed, 11 Jul 2012 18:29:21 GMT" } ]
2012-07-12T00:00:00
[ [ "Singh", "N. Monoranjan", "" ], [ "Sarma", "K. C.", "" ] ]
new_dataset
0.99067
1207.2741
Shilpan Vyas D
Shilpan Vyas
E-banking and E-commerce in India and USA
E-commerce and E-banking, Diffusion of Innovation theory, Hofstede's dimensions
Published in IJCSI Journal, Volume 9, Issue 3, No 2, May 2012
null
null
cs.CY
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Web based e-banking is becoming an important aspect of worldwide commerce. The United Nations predicts 17% of purchases by firms and individuals will be conducted online by 2006. The future of Web-based e-banking in developed areas appears bright but consumers and merchants in developing countries face in number of barriers to successful e-banking, including less reliable telecommunications infrastructure and power supplies, less access to online payment mechanisms, and relatively high costs for personal computers and Internet access. How should managers in charge of e-banking prepare for global implementation? What can they do reach consumers in developing countries? What factors influence the adoption of consumer-oriented e-banking in various countries? This research paper will give you the idea on the local conditions in India, the Hofstede's dimension of culture in India and USA, the Diffusion of Innovation theory and hence the hypotheses for the innovation characteristics of interest.
[ { "version": "v1", "created": "Tue, 10 Jul 2012 12:50:00 GMT" } ]
2012-07-12T00:00:00
[ [ "Vyas", "Shilpan", "" ] ]
new_dataset
0.997279
1207.2345
Armen Bagdasaryan
Armen Bagdasaryan
Some Euler-type formulas for planar graphs
accepted for publication in Int. J. Pure Appl. Math
null
null
null
cs.DM math.CO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The aim of this paper is to derive on the basis of the Euler's formula several analytical relations which hold for certain classes of planar graphs and which can be useful in algorithmic graph theory.
[ { "version": "v1", "created": "Tue, 10 Jul 2012 13:40:06 GMT" } ]
2012-07-11T00:00:00
[ [ "Bagdasaryan", "Armen", "" ] ]
new_dataset
0.990413
1207.2373
Mohamed Achraf Ben Mohamed Mr.
Mohamed Achraf Ben Mohamed, Dhaou El Ghoul, Mohamed Amine Nahdi, Mourad Mars and Mounir Zrigui
Arabic CALL system based on pedagogically indexed text
The 2011 International Conference on Artificial Intelligence (ICAI'11), 2011, WORLDCOMP'11, Las Vegas, Nevada, USA
null
null
null
cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This article introduces the benefits of using computer as a tool for foreign language teaching and learning. It describes the effect of using Natural Language Processing (NLP) tools for learning Arabic. The technique explored in this particular case is the employment of pedagogically indexed corpora. This text-based method provides the teacher the advantage of building activities based on texts adapted to a particular pedagogical situation. This paper also presents ARAC: a Platform dedicated to language educators allowing them to create activities within their own pedagogical area of interest.
[ { "version": "v1", "created": "Tue, 10 Jul 2012 14:34:24 GMT" } ]
2012-07-11T00:00:00
[ [ "Mohamed", "Mohamed Achraf Ben", "" ], [ "Ghoul", "Dhaou El", "" ], [ "Nahdi", "Mohamed Amine", "" ], [ "Mars", "Mourad", "" ], [ "Zrigui", "Mounir", "" ] ]
new_dataset
0.976359
1206.0638
Amani Tahat
Amani Tahat, Jordi Marti and Mohammad Tahat
WM Program manual
63 pages,19 figures,one appendix
null
null
null
cs.CE
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This user manual has been written to describe the open source code WM to be distributed associated with a research article submitted to the information technology journal 45001-ITJ-ANSI, entitled: "Maintenance and Reengineering of software: Creating a Visual C++ Graphical User Interface to Perform Specific Tasks Related to Soil Structure Interaction in Poroelastic Soil".
[ { "version": "v1", "created": "Mon, 4 Jun 2012 14:51:18 GMT" }, { "version": "v2", "created": "Mon, 9 Jul 2012 16:53:30 GMT" } ]
2012-07-10T00:00:00
[ [ "Tahat", "Amani", "" ], [ "Marti", "Jordi", "" ], [ "Tahat", "Mohammad", "" ] ]
new_dataset
0.99964
1207.0016
Ruchen Duan
Ruchen Duan Yingbin Liang
Bounds and Capacity Theorems for Cognitive Interference Channels with State
Submitted to the IEEE Transactions on Information Theory
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
A class of cognitive interference channel with state is investigated, in which two transmitters (transmitters 1 and 2) communicate with two receivers (receivers 1 and 2) over an interference channel. The two transmitters jointly transmit a common message to the two receivers, and transmitter 2 also sends a separate message to receiver 2. The channel is corrupted by an independent and identically distributed (i.i.d.) state sequence. The scenario in which the state sequence is noncausally known only at transmitter 2 is first studied. For the discrete memoryless channel and its degraded version, inner and outer bounds on the capacity region are obtained. The capacity region is characterized for the degraded semideterministic channel and channels that satisfy a less noisy condition. The Gaussian channels are further studied, which are partitioned into two cases based on how the interference compares with the signal at receiver 1. For each case, inner and outer bounds on the capacity region are derived, and partial boundary of the capacity region is characterized. The full capacity region is characterized for channels that satisfy certain conditions. The second scenario in which the state sequence is noncausally known at both transmitter 2 and receiver 2 is further studied. The capacity region is obtained for both the discrete memoryless and Gaussian channels. It is also shown that this capacity is achieved by certain Gaussian channels with state noncausally known only at transmitter 2.
[ { "version": "v1", "created": "Fri, 29 Jun 2012 20:32:55 GMT" }, { "version": "v2", "created": "Sun, 8 Jul 2012 23:30:55 GMT" } ]
2012-07-10T00:00:00
[ [ "Liang", "Ruchen Duan Yingbin", "" ] ]
new_dataset
0.982135
1207.1894
John-John Cabibihan
John-John Cabibihan, Wing-Chee So, Sujin Saj, Zhengchen Zhang
Telerobotic Pointing Gestures Shape Human Spatial Cognition
27 pages, 7 figures
null
10.1007/s12369-012-0148-9
null
cs.HC cs.RO physics.med-ph
http://creativecommons.org/licenses/by-nc-sa/3.0/
This paper aimed to explore whether human beings can understand gestures produced by telepresence robots. If it were the case, they can derive meaning conveyed in telerobotic gestures when processing spatial information. We conducted two experiments over Skype in the present study. Participants were presented with a robotic interface that had arms, which were teleoperated by an experimenter. The robot could point to virtual locations that represented certain entities. In Experiment 1, the experimenter described spatial locations of fictitious objects sequentially in two conditions: speech condition (SO, verbal descriptions clearly indicated the spatial layout) and speech and gesture condition (SR, verbal descriptions were ambiguous but accompanied by robotic pointing gestures). Participants were then asked to recall the objects' spatial locations. We found that the number of spatial locations recalled in the SR condition was on par with that in the SO condition, suggesting that telerobotic pointing gestures compensated ambiguous speech during the process of spatial information. In Experiment 2, the experimenter described spatial locations non-sequentially in the SR and SO conditions. Surprisingly, the number of spatial locations recalled in the SR condition was even higher than that in the SO condition, suggesting that telerobotic pointing gestures were more powerful than speech in conveying spatial information when information was presented in an unpredictable order. The findings provide evidence that human beings are able to comprehend telerobotic gestures, and importantly, integrate these gestures with co-occurring speech. This work promotes engaging remote collaboration among humans through a robot intermediary.
[ { "version": "v1", "created": "Sun, 8 Jul 2012 17:43:02 GMT" } ]
2012-07-10T00:00:00
[ [ "Cabibihan", "John-John", "" ], [ "So", "Wing-Chee", "" ], [ "Saj", "Sujin", "" ], [ "Zhang", "Zhengchen", "" ] ]
new_dataset
0.988424
1207.2000
Stefano Riverso
S. Riverso, G. Ferrari-Trecate
Hycon2 Benchmark: Power Network System
null
null
null
null
cs.SY
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
As a benchmark exercise for testing software and methods developed in Hycon2 for decentralized and distributed control, we address the problem of designing the Automatic Generation Control (AGC) layer in power network systems. In particular, we present three different scenarios and discuss performance levels that can be reached using Centralized Model Predictive Control (MPC). These results can be used as a milestone for comparing the performance of alternative control schemes. Matlab software for simulating the scenarios is also provided in an accompanying file.
[ { "version": "v1", "created": "Mon, 9 Jul 2012 10:28:04 GMT" } ]
2012-07-10T00:00:00
[ [ "Riverso", "S.", "" ], [ "Ferrari-Trecate", "G.", "" ] ]
new_dataset
0.999655
1202.0911
Benjamin L\'ev\^eque
Daniel Gon\c{c}alves, Benjamin L\'ev\^eque
Toroidal maps : Schnyder woods, orthogonal surfaces and straight-line representations
null
null
null
null
cs.DM math.CO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
A Schnyder wood is an orientation and coloring of the edges of a planar map satisfying a simple local property. We propose a generalization of Schnyder woods to graphs embedded on the torus with application to graph drawing. We prove several properties on this new object. Among all we prove that a graph embedded on the torus admits such a Schnyder wood if and only if it is an essentially 3-connected toroidal map. We show that these Schnyder woods can be used to embed the universal cover of an essentially 3-connected toroidal map on an infinite and periodic orthogonal surface. Finally we use this embedding to obtain a straight-line flat torus representation of any toroidal map in a polynomial size grid.
[ { "version": "v1", "created": "Sat, 4 Feb 2012 18:01:05 GMT" }, { "version": "v2", "created": "Fri, 6 Jul 2012 15:39:11 GMT" } ]
2012-07-09T00:00:00
[ [ "Gonçalves", "Daniel", "" ], [ "Lévêque", "Benjamin", "" ] ]
new_dataset
0.99973
1207.1351
Peter de Waal
Peter de Waal, Linda C. van der Gaag
Stable Independence in Perfect Maps
Appears in Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence (UAI2005)
null
null
UAI-P-2005-PG-161-168
cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
With the aid of the concept of stable independence we can construct, in an efficient way, a compact representation of a semi-graphoid independence relation. We show that this representation provides a new necessary condition for the existence of a directed perfect map for the relation. The test for this condition is based to a large extent on the transitivity property of a special form of d-separation. The complexity of the test is linear in the size of the representation. The test, moreover, brings the additional benefit that it can be used to guide the early stages of network construction.
[ { "version": "v1", "created": "Wed, 4 Jul 2012 12:12:05 GMT" } ]
2012-07-09T00:00:00
[ [ "de Waal", "Peter", "" ], [ "van der Gaag", "Linda C.", "" ] ]
new_dataset
0.954103
1207.1398
Avi Pfeffer
Avi Pfeffer, Terry Tai
Asynchronous Dynamic Bayesian Networks
Appears in Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence (UAI2005)
null
null
UAI-P-2005-PG-467-476
cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Systems such as sensor networks and teams of autonomous robots consist of multiple autonomous entities that interact with each other in a distributed, asynchronous manner. These entities need to keep track of the state of the system as it evolves. Asynchronous systems lead to special challenges for monitoring, as nodes must update their beliefs independently of each other and no central coordination is possible. Furthermore, the state of the system continues to change as beliefs are being updated. Previous approaches to developing distributed asynchronous probabilistic reasoning systems have used static models. We present an approach using dynamic models, that take into account the way the system changes state over time. Our approach, which is based on belief propagation, is fully distributed and asynchronous, and allows the world to keep on changing as messages are being sent around. Experimental results show that our approach compares favorably to the factored frontier algorithm.
[ { "version": "v1", "created": "Wed, 4 Jul 2012 16:18:25 GMT" } ]
2012-07-09T00:00:00
[ [ "Pfeffer", "Avi", "" ], [ "Tai", "Terry", "" ] ]
new_dataset
0.954199
1207.1098
Youssef Bassil
Youssef Bassil
TCP Congestion Control Scheme for Wireless Networks based on TCP Reserved Field and SNR Ratio
LACSC - Lebanese Association for Computational Sciences, International Journal of Research and Reviews in Information Sciences (IJRRIS), Vol. 2, No. 2, June 2012, http://www.lacsc.org
null
null
null
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Currently, TCP is the most popular and widely used network transmission protocol. In actual fact, about 90% of connections on the internet use TCP to communicate. Through several upgrades and improvements, TCP became well optimized for the very reliable wired networks. As a result, TCP considers all packet timeouts in wired networks as due to network congestion and not to bit errors. However, with networking becoming more heterogeneous, providing wired as well as wireless topologies, TCP suffers from performance degradation over error-prone wireless links as it has no mechanism to differentiate error losses from congestion losses. It therefore considers all packet losses as due to congestion and consequently reduces the burst of packet, diminishing at the same time the network throughput. This paper proposes a new TCP congestion control scheme appropriate for wireless as well as wired networks and is capable of distinguishing congestion losses from error losses. The proposed scheme is based on using the reserved field of the TCP header to indicate whether the established connection is over a wired or a wireless link. Additionally, the proposed scheme leverages the SNR ratio to detect the reliability of the link and decide whether to reduce packet burst or retransmit a timed-out packet. Experiments conducted, revealed that the proposed scheme proved to behave correctly in situations where timeouts were due to error and not to congestion. Future work can improve upon the proposed scheme so much so that it can leverage CRC and HEC errors so as to better determine the cause of transmission timeouts in wireless networks.
[ { "version": "v1", "created": "Wed, 4 Jul 2012 08:28:27 GMT" } ]
2012-07-06T00:00:00
[ [ "Bassil", "Youssef", "" ] ]
new_dataset
0.999019
1207.0840
Heidi Gebauer
Heidi Gebauer and Frank Mousset
On Rainbow Cycles and Paths
null
null
null
null
cs.DM math.CO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In a properly edge colored graph, a subgraph using every color at most once is called rainbow. In this thesis, we study rainbow cycles and paths in proper edge colorings of complete graphs, and we prove that in every proper edge coloring of K_n, there is a rainbow path on (3/4-o(1))n vertices, improving on the previously best bound of (2n+1)/3 from Gyarfas and Mhalla. Similarly, a k-rainbow path in a proper edge coloring of K_n is a path using no color more than k times. We prove that in every proper edge coloring of K_n, there is a k-rainbow path on (1-2/(k+1)!)n vertices.
[ { "version": "v1", "created": "Tue, 3 Jul 2012 21:43:39 GMT" } ]
2012-07-05T00:00:00
[ [ "Gebauer", "Heidi", "" ], [ "Mousset", "Frank", "" ] ]
new_dataset
0.99938
1207.0847
Ahmed Bahgat Mr.
A.T. Bahgat and K.N. Salama
Memristor-based mono-stable oscillator
This paper was submitted to Electronics Letters on the 28th of March 2012
null
null
null
cs.ET
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this letter, a reactance-less mono-stable oscillator is introduced for the first time using memristors. By replacing bulky inductors and capacitors with memristors, the novel mono-stable oscillator can be an area-efficient solution for on-chip fully integrated systems. The proposed circuit is described, mathematically analysed and verified by circuit simulations.
[ { "version": "v1", "created": "Tue, 3 Jul 2012 22:17:53 GMT" } ]
2012-07-05T00:00:00
[ [ "Bahgat", "A. T.", "" ], [ "Salama", "K. N.", "" ] ]
new_dataset
0.998646
1207.0922
Zheng Wang
Zheng Wang, Geguang Pu, Shenchao Qin, Jianwen Li, Kim G. Larsen, Jan Madsen, Bin Gu, Jifeng He
MDM: A Mode Diagram Modeling Framework for Periodic Control Systems
null
null
null
null
cs.SY cs.SE
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Periodic control systems used in spacecrafts and automotives are usually period-driven and can be decomposed into different modes with each mode representing a system state observed from outside. Such systems may also involve intensive computing in their modes. Despite the fact that such control systems are widely used in the above-mentioned safety-critical embedded domains, there is lack of domain-specific formal modelling languages for such systems in the relevant industry. To address this problem, we propose a formal visual modeling framework called MDM as a concise and precise way to specify and analyze such systems. To capture the temporal properties of periodic control systems, we provide, along with MDM, a property specification language based on interval logic for the description of concrete temporal requirements the engineers are concerned with. The statistical model checking technique can then be used to verify the MDM models against desired properties. To demonstrate the viability of our approach, we have applied our modelling framework to some real life case studies from industry and helped detect two design defects for some spacecraft control systems.
[ { "version": "v1", "created": "Wed, 4 Jul 2012 07:47:06 GMT" } ]
2012-07-05T00:00:00
[ [ "Wang", "Zheng", "" ], [ "Pu", "Geguang", "" ], [ "Qin", "Shenchao", "" ], [ "Li", "Jianwen", "" ], [ "Larsen", "Kim G.", "" ], [ "Madsen", "Jan", "" ], [ "Gu", "Bin", "" ], [ "He", "Jifeng", "" ] ]
new_dataset
0.997329
1103.1208
Ken Yamamoto
Ken Yamamoto and Yoshihiro Yamazaki
Fractal behind smart shopping
16 pages
Chaos, Solitons & Fractals 45, 1058-1066 (2012)
10.1016/j.chaos.2012.05.004
null
cs.DM nlin.CG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The 'minimal' payment - a payment method which minimizes the number of coins in a purse - is presented. We focus on a time series of change given back to a shopper repeating the minimal payment. The delay plot shows visually that the set of successive change possesses a fine structure similar to the Sierpinski gasket. We also estimate effectivity of the minimal-payment method by means of the average number of coins in a purse, and conclude that the minimal-payment strategy is the best to reduce the number of coins in a purse. Moreover, we compare our results to the rule-60 cellular automaton and the Pascal-Sierpinski gaskets, which are known as generators of the discrete Sierpinski gasket.
[ { "version": "v1", "created": "Mon, 7 Mar 2011 08:05:08 GMT" } ]
2012-07-04T00:00:00
[ [ "Yamamoto", "Ken", "" ], [ "Yamazaki", "Yoshihiro", "" ] ]
new_dataset
0.997398
1206.1754
Shuai Yuan
Shuai Yuan, Ahmad Zainal Abidin, Marc Sloan, Jun Wang
Internet Advertising: An Interplay among Advertisers, Online Publishers, Ad Exchanges and Web Users
44 pages, 7 figures, 6 tables. Submitted to Information Processing and Management
null
null
null
cs.IR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Internet advertising is a fast growing business which has proved to be significantly important in digital economics. It is vitally important for both web search engines and online content providers and publishers because web advertising provides them with major sources of revenue. Its presence is increasingly important for the whole media industry due to the influence of the Web. For advertisers, it is a smarter alternative to traditional marketing media such as TVs and newspapers. As the web evolves and data collection continues, the design of methods for more targeted, interactive, and friendly advertising may have a major impact on the way our digital economy evolves, and to aid societal development. Towards this goal mathematically well-grounded Computational Advertising methods are becoming necessary and will continue to develop as a fundamental tool towards the Web. As a vibrant new discipline, Internet advertising requires effort from different research domains including Information Retrieval, Machine Learning, Data Mining and Analytic, Statistics, Economics, and even Psychology to predict and understand user behaviours. In this paper, we provide a comprehensive survey on Internet advertising, discussing and classifying the research issues, identifying the recent technologies, and suggesting its future directions. To have a comprehensive picture, we first start with a brief history, introduction, and classification of the industry and present a schematic view of the new advertising ecosystem. We then introduce four major participants, namely advertisers, online publishers, ad exchanges and web users; and through analysing and discussing the major research problems and existing solutions from their perspectives respectively, we discover and aggregate the fundamental problems that characterise the newly-formed research field and capture its potential future prospects.
[ { "version": "v1", "created": "Fri, 8 Jun 2012 13:28:30 GMT" }, { "version": "v2", "created": "Mon, 2 Jul 2012 21:42:57 GMT" } ]
2012-07-04T00:00:00
[ [ "Yuan", "Shuai", "" ], [ "Abidin", "Ahmad Zainal", "" ], [ "Sloan", "Marc", "" ], [ "Wang", "Jun", "" ] ]
new_dataset
0.986358
1207.0639
Yonathan Murin
Yonathan Murin, Ron Dabora, Deniz G\"und\"uz
Joint Source-Channel Coding for the Multiple-Access Relay Channel
To be presented in ISIT 2012, 5 pages, 3 figures
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Reliable transmission of arbitrarily correlated sources over multiple-access relay channels (MARCs) and multiple-access broadcast relay channels (MABRCs) is considered. In MARCs, only the destination is interested in a reconstruction of the sources, while in MABRCs, both the relay and the destination want to reconstruct the sources. We allow an arbitrary correlation among the sources at the transmitters, and let both the relay and the destination have side information that are correlated with the sources. Two joint source-channel coding schemes are presented and the corresponding sets of sufficient conditions for reliable communication are derived. The proposed schemes use a combination of the correlation preserving mapping (CPM) technique with Slepian-Wolf (SW) source coding: the first scheme uses CPM for encoding information to the relay and SW source coding for encoding information to the destination; while the second scheme uses SW source coding for encoding information to the relay and CPM for encoding information to the destination.
[ { "version": "v1", "created": "Tue, 3 Jul 2012 11:35:51 GMT" } ]
2012-07-04T00:00:00
[ [ "Murin", "Yonathan", "" ], [ "Dabora", "Ron", "" ], [ "Gündüz", "Deniz", "" ] ]
new_dataset
0.963213
1207.0771
Alejandro Frery
Leonardo Torres, Antonio C. Medeiros and Alejandro C. Frery
Polarimetric SAR Image Smoothing with Stochastic Distances
Accepted for publication in the proceedings of the 17th Iberoamerican Conference on Pattern Recognition, to be published in the Lecture Notes in Computer Science series
null
null
null
cs.IT cs.CV cs.GR math.IT stat.AP stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Polarimetric Synthetic Aperture Radar (PolSAR) images are establishing as an important source of information in remote sensing applications. The most complete format this type of imaging produces consists of complex-valued Hermitian matrices in every image coordinate and, as such, their visualization is challenging. They also suffer from speckle noise which reduces the signal-to-noise ratio. Smoothing techniques have been proposed in the literature aiming at preserving different features and, analogously, projections from the cone of Hermitian positive matrices to different color representation spaces are used for enhancing certain characteristics. In this work we propose the use of stochastic distances between models that describe this type of data in a Nagao-Matsuyama-type of smoothing technique. The resulting images are shown to present good visualization properties (noise reduction with preservation of fine details) in all the considered visualization spaces.
[ { "version": "v1", "created": "Tue, 3 Jul 2012 18:11:46 GMT" } ]
2012-07-04T00:00:00
[ [ "Torres", "Leonardo", "" ], [ "Medeiros", "Antonio C.", "" ], [ "Frery", "Alejandro C.", "" ] ]
new_dataset
0.997363
1207.0784
Romain Giot
Romain Giot (GREYC), Mohamad El-Abed (GREYC), Christophe Rosenberger (GREYC)
Web-Based Benchmark for Keystroke Dynamics Biometric Systems: A Statistical Analysis
The Eighth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIHMSP 2012), Piraeus : Greece (2012)
null
null
null
cs.LG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Most keystroke dynamics studies have been evaluated using a specific kind of dataset in which users type an imposed login and password. Moreover, these studies are optimistics since most of them use different acquisition protocols, private datasets, controlled environment, etc. In order to enhance the accuracy of keystroke dynamics' performance, the main contribution of this paper is twofold. First, we provide a new kind of dataset in which users have typed both an imposed and a chosen pairs of logins and passwords. In addition, the keystroke dynamics samples are collected in a web-based uncontrolled environment (OS, keyboards, browser, etc.). Such kind of dataset is important since it provides us more realistic results of keystroke dynamics' performance in comparison to the literature (controlled environment, etc.). Second, we present a statistical analysis of well known assertions such as the relationship between performance and password size, impact of fusion schemes on system overall performance, and others such as the relationship between performance and entropy. We put into obviousness in this paper some new results on keystroke dynamics in realistic conditions.
[ { "version": "v1", "created": "Tue, 3 Jul 2012 19:12:56 GMT" } ]
2012-07-04T00:00:00
[ [ "Giot", "Romain", "", "GREYC" ], [ "El-Abed", "Mohamad", "", "GREYC" ], [ "Rosenberger", "Christophe", "", "GREYC" ] ]
new_dataset
0.999624
0809.1236
Pierre Ganty
Pierre Ganty, Rupak Majumdar, Benjamin Monmege
Bounded Underapproximations
30 pages, 2 figures, v4 added complexity results, various improvements
Formal Methods in System Design 40(2) (2012) 206-231
10.1007/s10703-011-0136-y
null
cs.LO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We show a new and constructive proof of the following language-theoretic result: for every context-free language L, there is a bounded context-free language L' included in L which has the same Parikh (commutative) image as L. Bounded languages, introduced by Ginsburg and Spanier, are subsets of regular languages of the form w1*w2*...wk* for some finite words w1,...,wk. In particular bounded subsets of context-free languages have nice structural and decidability properties. Our proof proceeds in two parts. First, using Newton's iterations on the language semiring, we construct a context-free subset Ls of L that can be represented as a sequence of substitutions on a linear language and has the same Parikh image as L. Second, we inductively construct a Parikh-equivalent bounded context-free subset of Ls. We show two applications of this result in model checking: to underapproximate the reachable state space of multithreaded procedural programs and to underapproximate the reachable state space of recursive counter programs. The bounded language constructed above provides a decidable underapproximation for the original problems. By iterating the construction, we get a semi-algorithm for the original problems that constructs a sequence of underapproximations such that no two underapproximations of the sequence can be compared. This provides a progress guarantee: every word w in L is in some underapproximation of the sequence. In addition, we show that our approach subsumes context-bounded reachability for multithreaded programs.
[ { "version": "v1", "created": "Sun, 7 Sep 2008 22:21:33 GMT" }, { "version": "v2", "created": "Fri, 3 Oct 2008 20:35:08 GMT" }, { "version": "v3", "created": "Thu, 8 Oct 2009 10:16:06 GMT" }, { "version": "v4", "created": "Sun, 17 Jan 2010 15:00:58 GMT" } ]
2012-07-03T00:00:00
[ [ "Ganty", "Pierre", "" ], [ "Majumdar", "Rupak", "" ], [ "Monmege", "Benjamin", "" ] ]
new_dataset
0.984011
1006.3825
Pierre Ganty
Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger
Parikh's Theorem: A simple and direct automaton construction
12 pages, 3 figures
Information Processing Letters 111(12) (2011) 614-619
10.1016/j.ipl.2011.03.019
null
cs.FL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Parikh's theorem states that the Parikh image of a context-free language is semilinear or, equivalently, that every context-free language has the same Parikh image as some regular language. We present a very simple construction that, given a context-free grammar, produces a finite automaton recognizing such a regular language.
[ { "version": "v1", "created": "Sat, 19 Jun 2010 00:22:14 GMT" }, { "version": "v2", "created": "Fri, 21 Jan 2011 11:50:17 GMT" }, { "version": "v3", "created": "Fri, 28 Jan 2011 14:58:42 GMT" } ]
2012-07-03T00:00:00
[ [ "Esparza", "Javier", "" ], [ "Ganty", "Pierre", "" ], [ "Kiefer", "Stefan", "" ], [ "Luttenberger", "Michael", "" ] ]
new_dataset
0.999835
1207.0018
Robinson Ebi Elias
J. Robinson Ebi Elias, R. Rajesh
Quasi-Orthogonal Space-Time-Frequency Trellis Codes for MIMO-OFDM Systems
null
null
10.5121/ijsea.2012.3303
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The main objective of this project is to design the full-rate Space-Time-Frequency Trellis code (STFTC), which is based on Quasi-Orthogonal designs for Multiple-Input Multiple-Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) systems. The proposed Quasi-Orthogonal Space-Time-Frequency Trellis code combines set partitioning and the structure of quasi-orthogonal space-frequency designs in a systematic way. In addition to multipath diversity and transmit diversity, the proposed code provides receive diversity, array gain, and achieve high-coding gain over a frequency selective fading channel. As simulation results demonstrate, the code outperforms the existing Quasi-Orthogonal Space-Time-Frequency Trellis codes in terms of frame error rate performance.
[ { "version": "v1", "created": "Tue, 12 Jun 2012 11:47:43 GMT" } ]
2012-07-03T00:00:00
[ [ "Elias", "J. Robinson Ebi", "" ], [ "Rajesh", "R.", "" ] ]
new_dataset
0.992915
1207.0162
George Athanasiou
Marios Logothetis, George Athanasiou, Kostas Tsagkaris, Panagiotis Demestichas
Green Footprint by Cognitive Management of Opportunistic Networks
null
null
null
null
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The existing characteristics of the wireless networks nowadays, urgently impose the exploitation of flexible networking solutions that will offer increased efficiency in resource utilization and application Quality of Service (QoS) provisioning and at the same time will reduce the energy consumption and achieve green targets. In this respect, Operator-governed Opportunistic Networks (ONs), which are dynamically created, temporary, coordinated extensions of the infrastructure, are the basic constituents in the proposed approach. In addition, Cognitive Management Systems (CMSs), which comprise self-management and learning capabilities, can be exploited for ensuring fast and reliable establishment of ONs, achieving efficiently the desired goals. This paper presents the concept of ONs and their representative scenarios, as well as an evaluation of indicative test cases as a proof of concept of the aforementioned approach. Indicative simulation results are presented, which yield the conditions in which the adoption of such a solution can lead to lower costs and management decisions with a "greener" footprint.
[ { "version": "v1", "created": "Sat, 30 Jun 2012 22:48:20 GMT" } ]
2012-07-03T00:00:00
[ [ "Logothetis", "Marios", "" ], [ "Athanasiou", "George", "" ], [ "Tsagkaris", "Kostas", "" ], [ "Demestichas", "Panagiotis", "" ] ]
new_dataset
0.99726
1207.0203
Rajkumar Buyya
Jayavardhana Gubbi, Rajkumar Buyya, Slaven Marusic, and Marimuthu Palaniswami
Internet of Things (IoT): A Vision, Architectural Elements, and Future Directions
19 pages, 8 figures
null
null
Technical Report CLOUDS-TR-2012-2, Cloud Computing and Distributed Systems Laboratory, The University of Melbourne, June 29, 2012
cs.DC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Ubiquitous sensing enabled by Wireless Sensor Network (WSN) technologies cuts across many areas of modern day living. This offers the ability to measure, infer and understand environmental indicators, from delicate ecologies and natural resources to urban environments. The proliferation of these devices in a communicating-actuating network creates the Internet of Things (IoT), wherein, sensors and actuators blend seamlessly with the environment around us, and the information is shared across platforms in order to develop a common operating picture (COP). Fuelled by the recent adaptation of a variety of enabling device technologies such as RFID tags and readers, near field communication (NFC) devices and embedded sensor and actuator nodes, the IoT has stepped out of its infancy and is the the next revolutionary technology in transforming the Internet into a fully integrated Future Internet. As we move from www (static pages web) to web2 (social networking web) to web3 (ubiquitous computing web), the need for data-on-demand using sophisticated intuitive queries increases significantly. This paper presents a cloud centric vision for worldwide implementation of Internet of Things. The key enabling technologies and application domains that are likely to drive IoT research in the near future are discussed. A cloud implementation using Aneka, which is based on interaction of private and public clouds is presented. We conclude our IoT vision by expanding on the need for convergence of WSN, the Internet and distributed computing directed at technological research community.
[ { "version": "v1", "created": "Sun, 1 Jul 2012 13:10:15 GMT" } ]
2012-07-03T00:00:00
[ [ "Gubbi", "Jayavardhana", "" ], [ "Buyya", "Rajkumar", "" ], [ "Marusic", "Slaven", "" ], [ "Palaniswami", "Marimuthu", "" ] ]
new_dataset
0.998964
1207.0216
Boubkeur Boudaoud
Dominique Barth, Boubkeur Boudaoud and Thierry Mautor
La th\'eorie des jeux pour l'\'etablissement des contrats dans les r\'eseaux interdomaines
2 pages, conf\'erence ROADEF'2012
ROADEF 2012
null
null
cs.GT cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Dans ce travail, nous montrons comment mettre en oeuvre la gestion des ressources et la garantie de QoS (Quality of Service) dans l'interdomaine en utilisant le mod\`ele en stock. Nous avons d\'ej\`a appliqu\'e un mod\`ele distribu\'e pour l'\'etablissement des SLAs (Service Level Agreement) entre les op\'erateurs pour l'achat des routes avec une garantie de QoS et des r\'esultats significatifs ont \'et\'e obtenus sur des topologies simples. Dans ce travail, nous appliquons un mod\`ele de jeu pour l'\'etablissement des SLAs.
[ { "version": "v1", "created": "Sun, 1 Jul 2012 14:51:12 GMT" } ]
2012-07-03T00:00:00
[ [ "Barth", "Dominique", "" ], [ "Boudaoud", "Boubkeur", "" ], [ "Mautor", "Thierry", "" ] ]
new_dataset
0.985204
1207.0337
Anas Chaaban
Anas Chaaban and Aydin Sezgin
The DoF of the K-user Interference Channel with a Cognitive Relay
5 pages, 1 figure, ISIT 2012
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
It was shown recently that the 2-user interference channel with a cognitive relay (IC-CR) has full degrees of freedom (DoF) almost surely, that is, 2 DoF. The purpose of this work is to check whether the DoF of the $K$-user IC-CR, consisting of $K$ user pairs and a cognitive relay, follow as a straight forward extension of the 2-user case. As it turns out, this is not the case. The $K$-user IC-CR is shown to have $2K/3$ DoF if $K>2$ for the when the channel is time varying, achievable using interference alignment. Thus, while the basic $K$-user IC with time varying channel coefficients has 1/2 DoF per user for all $K$, the $K$-user IC-CR with varying channels has 1 DoF per user if K=2 and 2/3 DoF per user if $K>2$. Furthermore, the DoF region of the 3-user IC-CR with constant channels is characterized using interference neutralization, and a new upper bound on the sum-capacity of the 2-user IC-CR is given.
[ { "version": "v1", "created": "Mon, 2 Jul 2012 10:49:34 GMT" } ]
2012-07-03T00:00:00
[ [ "Chaaban", "Anas", "" ], [ "Sezgin", "Aydin", "" ] ]
new_dataset
0.985644
1010.1499
Mohammad Ali Maddah-Ali Mr.
Mohammad Ali Maddah-Ali and David Tse
Completely Stale Transmitter Channel State Information is Still Very Useful
Initially reported as Technical Report No. UCB/EECS-2010-122 at the University of California--Berkeley, Sept. 6, 2010. Presented at the Forty-Eighth Annual Allerton Conference, Sept. 2010. Accepted for IEEE Transactions on Information Theory
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Transmitter channel state information (CSIT) is crucial for the multiplexing gains offered by advanced interference management techniques such as multiuser MIMO and interference alignment. Such CSIT is usually obtained by feedback from the receivers, but the feedback is subject to delays. The usual approach is to use the fed back information to predict the current channel state and then apply a scheme designed assuming perfect CSIT. When the feedback delay is large compared to the channel coherence time, such a prediction approach completely fails to achieve any multiplexing gain. In this paper, we show that even in this case, the completely stale CSI is still very useful. More concretely, we show that in a MIMO broadcast channel with $K$ transmit antennas and $K$ receivers each with 1 receive antenna, $\frac{K}{1+1/2+ ...+ \frac{1}{K}} (> 1) $ degrees of freedom is achievable even when the fed back channel state is completely independent of the current channel state. Moreover, we establish that if all receivers have independent and identically distributed channels, then this is the optimal number of degrees of freedom achievable. In the optimal scheme, the transmitter uses the fed back CSI to learn the side information that the receivers receive from previous transmissions rather than to predict the current channel state. Our result can be viewed as the first example of feedback providing a degree-of-freedom gain in memoryless channels.
[ { "version": "v1", "created": "Thu, 7 Oct 2010 18:00:46 GMT" }, { "version": "v2", "created": "Mon, 26 Sep 2011 13:41:28 GMT" }, { "version": "v3", "created": "Fri, 29 Jun 2012 16:38:17 GMT" } ]
2012-07-02T00:00:00
[ [ "Maddah-Ali", "Mohammad Ali", "" ], [ "Tse", "David", "" ] ]
new_dataset
0.993525
1010.5975
Florent Foucaud
Florent Foucaud (LaBRI), Ralf Klasing (LaBRI, INRIA Bordeaux - Sud-Ouest), Adrian Kosowski (LaBRI, INRIA Bordeaux - Sud-Ouest), Andr\'e Raspaud (LaBRI)
On the size of identifying codes in triangle-free graphs
null
Discrete Applied Mathematics 160, 10-11 (2012) 1532-1546
10.1016/j.dam.2012.02.009
null
cs.DM math.CO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In an undirected graph $G$, a subset $C\subseteq V(G)$ such that $C$ is a dominating set of $G$, and each vertex in $V(G)$ is dominated by a distinct subset of vertices from $C$, is called an identifying code of $G$. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. For a given identifiable graph $G$, let $\M(G)$ be the minimum cardinality of an identifying code in $G$. In this paper, we show that for any connected identifiable triangle-free graph $G$ on $n$ vertices having maximum degree $\Delta\geq 3$, $\M(G)\le n-\tfrac{n}{\Delta+o(\Delta)}$. This bound is asymptotically tight up to constants due to various classes of graphs including $(\Delta-1)$-ary trees, which are known to have their minimum identifying code of size $n-\tfrac{n}{\Delta-1+o(1)}$. We also provide improved bounds for restricted subfamilies of triangle-free graphs, and conjecture that there exists some constant $c$ such that the bound $\M(G)\le n-\tfrac{n}{\Delta}+c$ holds for any nontrivial connected identifiable graph $G$.
[ { "version": "v1", "created": "Thu, 28 Oct 2010 14:06:34 GMT" }, { "version": "v2", "created": "Mon, 13 Jun 2011 11:21:15 GMT" }, { "version": "v3", "created": "Fri, 29 Jun 2012 18:57:15 GMT" } ]
2012-07-02T00:00:00
[ [ "Foucaud", "Florent", "", "LaBRI" ], [ "Klasing", "Ralf", "", "LaBRI, INRIA Bordeaux -\n Sud-Ouest" ], [ "Kosowski", "Adrian", "", "LaBRI, INRIA Bordeaux - Sud-Ouest" ], [ "Raspaud", "André", "", "LaBRI" ] ]
new_dataset
0.996657
1206.6838
Tal El-Hay
Tal El-Hay, Nir Friedman, Daphne Koller, Raz Kupferman
Continuous Time Markov Networks
Appears in Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence (UAI2006)
null
null
UAI-P-2006-PG-155-164
cs.AI cs.LG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
A central task in many applications is reasoning about processes that change in a continuous time. The mathematical framework of Continuous Time Markov Processes provides the basic foundations for modeling such systems. Recently, Nodelman et al introduced continuous time Bayesian networks (CTBNs), which allow a compact representation of continuous-time processes over a factored state space. In this paper, we introduce continuous time Markov networks (CTMNs), an alternative representation language that represents a different type of continuous-time dynamics. In many real life processes, such as biological and chemical systems, the dynamics of the process can be naturally described as an interplay between two forces - the tendency of each entity to change its state, and the overall fitness or energy function of the entire system. In our model, the first force is described by a continuous-time proposal process that suggests possible local changes to the state of the system at different rates. The second force is represented by a Markov network that encodes the fitness, or desirability, of different states; a proposed local change is then accepted with a probability that is a function of the change in the fitness distribution. We show that the fitness distribution is also the stationary distribution of the Markov process, so that this representation provides a characterization of a temporal process whose stationary distribution has a compact graphical representation. This allows us to naturally capture a different type of structure in complex dynamical processes, such as evolving biological sequences. We describe the semantics of the representation, its basic properties, and how it compares to CTBNs. We also provide algorithms for learning such models from data, and discuss its applicability to biological sequence evolution.
[ { "version": "v1", "created": "Wed, 27 Jun 2012 16:19:16 GMT" } ]
2012-07-02T00:00:00
[ [ "El-Hay", "Tal", "" ], [ "Friedman", "Nir", "" ], [ "Koller", "Daphne", "" ], [ "Kupferman", "Raz", "" ] ]
new_dataset
0.978021
1206.6938
Zhang Shengli
Shengli Zhang, Canping Nie, Liya Lu, and Gongbin Qian
MIMO Physical Layer Network Coding Based on VBLAST Detection
null
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
For MIMO two-way relay channel, this paper proposes a novel scheme, VBLAST-PNC, to transform the two superimposed packets received by the relay to their network coding form. Different from traditional schemes, which tries to detect each packet before network coding them, VBLAST-PNC detects the summation of the two packets before network coding. In particular, after firstly detecting the second layer signal in 2-by-2 MIMO system with VBLAST, we only cancel part of the detected signal, rather than canceling all the components, from the first layer. Then we directly map the obtained signal, summation of the first layer and the second layer, to their network coding form. With such partial interference cancellation, the error propagation effect is mitigated and the performance is thus improved as shown in simulations.
[ { "version": "v1", "created": "Fri, 29 Jun 2012 04:39:24 GMT" } ]
2012-07-02T00:00:00
[ [ "Zhang", "Shengli", "" ], [ "Nie", "Canping", "" ], [ "Lu", "Liya", "" ], [ "Qian", "Gongbin", "" ] ]
new_dataset
0.999442
1205.6359
Akshay Deepak
Akshay Deepak, David Fern\'andez-Baca, and Michelle M. McMahon
Extracting Conflict-free Information from Multi-labeled Trees
Submitted in Workshop on Algorithms in Bioinformatics 2012 (http://algo12.fri.uni-lj.si/?file=wabi)
null
null
null
cs.DS q-bio.PE
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
A multi-labeled tree, or MUL-tree, is a phylogenetic tree where two or more leaves share a label, e.g., a species name. A MUL-tree can imply multiple conflicting phylogenetic relationships for the same set of taxa, but can also contain conflict-free information that is of interest and yet is not obvious. We define the information content of a MUL-tree T as the set of all conflict-free quartet topologies implied by T, and define the maximal reduced form of T as the smallest tree that can be obtained from T by pruning leaves and contracting edges while retaining the same information content. We show that any two MUL-trees with the same information content exhibit the same reduced form. This introduces an equivalence relation in MUL-trees with potential applications to comparing MUL-trees. We present an efficient algorithm to reduce a MUL-tree to its maximally reduced form and evaluate its performance on empirical datasets in terms of both quality of the reduced tree and the degree of data reduction achieved.
[ { "version": "v1", "created": "Tue, 29 May 2012 13:35:56 GMT" }, { "version": "v2", "created": "Thu, 28 Jun 2012 14:50:07 GMT" } ]
2012-06-29T00:00:00
[ [ "Deepak", "Akshay", "" ], [ "Fernández-Baca", "David", "" ], [ "McMahon", "Michelle M.", "" ] ]
new_dataset
0.9697
1206.6612
Tuomo Kakkonen
T. Kakkonen
TexComp - A Text Complexity Analyzer for Student Texts
Proceedings of the 12th International Conference on Interactive Computer-aided Learning, Villach, Austria, 2009
null
null
null
cs.CY
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper describes a method for providing feedback about the degree of complexity that is present in particular texts. Both the method and the software tool called TexComp are designed for use during the assessment of student compositions (such as essays and theses). The method is based on a cautious approach to the application of readability and lexical diversity formulas for reasons that are analyzed in detail in this paper. We evaluated the tool by using USE and BAWE, two corpora of texts that originate from students who use English as a medium of instruction.
[ { "version": "v1", "created": "Thu, 28 Jun 2012 09:58:01 GMT" } ]
2012-06-29T00:00:00
[ [ "Kakkonen", "T.", "" ] ]
new_dataset
0.965566
0902.1634
Massimiliano Sala Prof.
Eleonora Guerrini, Massimiliano Sala
A bound on the size of linear codes
A new version of this article is now available
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We present a bound on the size of linear codes. This bound is independent of other known bounds, e.g. the Griesmer bound.
[ { "version": "v1", "created": "Tue, 10 Feb 2009 11:50:48 GMT" }, { "version": "v2", "created": "Wed, 27 Jun 2012 11:05:48 GMT" } ]
2012-06-28T00:00:00
[ [ "Guerrini", "Eleonora", "" ], [ "Sala", "Massimiliano", "" ] ]
new_dataset
0.95796
1206.6142
David Eppstein
David Eppstein
Planar Lombardi Drawings for Subcubic Graphs
15 pages, 9 figures
null
null
null
cs.CG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We prove that every planar graph with maximum degree three has a planar drawing in which the edges are drawn as circular arcs that meet at equal angles around every vertex. Our construction is based on the Koebe-Thurston-Andreev circle packing theorem, and uses a novel type of Voronoi diagram for circle packings that is invariant under Moebius transformations, defined using three-dimensional hyperbolic geometry. We also use circle packing to construct planar Lombardi drawings of a special class of 4-regular planar graphs, the medial graphs of polyhedral graphs, and we show that not every 4-regular planar graph has a Lombardi drawing. We have implemented our algorithm for 3-connected planar cubic graphs.
[ { "version": "v1", "created": "Tue, 26 Jun 2012 23:48:00 GMT" } ]
2012-06-28T00:00:00
[ [ "Eppstein", "David", "" ] ]
new_dataset
0.975209
1205.1825
Ludovic Mignot
Jean-Marc Champarnaud, Hadrien Jeanne and Ludovic Mignot
Derivatives of Approximate Regular Expressions
null
null
null
null
cs.FL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Our aim is to construct a finite automaton recognizing the set of words that are at a bounded distance from some word of a given regular language. We define new regular operators, the similarity operators, based on a generalization of the notion of distance and we introduce the family of regular expressions extended to similarity operators, that we call AREs (Approximate Regular Expressions). We set formulae to compute the Brzozowski derivatives and the Antimirov derivatives of an ARE, which allows us to give a solution to the ARE membership problem and to provide the construction of two recognizers for the language denoted by an ARE. As far as we know, the family of approximative regular expressions is introduced for the first time in this paper. Classical approximate regular expression matching algorithms are approximate matching algorithms on regular expressions. Our approach is rather to process an exact matching on approximate regular expressions.
[ { "version": "v1", "created": "Tue, 8 May 2012 20:59:33 GMT" }, { "version": "v2", "created": "Fri, 22 Jun 2012 14:17:31 GMT" }, { "version": "v3", "created": "Tue, 26 Jun 2012 09:36:15 GMT" } ]
2012-06-27T00:00:00
[ [ "Champarnaud", "Jean-Marc", "" ], [ "Jeanne", "Hadrien", "" ], [ "Mignot", "Ludovic", "" ] ]
new_dataset
0.991848
1206.5884
Debajyoti Mukhopadhyay Prof.
Debajyoti Mukhopadhyay, Saurabh Deochake, Shashank Kanth, Subhadip Chakraborty, Suresh Sarode
MAINWAVE: Multi Agents and Issues Negotiation for Web using Alliance Virtual Engine
12 pages, 3 figures
null
null
null
cs.MA
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper showcases an improved architecture for a complete negotiation system that permits multi party multi issue negotiation. The concepts of multithreading and concurrency has been utilized to perform parallel execution. The negotiation history has been implemented that stores all the records of the messages exchanged for every successful and rejected negotiation process and implements the concepts of artificial intelligence in determination of proper weights for a valid negotiation mechanism. The issues are arranged in a hierarchical pattern so as to simplify the representation and priorities are assigned to each issue, which amounts to its relative importance. There is refinement of utilities by consideration of the non-functional attributes. So as to avoid overloading of the system, a maximum number of parties are allowed to participate in the entire mechanism and if more parties arrive, they're put into a waiting queue in accordance to certain criteria such as the first come first serve or the relative priorities. This helps in fault tolerance. It also supports the formation of alliances among the various parties while carrying out a negotiation.
[ { "version": "v1", "created": "Tue, 26 Jun 2012 05:21:43 GMT" } ]
2012-06-27T00:00:00
[ [ "Mukhopadhyay", "Debajyoti", "" ], [ "Deochake", "Saurabh", "" ], [ "Kanth", "Shashank", "" ], [ "Chakraborty", "Subhadip", "" ], [ "Sarode", "Suresh", "" ] ]
new_dataset
0.994589
1106.0305
Andrew Adamatzky
Andrew Adamatzky
Slime mould computes planar shapes
null
International Journal of Bio-Inspired Computation 2012 - Vol. 4, No.3 pp. 149 - 154
null
null
cs.ET nlin.PS
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Computing a polygon defining a set of planar points is a classical problem of modern computational geometry. In laboratory experiments we demonstrate that a concave hull, a connected alpha-shape without holes, of a finite planar set is approximated by slime mould Physarum polycephalum. We represent planar points with sources of long-distance attractants and short-distance repellents and inoculate a piece of plasmodium outside the data set. The plasmodium moves towards the data and envelops it by pronounced protoplasmic tubes.
[ { "version": "v1", "created": "Wed, 1 Jun 2011 20:01:34 GMT" } ]
2012-06-26T00:00:00
[ [ "Adamatzky", "Andrew", "" ] ]
new_dataset
0.998367
1206.1518
Manal Abdullah
Manal A. Abdullah, Lulwah M. Al-Harigy, and Hanadi H. Al-Fraidi
Off-Line Arabic Handwriting Character Recognition Using Word Segmentation
5 pages; Journal of Computing, Volume 4, Issue 3, March 2012, ISSN 2151-9617
null
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The ultimate aim of handwriting recognition is to make computers able to read and/or authenticate human written texts, with a performance comparable to or even better than that of humans. Reading means that the computer is given a piece of handwriting and it provides the electronic transcription of that (e.g. in ASCII format). Two types of handwriting: on-line and offline. The most important purpose of off-line handwriting recognition is in protection systems and authentication. Arabic Handwriting scripts are much more complicated in comparison to Latin scripts. This paper introduces a simple and novel methodology to authenticate Arabic handwriting characters. Reaching our aim, we built our own character database. The research methodology depends on two stages: The first is character extraction where preprocessing the word and then apply segmentation process to obtain the character. The second is the character recognition by matching the characters comprising the word with the letters in the database. Our results ensure character recognition with 81%. We eliminate FAR by using similarity percent between 45-55%. Our research is coded using MATLAB.
[ { "version": "v1", "created": "Thu, 7 Jun 2012 15:07:08 GMT" } ]
2012-06-26T00:00:00
[ [ "Abdullah", "Manal A.", "" ], [ "Al-Harigy", "Lulwah M.", "" ], [ "Al-Fraidi", "Hanadi H.", "" ] ]
new_dataset
0.998331
1206.3038
Manish Gupta
Manish. K. Gupta and C. Durairajan
On the Covering Radius of Some Modular Codes
revised
null
null
null
cs.IT math.IT math.RA
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper gives lower and upper bounds on the covering radius of codes over $\Z_{2^s}$ with respect to homogenous distance. We also determine the covering radius of various Repetition codes, Simplex codes (Type $\alpha$ and Type $\beta$) and their dual and give bounds on the covering radii for MacDonald codes of both types over $\Z_4$.
[ { "version": "v1", "created": "Thu, 14 Jun 2012 09:05:16 GMT" }, { "version": "v2", "created": "Mon, 25 Jun 2012 08:26:18 GMT" } ]
2012-06-26T00:00:00
[ [ "Gupta", "Manish. K.", "" ], [ "Durairajan", "C.", "" ] ]
new_dataset
0.999173
1206.5112
Marcin Benke
Viviana Bono, Marcin Benke, Aleksy Schubert
Lucretia - a type system for objects in languages with reflection
21 pages
null
null
null
cs.PL cs.LO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Object-oriented scripting languages such as JavaScript or Python gain in popularity due to their flexibility. Still, the growing code bases written in the languages call for methods that make possible to automatically control the properties of the programs that ensure their stability in the running time. We propose a type system, called Lucretia, that makes possible to control the object structure of languages with reflection. Subject reduction and soundness of the type system with respect to the semantics of the language is proved.
[ { "version": "v1", "created": "Fri, 22 Jun 2012 11:07:14 GMT" } ]
2012-06-26T00:00:00
[ [ "Bono", "Viviana", "" ], [ "Benke", "Marcin", "" ], [ "Schubert", "Aleksy", "" ] ]
new_dataset
0.983816
1206.5361
Ijaz Hussain Mr
Ijaz Hussain, Muhammad Riaz, Muhammad Rehan, and Shakeel Ahmed
Regional System Identification and Computer Based Switchable Control of a Nonlinear Hot Air Blower System
null
null
null
null
cs.SY
http://creativecommons.org/licenses/publicdomain/
This paper describes the design and implementation of linear controllers with a switching condition for a nonlinear hot air blower system (HABS) process trainer PT326. The system is interfaced with a computer through a USB based data acquisition module and interfacing circuitry. A calibration equation is implemented through computer in order to convert the amplified output of the sensor to temperature. Overall plant is nonlinear; therefore, system identification is performed in three different regions depending upon the plant input. For these three regions, three linear controllers are designed with closed-loop system having small rise time, settling time and overshoot. Switching of controllers is based on regions defined by plant input. In order to avoid the effect of discontinuity, due to switching of linear controllers, parameters of all linear controllers are taken closer to each other. Finally, discretized controllers along with switching condition are implemented for the plant through computer and practical results are demonstrated.
[ { "version": "v1", "created": "Sat, 23 Jun 2012 05:52:33 GMT" } ]
2012-06-26T00:00:00
[ [ "Hussain", "Ijaz", "" ], [ "Riaz", "Muhammad", "" ], [ "Rehan", "Muhammad", "" ], [ "Ahmed", "Shakeel", "" ] ]
new_dataset
0.989526
1206.5384
Tarek El-Shishtawy Ahmed
Tarek El-Shishtawy and Fatma El-Ghannam
Keyphrase Based Arabic Summarizer (KPAS)
INFOS 2012, The 8th INFOS2012 International Conference on Informatics and Systems, 14-16 May, 2012
null
null
null
cs.CL cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper describes a computationally inexpensive and efficient generic summarization algorithm for Arabic texts. The algorithm belongs to extractive summarization family, which reduces the problem into representative sentences identification and extraction sub-problems. Important keyphrases of the document to be summarized are identified employing combinations of statistical and linguistic features. The sentence extraction algorithm exploits keyphrases as the primary attributes to rank a sentence. The present experimental work, demonstrates different techniques for achieving various summarization goals including: informative richness, coverage of both main and auxiliary topics, and keeping redundancy to a minimum. A scoring scheme is then adopted that balances between these summarization goals. To evaluate the resulted Arabic summaries with well-established systems, aligned English/Arabic texts are used through the experiments.
[ { "version": "v1", "created": "Sat, 23 Jun 2012 12:19:38 GMT" } ]
2012-06-26T00:00:00
[ [ "El-Shishtawy", "Tarek", "" ], [ "El-Ghannam", "Fatma", "" ] ]
new_dataset
0.996019
1206.5459
Nicolas Kuhn M.
N. Kuhn, E. Lochin, J. Lacan, R. Boreli, C. Bes, L. Clarac
CLIFT: a Cross-Layer InFormation Tool to perform cross-layer analysis based on real physical traces
null
null
null
null
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Considering real physical (MAC/PHY) traces inside network simulations is a complex task that might lead to complex yet approximated models. However, realistic cross-layer analysis with the upper layer and in particular the transport layer cannot be driven without considering the MAC/PHY level. In this paper, we propose to cope with this problem by introducing a software that translates real physical events from a given trace in order to be used inside a network simulator such as $ns$-2. The main objective is to accurately perform analysis of the impact of link layer reliability schemes (obtained by the use of real physical traces) on transport layer performance. We detail the internal mechanisms and the benefits of this software with a focus on 4G satellite communications scenarios and present the resulting metrics provided by CLIFT to perform consistent cross-layer analysis.
[ { "version": "v1", "created": "Sun, 24 Jun 2012 02:52:59 GMT" } ]
2012-06-26T00:00:00
[ [ "Kuhn", "N.", "" ], [ "Lochin", "E.", "" ], [ "Lacan", "J.", "" ], [ "Boreli", "R.", "" ], [ "Bes", "C.", "" ], [ "Clarac", "L.", "" ] ]
new_dataset
0.981844
1206.5673
Konstantin Avrachenkov
Konstantin Avrachenkov (INRIA Sophia Antipolis), Philippe Nain (INRIA Sophia Antipolis), Uri Yechiali
A retrial system with two input streams and two orbit queues
N° RR-7999 (2012)
null
null
RR-7999
cs.DM
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Two independent Poisson streams of jobs flow into a single-server service system having a limited common buffer that can hold at most one job. If a type-i job (i=1,2) finds the server busy, it is blocked and routed to a separate type-i retrial (orbit) queue that attempts to re-dispatch its jobs at its specific Poisson rate. This creates a system with three dependent queues. Such a queueing system serves as a model for two competing job streams in a carrier sensing multiple access system. We study the queueing system using multi-dimensional probability generating functions, and derive its necessary and sufficient stability conditions while solving a boundary value problem. Various performance measures are calculated and numerical results are presented.
[ { "version": "v1", "created": "Fri, 22 Jun 2012 06:36:24 GMT" } ]
2012-06-26T00:00:00
[ [ "Avrachenkov", "Konstantin", "", "INRIA Sophia Antipolis" ], [ "Nain", "Philippe", "", "INRIA\n Sophia Antipolis" ], [ "Yechiali", "Uri", "" ] ]
new_dataset
0.998162
1206.5762
Kathryn Haymaker
Kathryn Haymaker and Christine A. Kelley
Geometric WOM codes and coding strategies for multilevel flash memories
Preliminary version, 15 pages, 4 figures
null
null
null
cs.IT math.CO math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper investigates the design and application of write-once memory (WOM) codes for flash memory storage. Using ideas from Merkx ('84), we present a construction of WOM codes based on finite Euclidean geometries over $\mathbb{F}_2$. This construction yields WOM codes with new parameters and provides insight into the criterion that incidence structures should satisfy to give rise to good codes. We also analyze methods of adapting binary WOM codes for use on multilevel flash cells. In particular, we give two strategies based on different rewrite objectives. A brief discussion of the average-write performance of these strategies, as well as concatenation methods for WOM codes is also provided.
[ { "version": "v1", "created": "Mon, 7 May 2012 16:11:52 GMT" } ]
2012-06-26T00:00:00
[ [ "Haymaker", "Kathryn", "" ], [ "Kelley", "Christine A.", "" ] ]
new_dataset
0.968591
1108.3742
Paul de Kerret
Paul de Kerret and David Gesbert
Degrees of Freedom of the Network MIMO Channel With Distributed CSI
null
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this work, we discuss the joint precoding with finite rate feedback in the so-called network MIMO where the TXs share the knowledge of the data symbols to be transmitted. We introduce a distributed channel state information (DCSI) model where each TX has its own local estimate of the overall multi-user MIMO channel and must make a precoding decision solely based on the available local CSI. We refer to this channel as the DCSI-MIMO channel and the precoding problem as distributed precoding. We extend to the DCSI setting the work from Jindal for the conventional MIMO Broadcast Channel (BC) in which the number of Degrees of Freedom (DoFs) achieved by Zero Forcing (ZF) was derived as a function of the scaling in the logarithm of the Signal-to-Noise Ratio (SNR) of the number of quantizing bits. Particularly, we show the seemingly pessimistic result that the number of DoFs at each user is limited by the worst CSI across all users and across all TXs. This is in contrast to the conventional MIMO BC where the number of DoFs at one user is solely dependent on the quality of the estimation of his own feedback. Consequently, we provide precoding schemes improving on the achieved number of DoFs. For the two-user case, the derived novel precoder achieves a number of DoFs limited by the best CSI accuracy across the TXs instead of the worst with conventional ZF. We also advocate the use of hierarchical quantization of the CSI, for which we show that considerable gains are possible. Finally, we use the previous analysis to derive the DoFs optimal allocation of the feedback bits to the various TXs under a constraint on the size of the aggregate feedback in the network, in the case where conventional ZF is used.
[ { "version": "v1", "created": "Thu, 18 Aug 2011 12:43:10 GMT" }, { "version": "v2", "created": "Fri, 1 Jun 2012 13:31:31 GMT" }, { "version": "v3", "created": "Fri, 22 Jun 2012 14:59:22 GMT" } ]
2012-06-25T00:00:00
[ [ "de Kerret", "Paul", "" ], [ "Gesbert", "David", "" ] ]
new_dataset
0.991833
1206.5048
Michael Kohlhase
Michael Kohlhase
The Planetary Project: Towards eMath3.0
Intelligent Computer Mathematics, Johan Jeuring, John A. Campbell, Jacques Carette, Gabriel Dos Reis, Petr Sojka, Makarius Wenzel, and Volker Sorge, eds, Springer Verlag LNAI 7362, 2012
null
null
null
cs.DL
http://creativecommons.org/licenses/by-nc-sa/3.0/
The Planetary project develops a general framework - the Planetary system - for social semantic portals that support users in interacting with STEM (Science/Technology/Engineering/Mathematics) documents. Developed from an initial attempt to replace the aging portal of PlanetMath.org with a mashup of existing MKM technologies, the Planetary system is now in a state, where it can serve as a basis for various eMath3.0 portals, ranging from eLearning systems over scientific archives to semantic help systems.
[ { "version": "v1", "created": "Fri, 22 Jun 2012 03:44:46 GMT" } ]
2012-06-25T00:00:00
[ [ "Kohlhase", "Michael", "" ] ]
new_dataset
0.953933
1206.5157
Vini Katyal
Vini Katyal, Aviral
Leaf vein segmentation using Odd Gabor filters and morphological operations
International Journal of Advanced Research in Computer Science Volume 3, No. 3, May-June 2012
null
null
null
cs.CV cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Leaf vein forms the basis of leaf characterization and classification. Different species have different leaf vein patterns. It is seen that leaf vein segmentation will help in maintaining a record of all the leaves according to their specific pattern of veins thus provide an effective way to retrieve and store information regarding various plant species in database as well as provide an effective means to characterize plants on the basis of leaf vein structure which is unique for every species. The algorithm proposes a new way of segmentation of leaf veins with the use of Odd Gabor filters and the use of morphological operations for producing a better output. The Odd Gabor filter gives an efficient output and is robust and scalable as compared with the existing techniques as it detects the fine fiber like veins present in leaves much more efficiently.
[ { "version": "v1", "created": "Fri, 22 Jun 2012 14:22:16 GMT" } ]
2012-06-25T00:00:00
[ [ "Katyal", "Vini", "" ], [ "Aviral", "", "" ] ]
new_dataset
0.997873
1206.5159
V\'it Jel\'inek
Steven Chaplick, V\'it Jel\'inek, Jan Kratochv\'il, Tom\'a\v{s} Vysko\v{c}il
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
17 pages, 14 figures, to appear in the proceedings of WG 2012
null
null
null
cs.CG cs.DM math.CO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper we study properties of intersection graphs of k-bend paths in the rectangular grid. A k-bend path is a path with at most k 90 degree turns. The class of graphs representable by intersections of k-bend paths is denoted by B_k-VPG. We show here that for every fixed k, B_k-VPG is a proper subset of B_{k+1}-VPG and that recognition of graphs from B_k-VPG is NP-complete even when the input graph is given by a B_{k+1}-VPG representation. We also show that the class B_k-VPG (for k>0) is in no inclusion relation with the class of intersection graphs of straight line segments in the plane.
[ { "version": "v1", "created": "Fri, 22 Jun 2012 14:28:30 GMT" } ]
2012-06-25T00:00:00
[ [ "Chaplick", "Steven", "" ], [ "Jelínek", "Vít", "" ], [ "Kratochvíl", "Jan", "" ], [ "Vyskočil", "Tomáš", "" ] ]
new_dataset
0.998334
1206.4618
Wei Liu
Wei Liu (Columbia University), Jun Wang (IBM T. J. Watson Research Center), Yadong Mu (Columbia University), Sanjiv Kumar (Google), Shih-Fu Chang (Columbia University)
Compact Hyperplane Hashing with Bilinear Functions
ICML2012
null
null
null
cs.LG stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Hyperplane hashing aims at rapidly searching nearest points to a hyperplane, and has shown practical impact in scaling up active learning with SVMs. Unfortunately, the existing randomized methods need long hash codes to achieve reasonable search accuracy and thus suffer from reduced search speed and large memory overhead. To this end, this paper proposes a novel hyperplane hashing technique which yields compact hash codes. The key idea is the bilinear form of the proposed hash functions, which leads to higher collision probability than the existing hyperplane hash functions when using random projections. To further increase the performance, we propose a learning based framework in which the bilinear functions are directly learned from the data. This results in short yet discriminative codes, and also boosts the search performance over the random projection based solutions. Large-scale active learning experiments carried out on two datasets with up to one million samples demonstrate the overall superiority of the proposed approach.
[ { "version": "v1", "created": "Mon, 18 Jun 2012 15:03:10 GMT" } ]
2012-06-22T00:00:00
[ [ "Liu", "Wei", "", "Columbia University" ], [ "Wang", "Jun", "", "IBM T. J. Watson Research\n Center" ], [ "Mu", "Yadong", "", "Columbia University" ], [ "Kumar", "Sanjiv", "", "Google" ], [ "Chang", "Shih-Fu", "", "Columbia University" ] ]
new_dataset
0.999212
1206.4652
Novi Quadrianto
Novi Quadrianto (University of Cambridge), Chao Chen (IST Austria), Christoph Lampert (IST Austria)
The Most Persistent Soft-Clique in a Set of Sampled Graphs
ICML2012
null
null
null
cs.LG cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
When searching for characteristic subpatterns in potentially noisy graph data, it appears self-evident that having multiple observations would be better than having just one. However, it turns out that the inconsistencies introduced when different graph instances have different edge sets pose a serious challenge. In this work we address this challenge for the problem of finding maximum weighted cliques. We introduce the concept of most persistent soft-clique. This is subset of vertices, that 1) is almost fully or at least densely connected, 2) occurs in all or almost all graph instances, and 3) has the maximum weight. We present a measure of clique-ness, that essentially counts the number of edge missing to make a subset of vertices into a clique. With this measure, we show that the problem of finding the most persistent soft-clique problem can be cast either as: a) a max-min two person game optimization problem, or b) a min-min soft margin optimization problem. Both formulations lead to the same solution when using a partial Lagrangian method to solve the optimization problems. By experiments on synthetic data and on real social network data, we show that the proposed method is able to reliably find soft cliques in graph data, even if that is distorted by random noise or unreliable observations.
[ { "version": "v1", "created": "Mon, 18 Jun 2012 15:24:31 GMT" } ]
2012-06-22T00:00:00
[ [ "Quadrianto", "Novi", "", "University of Cambridge" ], [ "Chen", "Chao", "", "IST Austria" ], [ "Lampert", "Christoph", "", "IST Austria" ] ]
new_dataset
0.973001
1206.4687
Cunsheng Ding
Cunsheng Ding
Cyclic Codes from APN and Planar Functions
arXiv admin note: text overlap with arXiv:1206.4370
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, almost perfect nonlinear functions and planar functions over finite fields are employed to construct a number of classes of cyclic codes. Lower bounds on the minimum weight of some classes of the cyclic codes are developed. The minimum weights of some other classes of the codes constructed in this paper are determined. The dimensions of the codes are flexible. Many of the codes presented in this paper are optimal or almost optimal in the sense that they meet some bound on linear codes. Ten open problems regarding cyclic codes from highly nonlinear functions are also presented.
[ { "version": "v1", "created": "Wed, 20 Jun 2012 02:13:08 GMT" } ]
2012-06-22T00:00:00
[ [ "Ding", "Cunsheng", "" ] ]
new_dataset
0.998746