OpenRaiser/Intern-Atlas huggingface dataset:
The Optimal Uncertainty Algorithm in the Mystic Framework
Venue: arXiv cs.DM 2012
Year: 2012

We have recently proposed a rigorous framework for Uncertainty Quantification (UQ) in which UQ objectives and assumption/information set are brought into the forefront, providing a framework for the communication and comparison of UQ results. In particular, this framework does not implicitly impose inappropriate assumptions nor does it repudiate relevant information. This framework, which we call Optimal Uncertainty Quantification (OUQ), is based on the observation that given a set of assumptions and information, there exist bounds on uncertainties obtained as values of optimization problems and that these bounds are optimal. It provides a uniform environment for the optimal solution of the problems of validation, certification, experimental design, reduced order modeling, prediction, extrapolation, all under aleatoric and epistemic uncertainties. OUQ optimization problems are extremely large, and even though under general conditions they have finite-dimensional reductions, they must often be solved numerically. This general algorithmic framework for OUQ has been implemented in the mystic optimization framework. We describe this implementation, and demonstrate its use in the context of the Caltech surrogate model for hypervelocity impact.
Towards 100 Gbps Ethernet: Development of Ethernet / Physical Layer Aspects
Venue: arXiv cs.NI 2012
Year: 2012

Physical layer features of Ethernet from the first realization towards the 100 Gb Ethernet (100 GbE) development have been considered. Comparisons of these features are made according to the standardized data rates. Feasible physical layer options are then discussed for high data rates.
Achievable Angles Between two Compressed Sparse Vectors Under Norm/Distance Constraints Imposed by the Restricted Isometry Property: A Plane Geometry Approach
Venue: arXiv cs.IT 2012
Year: 2012

The angle between two compressed sparse vectors subject to the norm/distance constraints imposed by the restricted isometry property (RIP) of the sensing matrix plays a crucial role in the studies of many compressive sensing (CS) problems. Assuming that (i) u and v are two sparse vectors separated by an angle thetha, and (ii) the sensing matrix Phi satisfies RIP, this paper is aimed at analytically characterizing the achievable angles between Phi*u and Phi*v. Motivated by geometric interpretations of RIP and with the aid of the well-known law of cosines, we propose a plane geometry based formulation for the study of the considered problem. It is shown that all the RIP-induced norm/distance constraints on Phi*u and Phi*v can be jointly depicted via a simple geometric diagram in the two-dimensional plane. This allows for a joint analysis of all the considered algebraic constraints from a geometric perspective. By conducting plane geometry analyses based on the constructed diagram, closed-form formulae for the maximal and minimal achievable angles are derived. Computer simulations confirm that the proposed solution is tighter than an existing algebraic-based estimate derived using the polarization identity. The obtained results are used to derive a tighter restricted isometry constant of structured sensing matrices of a certain kind, to wit, those in the form of a product of an orthogonal projection matrix and a random sensing matrix. Follow-up applications to three CS problems, namely, compressed-domain interference cancellation, RIP-based analysis of the orthogonal matching pursuit algorithm, and the study of democratic nature of random sensing matrices are investigated.
Stone Age Distributed Computing
Venue: arXiv cs.DC 2012
Year: 2012

The traditional models of distributed computing focus mainly on networks of computer-like devices that can exchange large messages with their neighbors and perform arbitrary local computations. Recently, there is a trend to apply distributed computing methods to networks of sub-microprocessor devices, e.g., biological cellular networks or networks of nano-devices. However, the suitability of the traditional distributed computing models to these types of networks is questionable: do tiny bio/nano nodes "compute" and/or "communicate" essentially the same as a computer? In this paper, we introduce a new model that depicts a network of randomized finite state machines operating in an asynchronous environment. Although the computation and communication capabilities of each individual device in the new model are, by design, much weaker than those of a computer, we show that some of the most important and extensively studied distributed computing problems can still be solved efficiently.
Reducing complexity of tail-biting trellises
Venue: arXiv cs.IT 2012
Year: 2012

It is shown that a trellis realization can be locally reduced if it is not state-trim, branch-trim, proper, observable, and controllable. These conditions are not sufficient for local irreducibility. Making use of notions that amount to "almost unobservability/uncontrollability", a necessary and sufficient criterion of local irreducibility for tail-biting trellises is presented.
Deployment of mobile routers ensuring coverage and connectivity
Venue: arXiv cs.RO 2012
Year: 2012

