OpenRaiser/Intern-Atlas huggingface dataset:
Inventions on Soft Keyboards -- A TRIZ Based Analysis
Venue: arXiv cs.HC 2013
Year: 2013

The soft keyboards are onscreen representation of physical keyboard having alphanumeric characters and other controls. The user operates the soft keyboard with the mouse, a stylus or other pointing device. The soft keys dont have any mechanical component. The soft keyboards are used in many public places for informational purpose, educational systems and financial transactional systems. A soft keyboard is convenient in some cases where a hard keyboard is difficult to manage. The soft keyboard is a substitute of a physical keyboard and is displayed on the screen. It displays the same type of alphanumeric and control keys like the keys on the actual keyboard. There are many inventions on a soft keyboard which makes the soft keyboard more efficient and effective. This article illustrates some inventions on soft keyboards from US patent database.
Inventions on Keyboard Illumination - A TRIZ Based Analysis
Venue: arXiv cs.HC 2013
Year: 2013

The conventional computers are not usable in dark, as the user cannot see the keyboard to operate properly. But there are many situations where the user may like to work on his computer under low light conditions, such as, during nights, while traveling in flights/ trains having low lights, working in the garden during evening etc. So it is necessary to provide some light to the laptop to operate the keyboard under low light situations. Luminescence of the keyboard is a desirable feature for portable computers. There may be several methods to illuminate the keyboard, the most crude may be carrying an external light and fixing at a point where it can light the keyboard. But solutions like this are not very convenient. The inventors have been looking for better solutions. This article analyses 6 patents on keyboard illumination. A good illumination system do not consume more battery, do not increase the size and weight of the laptop, do not increase heat inside the laptop box, and do not cost much to manufacture. The light should uniformly illuminate the whole keyboard and should not throw light on other areas that are not required.
Storing non-uniformly distributed messages in networks of neural cliques
Venue: arXiv cs.NE 2013
Year: 2013

Associative memories are data structures that allow retrieval of stored messages from part of their content. They thus behave similarly to human brain that is capable for instance of retrieving the end of a song given its beginning. Among different families of associative memories, sparse ones are known to provide the best efficiency (ratio of the number of bits stored to that of bits used). Nevertheless, it is well known that non-uniformity of the stored messages can lead to dramatic decrease in performance. We introduce several strategies to allow efficient storage of non-uniform messages in recently introduced sparse associative memories. We analyse and discuss the methods introduced. We also present a practical application example.
Parallelizing Windowed Stream Joins in a Shared-Nothing Cluster
Venue: arXiv cs.DC 2013
Year: 2013

The availability of large number of processing nodes in a parallel and distributed computing environment enables sophisticated real time processing over high speed data streams, as required by many emerging applications. Sliding window stream joins are among the most important operators in a stream processing system. In this paper, we consider the issue of parallelizing a sliding window stream join operator over a shared nothing cluster. We propose a framework, based on fixed or predefined communication pattern, to distribute the join processing loads over the shared-nothing cluster. We consider various overheads while scaling over a large number of nodes, and propose solution methodologies to cope with the issues. We implement the algorithm over a cluster using a message passing system, and present the experimental results showing the effectiveness of the join processing algorithm.
A Theory of Partitioned Global Address Spaces
Venue: arXiv cs.LO 2013
Year: 2013

Partitioned global address space (PGAS) is a parallel programming model for the development of applications on clusters. It provides a global address space partitioned among the cluster nodes, and is supported in programming languages like C, C++, and Fortran by means of APIs. In this paper we provide a formal model for the semantics of single instruction, multiple data programs using PGAS APIs. Our model reflects the main features of popular real-world APIs such as SHMEM, ARMCI, GASNet, GPI, and GASPI. A key feature of PGAS is the support for one-sided communication: a node may directly read and write the memory located at a remote node, without explicit synchronization with the processes running on the remote side. One-sided communication increases performance by decoupling process synchronization from data transfer, but requires the programmer to reason about appropriate synchronizations between reads and writes. As a second contribution, we propose and investigate robustness, a criterion for correct synchronization of PGAS programs. Robustness corresponds to acyclicity of a suitable happens-before relation defined on PGAS computations. The requirement is finer than the classical data race freedom and rules out most false error reports. Our main result is an algorithm for checking robustness of PGAS programs. The algorithm makes use of two insights. Using combinatorial arguments we first show that, if a PGAS program is not robust, then there are computations in a certain normal form that violate happens-before acyclicity. Intuitively, normal-form computations delay remote accesses in an ordered way. We then devise an algorithm that checks for cyclic normal-form computations. Essentially, the algorithm is an emptiness check for a novel automaton model that accepts normal-form computations in streaming fashion. Altogether, we prove the robustness problem is PSpace-complete.
Minimum d-dimensional arrangement with fixed points
Venue: arXiv cs.DS 2013
Year: 2013

