OpenRaiser/Intern-Atlas huggingface dataset:
Modern Symmetric Cryptography methodologies and its applications
Venue: arXiv cs.CR 2009
Year: 2009

Nowadays, using cryptographic systems play an effective role in security and safety technologies. One of the most applied kind of cryptography is Symmetric Cryptography and its applications. New aspects of symmetric Cryptography methodologies and applications has been presented by this paper. Security-based networks and some complex technologies such as RFID and parallel security settings has been intro-duced by using Symmetric Cryptography is the main base of discussion in this paper. Designing an unique protocol for Symmetric Cryptography in security networks elements is our focus. Reviewing benefits of using these methodologies has been pre-sented and discussed in this paper.
Nonlinear Effects in Stiffness Modeling of Robotic Manipulators
Venue: arXiv cs.RO 2009
Year: 2009

The paper focuses on the enhanced stiffness modeling of robotic manipulators by taking into account influence of the external force/torque acting upon the end point. It implements the virtual joint technique that describes the compliance of manipulator elements by a set of localized six-dimensional springs separated by rigid links and perfect joints. In contrast to the conventional formulation, which is valid for the unloaded mode and small displacements, the proposed approach implicitly assumes that the loading leads to the non-negligible changes of the manipulator posture and corresponding amendment of the Jacobian. The developed numerical technique allows computing the static equilibrium and relevant force/torque reaction of the manipulator for any given displacement of the end-effector. This enables designer detecting essentially nonlinear effects in elastic behavior of manipulator, similar to the buckling of beam elements. It is also proposed the linearization procedure that is based on the inversion of the dedicated matrix composed of the stiffness parameters of the virtual springs and the Jacobians/Hessians of the active and passive joints. The developed technique is illustrated by an application example that deals with the stiffness analysis of a parallel manipulator of the Orthoglide family.
Completeness of the WDS method in Checking Positivity of Integral Forms
Venue: arXiv cs.SC 2009
Year: 2009

Examples show that integral forms can be efficiently proved positive semidefinite by the WDS method, but it was unknown that how many steps of substitutions are needed, or furthermore, which integral forms is this method applicable for. In this paper, we give upper bounds of step numbers of WDS required in proving that an integral form is positive definite, positive semidefinite, or not positive semidefinite, thus deducing that the WDS method is complete.
Lexicographic Multi-objective Geometric Programming Problems
Venue: arXiv cs.DS 2009
Year: 2009

A Geometric programming (GP) is a type of mathematical problem characterized by objective and constraint functions that have a special form. Many methods have been developed to solve large scale engineering design GP problems. In this paper GP technique has been used to solve multi-objective GP problem as a vector optimization problem. The duality theory for lexicographic geometric programming has been developed to solve the problems with posynomial in objectives and constraints.
ICT in Universities of the Western Himalayan Region in India: Status, Performance- An Assessment
Venue: arXiv cs.CY 2009
Year: 2009

The present paper describes a live project study carried out for the universities located in the western Himalayan region of India in the year 2009. The objective of this study is to undertake the task of assessment regarding initiative, utilization of ICT resources, its performance and impact in these higher educational institutions/universities. In order to answer these, initially basic four- tier framework was prepared. Followed by a questionnaire containing different ICT components 18 different groups like vision, planning, implementation, ICT infrastructure and related activities exhibiting performance. Primary data in the form of feedback on the five point scale, of the questionnaire, was gathered from six universities of the region. A simple statistical analysis was undertaken using weighted mean, to assess the ICT initiative, status and performance of various universities. In the process, a question related to Performance Indicator was identified from each group, whose Coefficient of Correlation was calculated. This study suggests that a progressive vision, planning and initiative regarding academic syllabi, ICT infrastructure, used in training the skilled human resource, is going to have a favourable impact through actual placement, research and play a dominant role at the National and International level.
Verifying Real-Time Systems using Explicit-time Description Methods
Venue: arXiv cs.LO 2009
Year: 2009