Maintaining connectivity among a group of autonomous agents exploring an area is very important, as it promotes cooperation between the agents and also helps message exchanges which are very critical for their mission. Creating an underlying Ad-hoc Mobile Router Network (AMRoNet) using simple robotic routers is an approach that facilitates communication between the agents without restricting their movements. We address the following question in our paper: How to create an AMRoNet with local information and with minimum number of routers? We propose two new localized and distributed algorithms 1) agent-assisted router deployment and 2) a self-spreading for creating AMRoNet. The algorithms use a greedy deployment strategy for deploying routers effectively into the area maximizing coverage and a triangular deployment strategy to connect different connected component of routers from different base stations. Empirical analysis shows that the proposed algorithms are the two best localized approaches to create AMRoNets.
Collaboration for enhancing the system development process in open source diligence
Venue: arXiv cs.SE 2012
Year: 2012

According to different opponents and commercial giants in software industries, the open source style software development has enough capacity to complete successfully the large scale projects. But we have seen many flaws and loops in collaboration and handling of mega scale projects in open source environment. Perhaps the collaboration is a key of successful project development. In this article we have tries to identify different feasible and reliable solution to a better collaboration ways in the open source system development. Some of the issues also that are found in the development phase of the open source have been identified and a proposed solution by explaining Successful communities such as GNU, the Apache Software Foundation, and Eclipse Foundation is discusses in this research article. It must be kept in mind that to improvement the collaboration in open source environment both the development community and the people should be more creative.
Handover Necessity Estimation for 4G Heterogeneous Networks
Venue: arXiv cs.NI 2012
Year: 2012

One of the most challenges of 4G network is to have a unified network of heterogeneous wireless networks. To achieve seamless mobility in such a diverse environment, vertical hand off is still a challenging problem. In many situations handover failures and unnecessary handoffs are triggered causing degradation of services, reduction in throughput and increase the blocking probability and packet loss. In this paper a new vertical handoff decision algorithm handover necessity estimation (HNE), is proposed to minimize the number of handover failure and unnecessary handover in heterogeneous wireless networks. we have proposed a multi criteria vertical handoff decision algorithm based on two parts: traveling time estimation and time threshold calculation. Our proposed methods are compared against two other methods: (a) the fixed RSS threshold based method, in which handovers between the cellular network and the WLAN are initiated when the RSS from the WLAN reaches a fixed threshold, and (b) the hysteresis based method, in which a hysteresis is introduced to prevent the ping-pong effect. Simulation results show that, this method reduced the number of handover failures and unnecessary handovers up to 80% and 70%, respectively.
On the Degrees of Freedom of time correlated MISO broadcast channel with delayed CSIT
Venue: arXiv cs.IT 2012
Year: 2012

We consider the time correlated MISO broadcast channel where the transmitter has partial knowledge on the current channel state, in addition to delayed channel state information (CSI). Rather than exploiting only the current CSI, as the zero-forcing precoding, or only the delayed CSI, as the Maddah-Ali-Tse (MAT) scheme, we propose a seamless strategy that takes advantage of both. The achievable degrees of freedom of the proposed scheme is characterized in terms of the quality of the current channel knowledge.
3D Model Assisted Image Segmentation
Venue: arXiv cs.CV 2012
Year: 2012

The problem of segmenting a given image into coherent regions is important in Computer Vision and many industrial applications require segmenting a known object into its components. Examples include identifying individual parts of a component for process control work in a manufacturing plant and identifying parts of a car from a photo for automatic damage detection. Unfortunately most of an object's parts of interest in such applications share the same pixel characteristics, having similar colour and texture. This makes segmenting the object into its components a non-trivial task for conventional image segmentation algorithms. In this paper, we propose a "Model Assisted Segmentation" method to tackle this problem. A 3D model of the object is registered over the given image by optimising a novel gradient based loss function. This registration obtains the full 3D pose from an image of the object. The image can have an arbitrary view of the object and is not limited to a particular set of views. The segmentation is subsequently performed using a level-set based method, using the projected contours of the registered 3D model as initialisation curves. The method is fully automatic and requires no user interaction. Also, the system does not require any prior training. We present our results on photographs of a real car.
Performance Analysis of $\ell_1$-synthesis with Coherent Frames
Venue: arXiv cs.IT 2012
Year: 2012

Signals with sparse frame representations comprise a much more realistic model of nature than that with orthonomal bases. Studies about the signal recovery associated with such sparsity models have been one of major focuses in compressed sensing. In such settings, one important and widely used signal recovery approach is known as $\ell_1$-synthesis (or Basis Pursuit). We present in this article a more effective performance analysis (than what are available) of this approach in which the dictionary $\Dbf$ may be highly, and even perfectly correlated. Under suitable conditions on the sensing matrix $\Phibf$, an error bound of the recovered signal $\hat{\fbf}$ (by the $\ell_1$-synthesis method) is established. Such an error bound is governed by the decaying property of $\tilde{\Dbf}_{\text{o}}^*\fbf$, where $\fbf$ is the true signal and $\tilde{\Dbf}_{\text{o}}$ denotes the optimal dual frame of $\Dbf$ in the sense that $\|\tilde{\Dbf}_{\text{o}}^*\hat{\fbf}\|_1$ produces the smallest $\|\tilde{\Dbf}^*\tilde{\fbf}\|_1$ in value among all dual frames $\tilde{\Dbf}$ of $\Dbf$ and all feasible signals $\tilde{\fbf}$. This new performance analysis departs from the usual description of the combo $\Phibf\Dbf$, and places the description on $\Phibf$. Examples are demonstrated to show that when the usual analysis fails to explain the working performance of the synthesis approach, the newly established results do.
Multi-robot coverage to locate fixed targets using formation structures
Venue: arXiv cs.RO 2012
Year: 2012