In the Minimum $d$-Dimensional Arrangement Problem (d-dimAP) we are given a graph with edge weights, and the goal is to find a 1-1 map of the vertices into $\mathbb{Z}^d$ (for some fixed dimension $d\geq 1$) minimizing the total weighted stretch of the edges. This problem arises in VLSI placement and chip design. Motivated by these applications, we consider a generalization of d-dimAP, where the positions of some of the vertices (pins) is fixed and specified as part of the input. We are asked to extend this partial map to a map of all the vertices, again minimizing the weighted stretch of edges. This generalization, which we refer to as d-dimAP+, arises naturally in these application domains (since it can capture blocked-off parts of the board, or the requirement of power-carrying pins to be in certain locations, etc.). Perhaps surprisingly, very little is known about this problem from an approximation viewpoint. For dimension $d=2$, we obtain an $O(k^{1/2} \cdot \log n)$-approximation algorithm, based on a strengthening of the spreading-metric LP for 2-dimAP. The integrality gap for this LP is shown to be $Ω(k^{1/4})$. We also show that it is NP-hard to approximate 2-dimAP+ within a factor better than $Ω(k^{1/4-\eps})$. We also consider a (conceptually harder, but practically even more interesting) variant of 2-dimAP+, where the target space is the grid $\mathbb{Z}_{\sqrt{n}} \times \mathbb{Z}_{\sqrt{n}}$, instead of the entire integer lattice $\mathbb{Z}^2$. For this problem, we obtain a $O(k \cdot \log^2{n})$-approximation using the same LP relaxation. We complement this upper bound by showing an integrality gap of $Ω(k^{1/2})$, and an $Ω(k^{1/2-\eps})$-inapproximability result. Our results naturally extend to the case of arbitrary fixed target dimension $d\geq 1$.
Towards Securing APIs in Cloud Computing
Venue: arXiv cs.DC 2013
Year: 2013

Every organisation today wants to adopt cloud computing paradigm and leverage its various advantages. Today everyone is aware of its characteristics which have made it so popular and how it can help the organisations focus on their core activities leaving all IT services development and maintenance to the cloud service providers. Application Programming Interfaces (APIs) act as the interface between the CSPs and the consumers. This paper proposes an improved access control mechanism for securing the Cloud APIs.
A Reputation Based Framework to Avoid Free-riding in Unstructured Peer-to-Peer network
Venue: arXiv cs.NI 2013
Year: 2013

Free riding is a major problem in peer-to-peer networks. Reputation management systems are generally proposed to overcome this problem. In this paper we have discussed a possible way of resource allocation on the basis of reputation management system i.e. probabilistic allocation based on reputation. This seems to be a better way for allocation of resources because in this case nodes that do not have very good reputation about each other, may also serve each other at least some amount of resource with finite probability. This avoids disconnect between them. Algorithms are presented for optimizing the shared capacity, reputation based probabilistic allocation that is optimal for a node, and formation of interest groups on the basis of similarity between interests of nodes.
Architecture of Network and Client-Server model
Venue: arXiv cs.NI 2013
Year: 2013

With the development of Internet technology, the Web is becoming more and more important in our lives so that it has even become an essential element. The application of the Web has never been limited to computers; it has been opened to all kinds of intelligent digital devices like mobile ones. In this paper, we discuss the main and substantial difference between UDP and TCP, and how to implement Client-Server model. We also discuss the efficiency of multi-thread server and its relationship with internet.
Secret Key Cryptosystem based on Polar Codes over Binary Erasure Channel
Venue: arXiv cs.CR 2013
Year: 2013

This paper proposes an efficient secret key cryptosystem based on polar codes over Binary Erasure Channel. We introduce a method, for the first time to our knowledge, to hide the generator matrix of the polar codes from an attacker. In fact, our main goal is to achieve secure and reliable communication using finite-length polar codes. The proposed cryptosystem has a significant security advantage against chosen plaintext attacks in comparison with the Rao-Nam cryptosystem. Also, the key length is decreased after applying a new compression algorithm. Moreover, this scheme benefits from high code rate and proper error performance for reliable communication.
A Novel Architecture For Question Classification Based Indexing Scheme For Efficient Question Answering
Venue: arXiv cs.IR 2013
Year: 2013

Question answering system can be seen as the next step in information retrieval, allowing users to pose question in natural language and receive compact answers. For the Question answering system to be successful, research has shown that the correct classification of question with respect to the expected answer type is requisite. We propose a novel architecture for question classification and searching in the index, maintained on the basis of expected answer types, for efficient question answering. The system uses the criteria for Answer Relevance Score for finding the relevance of each answer returned by the system. On analysis of the proposed system, it has been found that the system has shown promising results than the existing systems based on question classification.
Research evaluation per discipline: a peer-review method and its outcomes
Venue: arXiv cs.DL 2013
Year: 2013