Timed model checking has been extensively researched in recent years. Many new formalisms with time extensions and tools based on them have been presented. On the other hand, Explicit-Time Description Methods aim to verify real-time systems with general untimed model checkers. Lamport presented an explicit-time description method using a clock-ticking process (Tick) to simulate the passage of time together with a group of global variables for time requirements. This paper proposes a new explicit-time description method with no reliance on global variables. Instead, it uses rendezvous synchronization steps between the Tick process and each system process to simulate time. This new method achieves better modularity and facilitates usage of more complex timing constraints. The two explicit-time description methods are implemented in DIVINE, a well-known distributed-memory model checker. Preliminary experiment results show that our new method, with better modularity, is comparable to Lamport's method with respect to time and memory efficiency.
MIMO Precoding with X- and Y-Codes
Venue: arXiv cs.IT 2009
Year: 2009

We consider a time division duplex (TDD) $n_t \times n_r$ multiple-input multiple-output (MIMO) system with channel state information (CSI) at both the transmitter and receiver. We propose X- and Y-Codes to achieve high multiplexing and diversity gains at low complexity. The proposed precoding schemes are based upon the singular value decomposition (SVD) of the channel matrix which transforms the MIMO channel into parallel subchannels. Then X- and Y-Codes are used to improve the diversity gain by pairing the subchannels, prior to SVD precoding. In particular, the subchannels with good diversity are paired with those having low diversity gains. Hence, a pair of channels is jointly encoded using a $2 \times 2$ real matrix, which is fixed {\em a priori} and does not change with each channel realization. For X-Codes these matrices are 2-dimensional rotation matrices parameterized by a single angle, while for Y-Codes, these matrices are 2-dimensional upper left triangular matrices. The complexity of the maximum likelihood decoding (MLD) for both X- and Y-Codes is low. Specifically, the decoding complexity of Y-Codes is the same as that of a scalar channel. Moreover, we propose X-, Y-Precoders with the same structure as X-, Y-Codes, but the encoding matrices adapt to each channel realization. The optimal encoding matrices for X-, Y-Codes/Precoders are derived analytically. Finally, it is observed that X-Codes/Precoders perform better for well-conditioned channels, while Y-Codes/Precoders perform better for ill-conditioned channels, when compared to other precoding schemes in the literature.
Institutional Repository saber.ula.ve: A testimonial perspective
Venue: arXiv cs.DL 2009
Year: 2009

In this paper, we describe our decade-long experience of building and operating one of the most active Institutional Repository in the world: www.saber.ula.ve <http://www.saber.ula.ve> (University of the Andes, Merida-Venezuela). In order to share our experience with other institutions, we firstly explain the steps we followed to preserve and disseminate the scientific production of the University of Los Andes' researchers. We then present some recent quantitative results about our repository activities and we outline some methodological guidelines that could be applied in order to replicate similar experiences. These guidelines list the ingredients or building blocks as well as the processes followed for developing and maintaining the services of an Institutional Repository. These include technological infrastructure; institutional policies on preservation, publication and dissemination of knowledge; recommendations on incentives for open access publication; the process of selection, testing and adaptation of technological tools; the planning and organization of services, and the dissemination and support within the scientific community that will eventually lead to the adoption of the ideas that lie behind the open access movement. We summarize the results obtained regarding the acceptance, adoption and use of the technological tools used for the publication of our institution's intellectual production, and we present the main obstacles encountered on the way.
Renewal theory in analysis of tries and strings
Venue: arXiv cs.DS 2009
Year: 2009

We give a survey of a number of simple applications of renewal theory to problems on random strings and tries: insertion depth, size, insertion mode and imbalance of tries; variations for b-tries and Patricia tries; Khodak and Tunstall codes.
The Smallville Effect: Social Ties Make Mobile Networks More Secure Against the Node Capture Attack
Venue: arXiv cs.CR 2009
Year: 2009