This paper develops an algorithm that guides a multi-robot system in an unknown environment in search of fixed targets. The area to be scanned contains an unknown number of convex obstacles of unknown size and shape. The algorithm covers the entire free space in a sweeping fashion and as such relies on the use of robot formations. The geometry of the robot group is a lateral line formation, which is allowed to split and rejoin when passing obstacles. It is our main goal to exploit this formation structure in order to reduce robot resources to a minimum. Each robot has a limited and finite amount of memory available. No information of the topography is recorded. Communication between two robots is only possible up to a maximum inter-robot distance, and if the line-of-sight between both robots is not obstructed. Broadcasting capabilities and indirect communication are not allowed. Supervisory control is prohibited. The number of robots equipped with GPS is kept as small as possible. Applications of the algorithm are mine field clearance, search-and-rescue missions, and intercept missions. Simulations are included and made available on the internet, demonstrating the flexibility of the algorithm.
Remarks on Category-Based Routing in Social Networks
Venue: arXiv cs.SI 2012
Year: 2012

It is well known that individuals can route messages on short paths through social networks, given only simple information about the target and using only local knowledge about the topology. Sociologists conjecture that people find routes greedily by passing the message to an acquaintance that has more in common with the target than themselves, e.g. if a dentist in Saarbrücken wants to send a message to a specific lawyer in Munich, he may forward it to someone who is a lawyer and/or lives in Munich. Modelling this setting, Eppstein et al. introduced the notion of category-based routing. The goal is to assign a set of categories to each node of a graph such that greedy routing is possible. By proving bounds on the number of categories a node has to be in we can argue about the plausibility of the underlying sociological model. In this paper we substantially improve the upper bounds introduced by Eppstein et al. and prove new lower bounds.
Streaming an image through the eye: The retina seen as a dithered scalable image coder
Venue: arXiv cs.CV 2012
Year: 2012

We propose the design of an original scalable image coder/decoder that is inspired from the mammalians retina. Our coder accounts for the time-dependent and also nondeterministic behavior of the actual retina. The present work brings two main contributions: As a first step, (i) we design a deterministic image coder mimicking most of the retinal processing stages and then (ii) we introduce a retinal noise in the coding process, that we model here as a dither signal, to gain interesting perceptual features. Regarding our first contribution, our main source of inspiration will be the biologically plausible model of the retina called Virtual Retina. The main novelty of this coder is to show that the time-dependent behavior of the retina cells could ensure, in an implicit way, scalability and bit allocation. Regarding our second contribution, we reconsider the inner layers of the retina. We emit a possible interpretation for the non-determinism observed by neurophysiologists in their output. For this sake, we model the retinal noise that occurs in these layers by a dither signal. The dithering process that we propose adds several interesting features to our image coder. The dither noise whitens the reconstruction error and decorrelates it from the input stimuli. Furthermore, integrating the dither noise in our coder allows a faster recognition of the fine details of the image during the decoding process. Our present paper goal is twofold. First, we aim at mimicking as closely as possible the retina for the design of a novel image coder while keeping encouraging performances. Second, we bring a new insight concerning the non-deterministic behavior of the retina.
Statistical reliability and path diversity based PageRank algorithm improvements
Venue: arXiv cs.IR 2012
Year: 2012

In this paper we present new improvement ideas of the original PageRank algorithm. The first idea is to introduce an evaluation of the statistical reliability of the ranking score of each node based on the local graph property and the second one is to introduce the notion of the path diversity. The path diversity can be exploited to dynamically modify the increment value of each node in the random surfer model or to dynamically adapt the damping factor. We illustrate the impact of such modifications through examples and simple simulations.
The artifacts of component-based development
Venue: arXiv cs.SE 2012
Year: 2012

