OpenRaiser/Intern-Atlas huggingface dataset:
Learning Multi-modal Similarity
Venue: arXiv cs.AI 2010
Year: 2010

In many applications involving multi-media data, the definition of similarity between items is integral to several key tasks, e.g., nearest-neighbor retrieval, classification, and recommendation. Data in such regimes typically exhibits multiple modalities, such as acoustic and visual content of video. Integrating such heterogeneous data to form a holistic similarity space is therefore a key challenge to be overcome in many real-world applications. We present a novel multiple kernel learning technique for integrating heterogeneous data into a single, unified similarity space. Our algorithm learns an optimal ensemble of kernel transfor- mations which conform to measurements of human perceptual similarity, as expressed by relative comparisons. To cope with the ubiquitous problems of subjectivity and inconsistency in multi- media similarity, we develop graph-based techniques to filter similarity measurements, resulting in a simplified and robust training procedure.
Increased Capacity per Unit-Cost by Oversampling
Venue: arXiv cs.IT 2010
Year: 2010

It is demonstrated that doubling the sampling rate recovers some of the loss in capacity incurred on the bandlimited Gaussian channel with a one-bit output quantizer.
Golden Coded Multiple Beamforming
Venue: arXiv cs.IT 2010
Year: 2010

The Golden Code is a full-rate full-diversity space-time code, which achieves maximum coding gain for Multiple-Input Multiple-Output (MIMO) systems with two transmit and two receive antennas. Since four information symbols taken from an M-QAM constellation are selected to construct one Golden Code codeword, a maximum likelihood decoder using sphere decoding has the worst-case complexity of O(M^4), when the Channel State Information (CSI) is available at the receiver. Previously, this worst-case complexity was reduced to O(M^(2.5)) without performance degradation. When the CSI is known by the transmitter as well as the receiver, beamforming techniques that employ singular value decomposition are commonly used in MIMO systems. In the absence of channel coding, when a single symbol is transmitted, these systems achieve the full diversity order provided by the channel. Whereas this property is lost when multiple symbols are simultaneously transmitted. However, uncoded multiple beamforming can achieve the full diversity order by adding a properly designed constellation precoder. For 2 \times 2 Fully Precoded Multiple Beamforming (FPMB), the general worst-case decoding complexity is O(M). In this paper, Golden Coded Multiple Beamforming (GCMB) is proposed, which transmits the Golden Code through 2 \times 2 multiple beamforming. GCMB achieves the full diversity order and its performance is similar to general MIMO systems using the Golden Code and FPMB, whereas the worst-case decoding complexity of O(sqrt(M)) is much lower. The extension of GCMB to larger dimensions is also discussed.
Joint Relay Selection and Link Adaptation for Distributed Beamforming in Regenerative Cooperative Networks
Venue: arXiv cs.IT 2010
Year: 2010

Relay selection enhances the performance of the cooperative networks by selecting the links with higher capacity. Meanwhile link adaptation improves the spectral efficiency of wireless data-centric networks through adapting the modulation and coding schemes (MCS) to the current link condition. In this paper, relay selection is combined with link adaptation for distributed beamforming in a two-hop regenerative cooperative system. A novel signaling mechanism and related optimal algorithms are proposed for joint relay selection and link adaptation. In the proposed scheme, there is no need to feedback the relay selection results to each relay. Instead, by broadcasting the link adaptation results from the destination, each relay will automatically understand whether it is selected or not. The lower and upper bounds of the throughput of the proposed scheme are derived. The analysis and simulation results indicate that the proposed scheme provides synergistic gains compared to the pure relay selection and link adaptation schemes.
Comparative Studies of 10 Programming Languages within 10 Diverse Criteria -- a Team 7 COMP6411-S10 Term Report
Venue: arXiv cs.PL 2010
Year: 2010