This paper describes the method for ex-post peer review evaluation per research discipline used at the Vrije Universiteit Brussel (VUB) and summarizes the outcomes obtained from it. The method produces pertinent advice and triggers responses - at the level of the individual researcher, the research team and the university's research management - for the benefit of research quality, competitivity and visibility. Imposed reflection and contacts during and after the evaluation procedure modify the individual researcher's attitude, improve the research teams' strategies and allow for the extraction of general recommendations that are used as discipline-dependent guidelines in the university's research management. The deep insights gained in the different research disciplines and the substantial data sets on their research, support the university management in its policy decisions and in building policy instruments. Moreover, the results are used as a basis for comparison with other assessments, leading to a better understanding of the possibilities and limitations of different evaluation processes. The peer review method can be applied systematically in a pluri-annual cycle of research discipline evaluations to build up a complete overview, or it can be activated on an ad hoc basis for a particular discipline, based on demands from research teams or on strategic or policy arguments.
Impact vitality: an indicator based on citing publications in search of excellent scientists
Venue: arXiv cs.DL 2013
Year: 2013

This paper contributes to the quest for an operational definition of 'research excellence' and proposes a translation of the excellence concept into a bibliometric indicator. Starting from a textual analysis of funding program calls aimed at individual researchers and from the challenges for an indicator at this level in particular, a new type of indicator is proposed. The Impact Vitality indicator [RONS & AMEZ, 2008] reflects the vitality of the impact of a researcher's publication output, based on the change in volume over time of the citing publications. The introduced metric is shown to posses attractive operational characteristics and meets a number of criteria which are desirable when comparing individual researchers. The validity of one of the possible indicator variants is tested using a small dataset of applicants for a senior full time Research Fellowship. Options for further research involve testing various indicator variants on larger samples linked to different kinds of evaluations.
Distance Aware Relaying Energy-efficient: DARE to Monitor Patients in Multi-hop Body Area Sensor Networks
Venue: arXiv cs.NI 2013
Year: 2013

In recent years, interests in the applications of Wireless Body Area Sensor Network (WBASN) is noticeably developed. WBASN is playing a significant role to get the real time and precise data with reduced level of energy consumption. It comprises of tiny, lightweight and energy restricted sensors, placed in/on the human body, to monitor any ambiguity in body organs and measure various biomedical parameters. In this study, a protocol named Distance Aware Relaying Energy-efficient (DARE) to monitor patients in multi-hop Body Area Sensor Networks (BASNs) is proposed. The protocol operates by investigating the ward of a hospital comprising of eight patients, under different topologies by positioning the sink at different locations or making it static or mobile. Seven sensors are attached to each patient, measuring different parameters of Electrocardiogram (ECG), pulse rate, heart rate, temperature level, glucose level, toxins level and motion. To reduce the energy consumption, these sensors communicate with the sink via an on-body relay, affixed on the chest of each patient. The body relay possesses higher energy resources as compared to the body sensors as, they perform aggregation and relaying of data to the sink node. A comparison is also conducted conducted with another protocol of BAN named, Mobility-supporting Adaptive Threshold-based Thermal-aware Energy-efficient Multi-hop ProTocol (M-ATTEMPT). The simulation results show that, the proposed protocol achieves increased network lifetime and efficiently reduces the energy consumption, in relative to M-ATTEMPT protocol.
Man and Machine: Questions of Risk, Trust and Accountability in Today's AI Technology
Venue: arXiv cs.CY 2013
Year: 2013

Artificial Intelligence began as a field probing some of the most fundamental questions of science - the nature of intelligence and the design of intelligent artifacts. But it has grown into a discipline that is deeply entwined with commerce and society. Today's AI technology, such as expert systems and intelligent assistants, pose some difficult questions of risk, trust and accountability. In this paper, we present these concerns, examining them in the context of historical developments that have shaped the nature and direction of AI research. We also suggest the exploration and further development of two paradigms, human intelligence-machine cooperation, and a sociological view of intelligence, which might help address some of these concerns.
MixedGrad: An O(1/T) Convergence Rate Algorithm for Stochastic Smooth Optimization
Venue: arXiv cs.LG 2013
Year: 2013

It is well known that the optimal convergence rate for stochastic optimization of smooth functions is $O(1/\sqrt{T})$, which is same as stochastic optimization of Lipschitz continuous convex functions. This is in contrast to optimizing smooth functions using full gradients, which yields a convergence rate of $O(1/T^2)$. In this work, we consider a new setup for optimizing smooth functions, termed as {\bf Mixed Optimization}, which allows to access both a stochastic oracle and a full gradient oracle. Our goal is to significantly improve the convergence rate of stochastic optimization of smooth functions by having an additional small number of accesses to the full gradient oracle. We show that, with an $O(\ln T)$ calls to the full gradient oracle and an $O(T)$ calls to the stochastic oracle, the proposed mixed optimization algorithm is able to achieve an optimization error of $O(1/T)$.
Physical Layer Security in Downlink Multi-Antenna Cellular Networks
Venue: arXiv cs.IT 2013
Year: 2013