Component based development idea was floated in a conference name "Mass Produced Software Components" in 1968 [1]. Since then engineering and scientific libraries are developed to reuse the previously developed functions. This concept is now widely used in SW development as component based development (CBD). Component-based software engineering (CBSE) is used to develop/ assemble software from existing components [2]. Software developed using components is called component ware [3]. This paper presents different architectures of CBD such as ActiveX, common object request broker architecture (CORBA), remote method invocation (RMI) and simple object access protocol (SOAP). The overall objective of this paper is to support the practice of CBD by comparing its advantages and disadvantages. This paper also evaluates object oriented process model to adapt it for CBD.
Autonomic html interface generator for web applications
Venue: arXiv cs.SE 2012
Year: 2012

Recent advances in computing systems have led to a new digital era in which every area of life is nearly interrelated with information technology. However, with the trend towards large-scale IT systems, a new challenge has emerged. The complexity of IT systems is becoming an obstacle that hampers the manageability, operability, and maintainability of modern computing infrastructures. Autonomic computing popped up to provide an answer to these ever-growing pitfalls. Fundamentally, autonomic systems are self-configuring, self-healing, self-optimizing, and self-protecting; hence, they can automate all complex IT processes without human intervention. This paper proposes an autonomic HTML web-interface generator based on XML Schema and Style Sheet specifications for self-configuring graphical user interfaces of web applications. The goal of this autonomic generator is to automate the process of customizing GUI web-interfaces according to the ever-changing business rules, policies, and operating environment with the least IT labor involvement. The conducted experiments showed a successful automation of web interfaces customization that dynamically self-adapts to keep with the always-changing business requirements. Future research can improve upon the proposed solution so that it supports the selfconfiguring of not only web applications but also desktop applications.
Building sustainable ecosystem-oriented architectures
Venue: arXiv cs.SE 2012
Year: 2012

Currently, organizations are transforming their business processes into e-services and service-oriented architectures to improve coordination across sales, marketing, and partner channels, to build flexible and scalable systems, and to reduce integration-related maintenance and development costs. However, this new paradigm is still fragile and lacks many features crucial for building sustainable and progressive computing infrastructures able to rapidly respond and adapt to the always-changing market and environmental business. This paper proposes a novel framework for building sustainable Ecosystem- Oriented Architectures (EOA) using e-service models. The backbone of this framework is an ecosystem layer comprising several computing units whose aim is to deliver universal interoperability, transparent communication, automated management, self-integration, self-adaptation, and security to all the interconnected services, components, and devices in the ecosystem. Overall, the proposed model seeks to deliver a comprehensive and a generic sustainable business IT model for developing agile e-enterprises that are constantly up to new business constraints, trends, and requirements. Future research can improve upon the proposed model so much so that it supports computational intelligence to help in decision making and problem solving.
Towards Linear Time Overlapping Community Detection in Social Networks
Venue: arXiv cs.SI 2012
Year: 2012

Membership diversity is a characteristic aspect of social networks in which a person may belong to more than one social group. For this reason, discovering overlapping structures is necessary for realistic social analysis. In this paper, we present a fast algorithm1, called SLPA, for overlapping community detection in large-scale networks. SLPA spreads labels according to dynamic interaction rules. It can be applied to both unipartite and bipartite networks. It is also able to uncover overlapping nested hierarchy. The time complexity of SLPA scales linearly with the number of edges in the network. Experiments in both synthetic and real- world networks show that SLPA has an excellent performance in identifying both node and community level overlapping structures.
A New Teaching Model For The Subject Of Software Project Management
Venue: arXiv cs.SE 2012
Year: 2012

Software (SW) development is a very tough task which requires a skilled project leader for its success. If the project leader is not skilled enough then project may fail. In the real world of SW engineering 65% of the SW projects fail to meet their objectives as in [1]. The main reason is lack of training of the project mangers. This extreme ratio of failure can be reduced by teaching SW project management (SPM) to the future project managers in the practical manner, so that they may be skillful enough to handle the project in a better way. This paper intends to propose a model to be used to teach SPM to the student of SW engineering to reduce the failure rate of projects.
A Step Forward To Component-based Software Cost Estimation in Object-oriented Environment
Venue: arXiv cs.SE 2012
Year: 2012

Software cost estimation (SCE) of a project is pivotal to the acceptance or rejection of the development of software project. Various SCE techniques have been in practice with their own strengths and limitations. The latest of these is object-oriented one. Currently object-oriented approach for SCE is based on Line of Code (LOC), function points, functions and classes etc. Relatively less attention has been paid to the SCE in component-based software engineering (CBSE). So there is a pressing need to search parameters/variables that have a vital role for the SCE using CBSE which is taken up in this paper. This paper further looks at level of significance of all the parameters/variables thus searched. The time is being used as an independent variable because time is a parameter which is almost, all previous in one. Therefore this approach may be in a way an alternate of all previous approaches. Infact the underlying research ultimately may lead towards SCE of complex systems, using CBSE, in a scientific, systematic and comprehensive way.