There are many programming languages in the world today.Each language has their advantage and disavantage. In this paper, we will discuss ten programming languages: C++, C#, Java, Groovy, JavaScript, PHP, Schalar, Scheme, Haskell and AspectJ. We summarize and compare these ten languages on ten different criterion. For example, Default more secure programming practices, Web applications development, OO-based abstraction and etc. At the end, we will give our conclusion that which languages are suitable and which are not for using in some cases. We will also provide evidence and our analysis on why some language are better than other or have advantages over the other on some criterion.
Field Reconstruction in Sensor Networks with Coverage Holes and Packet Losses
Venue: arXiv cs.NI 2010
Year: 2010

Environmental monitoring is often performed through a wireless sensor network, whose nodes are randomly deployed over the geographical region of interest. Sensors sample a physical phenomenon (the so-called field) and send their measurements to a {\em sink} node, which is in charge of reconstructing the field from such irregular samples. In this work, we focus on scenarios of practical interest where the sensor deployment is unfeasible in certain areas of the geographical region, e.g., due to terrain asperities, and the delivery of sensor measurements to the sink may fail due to fading or to transmission collisions among sensors simultaneously accessing the wireless medium. Under these conditions, we carry out an asymptotic analysis and evaluate the quality of the estimation of a d-dimensional field when the sink uses linear filtering as a reconstruction technique. Specifically, given the matrix representing the sampling system, V, we derive both the moments and an expression of the limiting spectral distribution of VV*, as the size of V goes to infinity and its aspect ratio has a finite limit bounded away from zero. By using such asymptotic results, we approximate the mean square error on the estimated field through the eta-transform of VV*, and derive the sensor network performance under the conditions described above.
System Description: H-PILoT (Version 1.9)
Venue: arXiv cs.LO 2010
Year: 2010

This system description provides an overview of H-PILoT (Hierarchical Proving by Instantiation in Local Theory extensions), a program for hierarchical reasoning in extensions of logical theories. H-PILoT reduces deduction problems in the theory extension to deduction problems in the base theory. Specialized provers and standard SMT solvers can be used for testing the satisfiability of the formulae obtained after the reduction. For a certain type of theory extension (namely for local theory extensions) this hierarchical reduction is sound and complete and -- if the formulae obtained this way belong to a fragment decidable in the base theory -- H-PILoT provides a decision procedure for testing satisfiability of ground formulae, and can also be used for model generation.
Network coding with modular lattices
Venue: arXiv cs.IT 2010
Year: 2010

In [1], Kötter and Kschischang presented a new model for error correcting codes in network coding. The alphabet in this model is the subspace lattice of a given vector space, a code is a subset of this lattice and the used metric on this alphabet is the map d: (U, V) \longmapsto dim(U + V) - dim(U \bigcap V). In this paper we generalize this model to arbitrary modular lattices, i.e. we consider codes, which are subsets of modular lattices. The used metric in this general case is the map d: (x, y) \longmapsto h(x \bigvee y) - h(x \bigwedge y), where h is the height function of the lattice. We apply this model to submodule lattices. Moreover, we show a method to compute the size of spheres in certain modular lattices and present a sphere packing bound, a sphere covering bound, and a singleton bound for codes, which are subsets of modular lattices. [1] R. Kötter, F.R. Kschischang: Coding for errors and erasures in random network coding, IEEE Trans. Inf. Theory, Vol. 54, No. 8, 2008
Towards Autopoietic Computing
Venue: arXiv cs.OH 2010
Year: 2010

A key challenge in modern computing is to develop systems that address complex, dynamic problems in a scalable and efficient way, because the increasing complexity of software makes designing and maintaining efficient and flexible systems increasingly difficult. Biological systems are thought to possess robust, scalable processing paradigms that can automatically manage complex, dynamic problem spaces, possessing several properties that may be useful in computer systems. The biological properties of self-organisation, self-replication, self-management, and scalability are addressed in an interesting way by autopoiesis, a descriptive theory of the cell founded on the concept of a system's circular organisation to define its boundary with its environment. In this paper, therefore, we review the main concepts of autopoiesis and then discuss how they could be related to fundamental concepts and theories of computation. The paper is conceptual in nature and the emphasis is on the review of other people's work in this area as part of a longer-term strategy to develop a formal theory of autopoietic computing.
A Novel Watermarking Scheme for Detecting and Recovering Distortions in Database Tables
Venue: arXiv cs.DB 2010
Year: 2010