In this paper, we study physical layer security for the downlink of cellular networks, where the confidential messages transmitted to each mobile user can be eavesdropped by both (i) the other users in the same cell and (ii) the users in the other cells. The locations of base stations and mobile users are modeled as two independent two-dimensional Poisson point processes. Using the proposed model, we analyze the secrecy rates achievable by regularized channel inversion (RCI) precoding by performing a large-system analysis that combines tools from stochastic geometry and random matrix theory. We obtain approximations for the probability of secrecy outage and the mean secrecy rate, and characterize regimes where RCI precoding achieves a nonzero secrecy rate. We find that unlike isolated cells, the secrecy rate in a cellular network does not grow monotonically with the transmit power, and the network tends to be in secrecy outage if the transmit power grows unbounded. Furthermore, we show that there is an optimal value for the base station deployment density that maximizes the secrecy rate, and this value is a decreasing function of the signal-to-noise ratio.
Universal Polar Codes
Venue: arXiv cs.IT 2013
Year: 2013

Polar codes, invented by Arikan in 2009, are known to achieve the capacity of any binary-input memoryless output-symmetric channel. One of the few drawbacks of the original polar code construction is that it is not universal. This means that the code has to be tailored to the channel if we want to transmit close to capacity. We present two "polar-like" schemes which are capable of achieving the compound capacity of the whole class of binary-input memoryless output-symmetric channels with low complexity. Roughly speaking, for the first scheme we stack up $N$ polar blocks of length $N$ on top of each other but shift them with respect to each other so that they form a "staircase." Coding then across the columns of this staircase with a standard Reed-Solomon code, we can achieve the compound capacity using a standard successive decoder to process the rows (the polar codes) and in addition a standard Reed-Solomon erasure decoder to process the columns. Compared to standard polar codes this scheme has essentially the same complexity per bit but a block length which is larger by a factor $O(N \log_2(N)/ε)$, where $ε$ is the gap to capacity. For the second scheme we first show how to construct a true polar code which achieves the compound capacity for a finite number of channels. We achieve this by introducing special "polarization" steps which "align" the good indices for the various channels. We then show how to exploit the compactness of the space of binary-input memoryless output-symmetric channels to reduce the compound capacity problem for this class to a compound capacity problem for a finite set of channels. This scheme is similar in spirit to standard polar codes, but the price for universality is a considerably larger blocklength. We close with what we consider to be some interesting open problems.
Non-Invasive Induction Link Model for Implantable Biomedical Microsystems: Pacemaker to Monitor Arrhythmic Patients in Body Area Networks
Venue: arXiv cs.NI 2013
Year: 2013

In this paper, a non-invasive inductive link model for an Implantable Biomedical Microsystems (IBMs) such as, a pacemaker to monitor Arrhythmic Patients (APs) in Body Area Networks (BANs) is proposed. The model acts as a driving source to keep the batteries charged, inside a device called, pacemaker. The device monitors any drift from natural human heart beats, a condition of arrythmia and also in turn, produces electrical pulses that create forced rhythms that, matches with the original normal heart rhythms. It constantly sends a medical report to the health center to keep the medical personnel aware of the patient's conditions and let them handle any critical condition, before it actually happens. Two equivalent models are compared by carrying the simulations, based on the parameters of voltage gain and link efficiency. Results depict that the series tuned primary and parallel tuned secondary circuit achieves the best results for both the parameters, keeping in view the constraint of coupling co-efficient (k), which should be less than a value \emph{0.45} as, desirable for the safety of body tissues.
A Bit of Secrecy for Gaussian Source Compression
Venue: arXiv cs.CR 2013
Year: 2013

In this paper, the compression of an independent and identically distributed Gaussian source sequence is studied in an unsecure network. Within a game theoretic setting for a three-party noiseless communication network (sender Alice, legitimate receiver Bob, and eavesdropper Eve), the problem of how to efficiently compress a Gaussian source with limited secret key in order to guarantee that Bob can reconstruct with high fidelity while preventing Eve from estimating an accurate reconstruction is investigated. It is assumed that Alice and Bob share a secret key with limited rate. Three scenarios are studied, in which the eavesdropper ranges from weak to strong in terms of the causal side information she has. It is shown that one bit of secret key per source symbol is enough to achieve perfect secrecy performance in the Gaussian squared error setting, and the information theoretic region is not optimized by joint Gaussian random variables.