Mobile Ad Hoc networks, due to the unattended nature of the network itself and the dispersed location of nodes, are subject to several unique security issues. One of the most vexed security threat is node capture. A few solutions have already been proposed to address this problem; however, those solutions are either centralized or focused on theoretical mobility models alone. In the former case the solution does not fit well the distributed nature of the network while, in the latter case, the quality of the solutions obtained for realistic mobility models severely differs from the results obtained for theoretical models. The rationale of this paper is inspired by the observation that re-encounters of mobile nodes do elicit a form of social ties. Leveraging these ties, it is possible to design efficient and distributed algorithms that, with a moderated degree of node cooperation, enforce the emergent property of node capture detection. In particular, in this paper we provide a proof of concept proposing a set of algorithms that leverage, to different extent, node mobility and node cooperation--that is, identifying social ties--to thwart node capture attack. In particular, we test these algorithms on a realistic mobility scenario. Extensive simulations show the quality of the proposed solutions and, more important, the viability of the proposed approach.
Detection and Prevention of New and Unknown Malware using Honeypots
Venue: arXiv cs.NI 2009
Year: 2009

Security has become ubiquitous in every domain today as newly emerging malware pose an ever-increasing perilous threat to systems. Consequently, honeypots are fast emerging as an indispensible forensic tool for the analysis of malicious network traffic. Honeypots can be considered to be traps for hackers and intruders and are generally deployed complimentary to Intrusion Detection Systems (IDS) and Intrusion Prevention Systems (IPS) in a network. They help system administrators perform a rigorous analysis of external and internal attacks on their networks. They are also used by security firms and research labs to capture the latest variants of malware. However, honeypots would serve a slightly different purpose in our proposed system. We intend to use honeypots for generating and broadcasting instant cures for new and unknown malware in a network. The cures which will be in the form of on-the-fly anti-malware signatures would spread in a fashion that is similar to the way malware spreads across networks. The most striking advantage of implementing this technology is that an effective initial control can be exercised on malware. Proposed system would be capable of providing cures for new fatal viruses which have not yet been discovered by prime security firms of the world.
DiVinE-CUDA - A Tool for GPU Accelerated LTL Model Checking
Venue: arXiv cs.DC 2009
Year: 2009

In this paper we present a tool that performs CUDA accelerated LTL Model Checking. The tool exploits parallel algorithm MAP adjusted to the NVIDIA CUDA architecture in order to efficiently detect the presence of accepting cycles in a directed graph. Accepting cycle detection is the core algorithmic procedure in automata-based LTL Model Checking. We demonstrate that the tool outperforms non-accelerated version of the algorithm and we discuss where the limits of the tool are and what we intend to do in the future to avoid them.
A Model-Based Approach to Predicting Predator-Prey & Friend-Foe Relationships in Ant Colonies
Venue: arXiv cs.AI 2009
Year: 2009

Understanding predator-prey relationships among insects is a challenging task in the domain of insect-colony research. This is due to several factors involved, such as determining whether a particular behavior is the result of a predator-prey interaction, a friend-foe interaction or another kind of interaction. In this paper, we analyze a series of predator-prey and friend-foe interactions in two colonies of carpenter ants to better understand and predict such behavior. Using the data gathered, we have also come up with a preliminary model for predicting such behavior under the specific conditions the experiment was conducted in. In this paper, we present the results of our data analysis as well as an overview of the processes involved.
Deterministic Identity Testing of Read-Once Algebraic Branching Programs
Venue: arXiv cs.CC 2009
Year: 2009

In this paper we study polynomial identity testing of sums of $k$ read-once algebraic branching programs ($Σ_k$-RO-ABPs), generalizing the work in (Shpilka and Volkovich 2008,2009), who considered sums of $k$ read-once formulas ($Σ_k$-RO-formulas). We show that $Σ_k$-RO-ABPs are strictly more powerful than $Σ_k$-RO-formulas, for any $k \leq \lfloor n/2\rfloor$, where $n$ is the number of variables. We obtain the following results: 1) Given free access to the RO-ABPs in the sum, we get a deterministic algorithm that runs in time $O(k^2n^7s) + n^{O(k)}$, where $s$ bounds the size of any largest RO-ABP given on the input. This implies we have a deterministic polynomial time algorithm for testing whether the sum of a constant number of RO-ABPs computes the zero polynomial. 2) Given black-box access to the RO-ABPs computing the individual polynomials in the sum, we get a deterministic algorithm that runs in time $k^2n^{O(\log n)} + n^{O(k)}$. 3) Finally, given only black-box access to the polynomial computed by the sum of the $k$ RO-ABPs, we obtain an $n^{O(k + \log n)}$ time deterministic algorithm.
The first Italian research assessment exercise: a bibliometric perspective
Venue: arXiv cs.CY 2009
Year: 2009