In this paper a novel fragile watermarking scheme is proposed to detect, localize and recover malicious modifications in relational databases. In the proposed scheme, all tuples in the database are first securely divided into groups. Then watermarks are embedded and verified group-by-group independently. By using the embedded watermark, we are able to detect and localize the modification made to the database and even we recover the true data from the database modified locations. Our experimental results show that this scheme is so qualified; i.e. distortion detection and true data recovery both are performed successfully.
An Efficient Retransmission Based on Network Coding with Unicast Flows
Venue: arXiv cs.IT 2010
Year: 2010

Recently, network coding technique has emerged as a promising approach that supports reliable transmission over wireless loss channels. In existing protocols where users have no interest in considering the encoded packets they had in coding or decoding operations, this rule is expensive and inef-ficient. This paper studies the impact of encoded packets in the reliable unicast network coding via some theoretical analysis. Using our approach, receivers do not only store the encoded packets they overheard, but also report these information to their neighbors, such that users enable to take account of encoded packets in their coding decisions as well as decoding operations. Moreover, we propose a redistribution algorithm to maximize the coding opportunities, which achieves better retransmission efficiency. Finally, theoretical analysis and simulation results for a wheel network illustrate the improve-ment in retransmissions efficiency due to the encoded packets.
An Improved Objective Evaluation Measure for Border Detection in Dermoscopy Images
Venue: arXiv cs.CV 2010
Year: 2010

Background: Dermoscopy is one of the major imaging modalities used in the diagnosis of melanoma and other pigmented skin lesions. Due to the difficulty and subjectivity of human interpretation, dermoscopy image analysis has become an important research area. One of the most important steps in dermoscopy image analysis is the automated detection of lesion borders. Although numerous methods have been developed for the detection of lesion borders, very few studies were comprehensive in the evaluation of their results. Methods: In this paper, we evaluate five recent border detection methods on a set of 90 dermoscopy images using three sets of dermatologist-drawn borders as the ground-truth. In contrast to previous work, we utilize an objective measure, the Normalized Probabilistic Rand Index, which takes into account the variations in the ground-truth images. Conclusion: The results demonstrate that the differences between four of the evaluated border detection methods are in fact smaller than those predicted by the commonly used XOR measure.
Analyzing Web 2.0 Integration with Next Generation Networks for Services Rendering
Venue: arXiv cs.NI 2010
Year: 2010

The Next Generation Networks (NGN) aims to integrate for IP-based telecom infrastructures and provide most advance & high speed emerging value added services. NGN capable to provide higher innovative services, these services will able to integrate communication and Web service into a single platform. IP Multimedia Subsystem, a NGN leading technology, enables a variety of NGN-compliant communications services to interoperate while being accessed through different kinds of access networks, preferably broadband. IMS-NGN services essential by both consumer and corporate users are by now used to access services, even communications services through the web and web-based communities and social networks, It is key for success of IMS-based services to be provided with efficient web access, so users can benefit from those new services by using web-based applications and user interfaces, not only NGN-IMS User Equipments and SIP protocol. Many Service are under planning which provided only under convergence of IMS & Web 2.0. Convergence between Web 2.0 and NGN-IMS creates and serves new invented innovative, entertainment and information appealing as well as user centric services and applications. These services merge features from WWW and Communication worlds. On the one hand, interactivity, ubiquity, social orientation, user participation and content generation, etc. are relevant characteristics coming from Web 2.0 services. Parallel IMS enables services including multimedia telephony, media sharing (video-audio), instant messaging with presence and context, online directory, etc. all of them applicable to mobile, fixed or convergent telecom networks. With this paper, this paper brings out the benefits of adopting web 2.0 technologies for telecom services. As the services are today mainly driven by the user's needs, and proposed the concept of unique customizable service interface.
The Development of the Journal Environment of Leonardo
Venue: arXiv cs.DL 2010
Year: 2010

We present animations based on the aggregated journal-journal citations of Leonardo during the period 1974-2008. Leonardo is mainly cited by journals outside the arts domain for cultural reasons, for example, in neuropsychology and physics. Articles in Leonardo itself cite a large number of journals, but with a focus on the arts. Animations at this level of aggregation enable us to show the history of the journal from a network perspective.
An Application-oriented Model for Wireless Sensor Networks integrated with Telecom Infra
Venue: arXiv cs.NI 2010
Year: 2010

This paper aims to propose a significant way of remote access and real time monitoring of a particular geographic area by integrating wireless sensor clouds with existing Telecom infrastructure and applications built around them through a gateway. This utility is very potent for environment monitoring in harsh and inaccessible places like mines, nuclear reactors, etc. We demonstrate a scaled down version of multi-hop network of wireless sensor nodes and its integration with existing telecom network infrastructure via a gateway. The kind of results achieved like temperature monitoring etc. gives a glimpse of an enormous step ahead in mine safety.
DynaChanAl: Dynamic Channel Allocation with Minimal End-to-end Delay for Wireless Sensor Networks
Venue: arXiv cs.NI 2010
Year: 2010

With recent advances in wireless communication, networking, and low power sensor technology, wireless sensor network (WSN) systems have begun to take significant roles in various applications ranging from environmental sensing to mobile healthcare sensing. While some WSN applications only require a lim- ited amount of bandwidth, new emerging applications operate with a notice- ably large amount of data transfers. One way to deal with such applications is to maximize the available capacity by utilizing the use of multiple wireless channels. This work proposes DynaChannAl, a distributed dynamic wireless channel algorithm with the goal of effectively distributing nodes on multiple wireless channels in WSN systems. Specifically, DynaChannAl targets applica- tions where mobile nodes connect to a pre-existing wireless backbone and takes the expected end-to-end queuing delay as its core metric. We use the link qual- ity indicator (LQI) values provided by IEEE 802.15.4 radios white-list potential links with good link quality and evaluate such links with the aggregated packet transmission latency at each hop. Our approach is useful for applications that require minimal end-to-end delay (i.e., healthcare applications). DynaChannAl is a light weight and highly adoptable scheme that can be easily incorporated with various pre-developed components and pre-deployed applications. We eval- uate DynaChannAl in on a 45 node WSN testbed. As the first study to consider end-to-end latency as the core metric for channel allocation in WSN systems, the experimental results indicate that DynaChannAl successfully distributes multi- ple (mobile) source nodes on different wireless channels and enables the nodes to select wireless channel and links that can minimize the end-to-end latency.
One method of storing information
Venue: arXiv cs.DS 2010
Year: 2010

Formulate the problem as follows. Split a file into n pieces so that it can be restored without any m parts (1<=m<=n). Such problems are called problems secret sharing. There exists a set of methods for solving such problems, but they all require a fairly large number of calculations applied to the problem posed above. The proposed method does not require calculations, and requires only the operations of the division of the file into equal (nearly equal) parts and gluing them in a certain order in one or more files.
On Compression of Data Encrypted with Block Ciphers
Venue: arXiv cs.IT 2010
Year: 2010

This paper investigates compression of data encrypted with block ciphers, such as the Advanced Encryption Standard (AES). It is shown that such data can be feasibly compressed without knowledge of the secret key. Block ciphers operating in various chaining modes are considered and it is shown how compression can be achieved without compromising security of the encryption scheme. Further, it is shown that there exists a fundamental limitation to the practical compressibility of block ciphers when no chaining is used between blocks. Some performance results for practical code constructions used to compress binary sources are presented.
Complexity of Non-Monotonic Logics
Venue: arXiv cs.CC 2010
Year: 2010