In December 2003, seventeen years after the first UK research assessment exercise, Italy started up its first-ever national research evaluation, with the aim to evaluate, using the peer review method, the excellence of the national research production. The evaluation involved 20 disciplinary areas, 102 research structures, 18,500 research products and 6,661 peer reviewers (1,465 from abroad); it had a direct cost of 3.55 millions Euros and a time length spanning over 18 months. The introduction of ratings based on ex post quality of output and not on ex ante respect for parameters and compliance is an important leap forward of the national research evaluation system toward meritocracy. From the bibliometric perspective, the national assessment offered the unprecedented opportunity to perform a large-scale comparison of peer review and bibliometric indicators for an important share of the Italian research production. The present investigation takes full advantage of this opportunity to test whether peer review judgements and (article and journal) bibliometric indicators are independent variables and, in the negative case, to measure the sign and strength of the association. Outcomes allow us to advocate the use of bibliometric evaluation, suitably integrated with expert review, for the forthcoming national assessment exercises, with the goal of shifting from the assessment of research excellence to the evaluation of average research performance without significant increase of expenses.
The Gaussian Surface Area and Noise Sensitivity of Degree-$d$ Polynomials
Venue: arXiv cs.CC 2009
Year: 2009

We provide asymptotically sharp bounds for the Gaussian surface area and the Gaussian noise sensitivity of polynomial threshold functions. In particular we show that if $f$ is a degree-$d$ polynomial threshold function, then its Gaussian sensitivity at noise rate $ε$ is less than some quantity asymptotic to $\frac{d\sqrt{2ε}}π$ and the Gaussian surface area is at most $\frac{d}{\sqrt{2π}}$. Furthermore these bounds are asymptotically tight as $ε\to 0$ and $f$ the threshold function of a product of $d$ distinct homogeneous linear functions.
Maps on the basis of the Arts & Humanities Citation Index: The journals Leonardo and Art Journal versus "Digital Humanities" as a topic
Venue: arXiv cs.DL 2009
Year: 2009

The possibilities of using the Arts & Humanities Citation Index (A&HCI) for journal mapping have not been sufficiently recognized because of the absence of a Journal Citations Report (JCR) for this database. A quasi-JCR for the A&HCI (2008) was constructed from the data contained in the Web-of-Science and is used for the evaluation of two journals as examples: Leonardo and Art Journal. The maps on the basis of the aggregated journal-journal citations within this domain can be compared with maps including references to journals in the Science Citation Index and Social Science Citation Index. Art journals are cited by (social) science journals more than by other art journals, but these journals draw upon one another in terms of their own references. This cultural impact in terms of being cited is not found when documents with a topic such as "digital humanities" are analyzed. This community of practice functions more as an intellectual organizer than a journal.
Derandomizing from Random Strings
Venue: arXiv cs.CC 2009
Year: 2009

In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings R_K. It was previously known that PSPACE, and hence BPP is Turing-reducible to R_K. The earlier proof relied on the adaptivity of the Turing-reduction to find a Kolmogorov-random string of polynomial length using the set R_K as oracle. Our new non-adaptive result relies on a new fundamental fact about the set R_K, namely each initial segment of the characteristic sequence of R_K is not compressible by recursive means. As a partial converse to our claim we show that strings of high Kolmogorov-complexity when used as advice are not much more useful than randomly chosen strings.
A Metamodel of Unit Testing for Object-Oriented Programming Languages
Venue: arXiv cs.PL 2009
Year: 2009