Over the past few decades, non-monotonic reasoning has developed to be one of the most important topics in computational logic and artificial intelligence. Different ways to introduce non-monotonic aspects to classical logic have been considered, e.g., extension with default rules, extension with modal belief operators, or modification of the semantics. In this survey we consider a logical formalism from each of the above possibilities, namely Reiter's default logic, Moore's autoepistemic logic and McCarthy's circumscription. Additionally, we consider abduction, where one is not interested in inferences from a given knowledge base but in computing possible explanations for an observation with respect to a given knowledge base. Complexity results for different reasoning tasks for propositional variants of these logics have been studied already in the nineties. In recent years, however, a renewed interest in complexity issues can be observed. One current focal approach is to consider parameterized problems and identify reasonable parameters that allow for FPT algorithms. In another approach, the emphasis lies on identifying fragments, i.e., restriction of the logical language, that allow more efficient algorithms for the most important reasoning tasks. In this survey we focus on this second aspect. We describe complexity results for fragments of logical languages obtained by either restricting the allowed set of operators (e.g., forbidding negations one might consider only monotone formulae) or by considering only formulae in conjunctive normal form but with generalized clause types. The algorithmic problems we consider are suitable variants of satisfiability and implication in each of the logics, but also counting problems, where one is not only interested in the existence of certain objects (e.g., models of a formula) but asks for their number.
Home Automation
Venue: arXiv cs.OH 2010
Year: 2010

In this paper I briefly discuss the importance of home automation system. Going in to the details I briefly present a real time designed and implemented software and hardware oriented house automation research project, capable of automating house's electricity and providing a security system to detect the presence of unexpected behavior.
Maximizing the Total Resolution of Graphs
Venue: arXiv cs.DS 2010
Year: 2010

A major factor affecting the readability of a graph drawing is its resolution. In the graph drawing literature, the resolution of a drawing is either measured based on the angles formed by consecutive edges incident to a common node (angular resolution) or by the angles formed at edge crossings (crossing resolution). In this paper, we evaluate both by introducing the notion of "total resolution", that is, the minimum of the angular and crossing resolution. To the best of our knowledge, this is the first time where the problem of maximizing the total resolution of a drawing is studied. The main contribution of the paper consists of drawings of asymptotically optimal total resolution for complete graphs (circular drawings) and for complete bipartite graphs (2-layered drawings). In addition, we present and experimentally evaluate a force-directed based algorithm that constructs drawings of large total resolution.
On Isosceles Triangles and Related Problems in a Convex Polygon
Venue: arXiv cs.CG 2010
Year: 2010

Given any convex $n$-gon, in this article, we: (i) prove that its vertices can form at most $n^2/2 + Θ(n\log n)$ isosceles trianges with two sides of unit length and show that this bound is optimal in the first order, (ii) conjecture that its vertices can form at most $3n^2/4 + o(n^2)$ isosceles triangles and prove this conjecture for a special group of convex $n$-gons, (iii) prove that its vertices can form at most $\lfloor n/k \rfloor$ regular $k$-gons for any integer $k\ge 4$ and that this bound is optimal, and (iv) provide a short proof that the sum of all the distances between its vertices is at least $(n-1)/2$ and at most $\lfloor n/2 \rfloor \lceil n/2 \rceil(1/2)$ as long as the convex $n$-gon has unit perimeter.
A Protection Approach for Video Information transmitted in TCP/IP based networks
Venue: arXiv cs.CR 2010
Year: 2010

In this paper an analysis of the existing video information protection methods is made. Analysis of current H.323 protocol stack has been made. A new encryption/decryption layer has been suggested. An approach for partial data encryption in the H.323 protocol stack is proposed and sample architecture of a Virtual Private Video Network is given.
Various virtual structures on single file system
Venue: arXiv cs.IT 2010
Year: 2010

The article provides a new approach to creating hierarchical structure of file system. First, it gives overview of the existing ways of storing files in current operating systems. Second, it describes the new way of building structures of a file system. This approach allows creating various structures by different attributes on the same set of files using multiple tree-like structures.