A unit test is a method for verifying the accuracy and the proper functioning of a portion of a program. This work consists to study the relation and the approaches to test Object-Oriented Programming (OOP) programs and to propose a metamodel that enables the programmer to write the tests while writing the source code to be tested by exploiting the key features of OOP programming languages such as inheritance, polymorphism, etc.
Secure Watermarking Scheme for Color Image Using Intensity of Pixel and LSB Substitution
Venue: arXiv cs.GR 2009
Year: 2009

In this paper a novel spatial domain LSB based watermarking scheme for color Images is proposed. The proposed scheme is of type blind and invisible watermarking. Our scheme introduces the concept of storing variable number of bits in each pixel based on the actual color value of pixel. Equal or higher the color value of channels with respect to intensity of pixel stores higher number of watermark bits. The Red, Green and Blue channel of the color image has been used for watermark embedding. The watermark is embedded into selected channels of pixel. The proposed method supports high watermark embedding capacity, which is equivalent to the size of cover image. The security of watermark is preserved by permuting the watermark bits using secret key. The proposed scheme is found robust to various image processing operations such as image compression, blurring, salt and pepper noise, filtering and cropping.
Penetration Testing: A Roadmap to Network Security
Venue: arXiv cs.NI 2009
Year: 2009

Network penetration testing identifies the exploits and vulnerabilities those exist within computer network infrastructure and help to confirm the security measures. The objective of this paper is to explain methodology and methods behind penetration testing and illustrate remedies over it, which will provide substantial value for network security Penetration testing should model real world attacks as closely as possible. An authorized and scheduled penetration testing will probably detected by IDS (Intrusion Detection System). Network penetration testing is done by either or manual automated tools. Penetration test can gather evidence of vulnerability in the network. Successful testing provides indisputable evidence of the problem as well as starting point for prioritizing remediation. Penetration testing focuses on high severity vulnerabilities and there are no false positive.
A Novel Feature Extraction for Robust EMG Pattern Recognition
Venue: arXiv cs.CV 2009
Year: 2009

Varieties of noises are major problem in recognition of Electromyography (EMG) signal. Hence, methods to remove noise become most significant in EMG signal analysis. White Gaussian noise (WGN) is used to represent interference in this paper. Generally, WGN is difficult to be removed using typical filtering and solutions to remove WGN are limited. In addition, noise removal is an important step before performing feature extraction, which is used in EMG-based recognition. This research is aimed to present a novel feature that tolerate with WGN. As a result, noise removal algorithm is not needed. Two novel mean and median frequencies (MMNF and MMDF) are presented for robust feature extraction. Sixteen existing features and two novelties are evaluated in a noisy environment. WGN with various signal-to-noise ratios (SNRs), i.e. 20-0 dB, was added to the original EMG signal. The results showed that MMNF performed very well especially in weak EMG signal compared with others. The error of MMNF in weak EMG signal with very high noise, 0 dB SNR, is about 5-10 percent and closed by MMDF and Histogram, whereas the error of other features is more than 20 percent. While in strong EMG signal, the error of MMNF is better than those from other features. Moreover, the combination of MMNF, Histrogram of EMG and Willison amplitude is used as feature vector in classification task. The experimental result shows the better recognition result in noisy environment than other success feature candidates. From the above results demonstrate that MMNF can be used for new robust feature extraction.
Teaching Result Analysis Using Rough Sets and Data Mining
Venue: arXiv cs.OH 2009
Year: 2009

The development of IT and WWW provides different teaching strategies, which are chosen by teachers. Students can acquire knowledge through different learning models. The problem based learning is a popular teaching strategy for teachers. Based on the educational theory, students increase their learning motivation, which can increase learning effectiveness. In this paper, we propose a concept map for each student and staff. This map finds the result of the subjects and also recommends a sequence of remedial teaching. Here, rough set theory is used for dealing with uncertainty in the hidden pattern of data. For each competence the lower and upper approximations are calculated based on the brainstorm maps.