Query: Argumentative Zoning for Improved Citation Indexing

Relevant passages:
Digital Libraries and Autonomous Citation Indexing <=SEP=> The Web is revolutionizing the way researchers access scientific literature, however scientific literature on the Web is largely disorganized. Autonomous citation indexing can help organize the literature by automating the construction of citation indices. Autonomous citation indexing aims to improve the dissemination and retrieval of scientific literature, and provides improvements in cost, availability, comprehensiveness, efficiency, and timeliness.

Thumbs up? Sentiment Classification using Machine Learning Techniques <=SEP=> We consider the problem of classifying documents not by topic, but by overall sentiment, e.g., determining whether a review is positive or negative. Using movie reviews as data, we find that standard machine learning techniques definitively outperform human-produced baselines. However, the three machine learning methods we employed (Naive Bayes, maximum entropy classification, and support vector machines) do not perform as well on sentiment classification as on traditional topic-based categorization. We conclude by examining factors that make the sentiment classification problem more challenging. Publication info: Proceedings of EMNLP 2002, pp. 79–86.

CiteSeer: An Automatic Citation Indexing System <=SEP=> We presentCiteSeer : an autonomous citation indexing system which indexes academic literature in electronic format (e.g. Postscript files on the Web). CiteSeer understands how to parse citations, identify citations to the same paper in d ifferent formats, and identify the context of citations in the body of articles. CiteSeer provides most of the advantages o f traditional (manually constructed) citation indexes (e.g . the ISI citation indexes), including: literature retrieval by following citation links (e.g. by providing a list of papers tha cite a given paper), the evaluation and ranking of papers, au thors, journals, etc. based on the number of citations, and t he identification of research trends. CiteSeer has many advantages over traditional citation indexes, including the abi lity to create more up-to-date databases which are not limited to a preselected set of journals or restricted by journal public ation delays, completely autonomous operation with a correspond ing reduction in cost, and powerful interactive browsing of the literature using the context of citations. Given a parti cular paper of interest, CiteSeer can display the context of ho w the paper is cited in subsequent publications. This context may contain a brief summary of the paper, another author’s response to the paper, or subsequent work which builds upon the original article. CiteSeer allows the location of paper s by keyword search or by citation links. Papers related to a give n paper can be located using common citation information or word vector similarity. CiteSeer will soon be available for public use.

A Statistical Approach to Anaphora Resolution <=SEP=> This paper presents an algorithm for identifying pronominal anaphora and two experiments based upon this algorithm. We incorporate multiple anaphora resolution factors into a statistical framework specifically the distance between the pronoun and the proposed antecedent, gender/number/animaticity of the proposed antecedent, governing head information and noun phrase repetition. We combine them into a single probability that enables us to identify the referent. Our first experiment shows the relative contribution of each source Of information and demonstrates a success rate of 82.9% for all sources combined. The second experiment investigates a method for unsupervised learning of gender/number/animaticity information. We present some experiments illustrating the accuracy of the method and note that with this information added, our pronoun resolution method achieves 84.2% accuracy. 1 I n t r o d u c t i o n We present a statistical method for determining pronoun anaphora. This program differs from earlier work in its almost complete lack of hand-crafting, relying instead on a very small corpus of Penn Wall Street Journal Tree-bank text (Marcus et al., 1993) that has been marked with co-reference information. The first sections of this paper describe this program: the probabilistic model behind it, its implementation, and its performance. The second half of the paper describes a method for using (portions of) t~e aforementioned program to learn automatically the typical gender of English words, information that is itself used in the pronoun resolution program. In particular, the scheme infers the gender of a referent from the gender of the pronouns that 161 refer to it and selects referents using the pronoun anaphora program. We present some typical results as well as the more rigorous results of a blind evaluation of its output. 2 A P r o b a b i l i s t i c M o d e l There are many factors, both syntactic and semantic, upon which a pronoun resolution system relies. (Mitkov (1997) does a detailed study on factors in anaphora resolution.) We first discuss the training features we use and then derive the probability equations from them. The first piece of useful information we consider is the distance between the pronoun and the candidate antecedent. Obviously the greater the distance the lower the probability. Secondly, we look at the syntactic situation in which the pronoun finds itself. The most well studied constraints are those involving reflexive pronouns. One classical approach to resolving pronouns in text that takes some syntactic factors into consideration is that of Hobbs (1976). This algorithm searches the parse tree in a leftto-right, breadth-first fashion that obeys the major reflexive pronoun constraints while giving a preference to antecedents that are closer to the pronoun. In resolving inter-sentential pronouns, the algorithm searches the previous sentence, again in left-to-right, breadth-first order. This implements the observed preference for subject position antecedents. Next, the actual words in a proposed nounphrase antecedent give us information regarding the gender, number, and animaticity of the proposed referent. For example: M a r i e Giraud carries historical significance as one of the last women to be ezecuted in France. S h e became an abortionist because it enabled her to buy jam, cocoa and other war-rationed goodies. Here it is helpful to recognize that "Marie" is probably female and thus is unlikely to be referred to by "he" or "it". Given the words in the proposed antecedent we want to find the probability that it is the referent of the pronoun in question. We collect these probabilities on the training data, which are marked with reference links. The words in the antecedent sometimes also let us test for number agreement. Generally, a singular pronoun cannot refer to a plural noun phrase, so that in resolving such a pronoun any plural candidates should be ruled out. However a singular noun phrase can be the referent of a plural pronoun, as illustrated by the following example: "I think if I tell Viacom I need more time, they will take 'Cosby' across the street," says the general manager ol a network a~liate. It is also useful to note the interaction between the head constituent of the pronoun p and the antecedent. For example: A Japanese company might make television picture tubes in Japan, assemble the T V sets in Malaysia and extort them to Indonesia. Here we would compare the degree to which each possible candidate antecedent (A Japanese company, television picture tubes, Japan, T V sets, and Malaysia in this example) could serve as the direct object of "export". These probabilities give us a way to implement selectional restriction. A canonical example of selectional restriction is that of the verb "eat", which selects food as its direct object. In the case of "export" the restriction is not as clearcut. Nevertheless it can still give us guidance on which candidates are more probable than others. The last factor we consider is referents' mention count. Noun phrases that are mentioned repeatedly are preferred. The training corpus is marked with the number of times a referent has been mentioned up to that point in the story. Here we are concerned with the probability that a proposed antecedent is correct given that it has been repeated a certain number of times. 162 In effect, we use this probability information to identify the topic of the segment with the belief that the topic is more likely to be referred to by a pronoun. The idea is similar to tha t used in the centering approach (Brennan et al., 1987) where a continued topic is the highest-ranked candidate for pronominalization. Given the above possible sources of informar tion, we arrive at the following equation, where F(p) denotes a function from pronouns to their antecedents: F(p) = argmaxP( A(p) = alp, h, l~', t, l, so, d~ A~') where A(p) is a random variable denoting the referent of the pronoun p and a is a proposed antecedent. In the conditioning events, h is the head constituent above p, l~ r is the list of candidate antecedents to be considered, t is the type of phrase of the proposed antecedent (always a noun-phrase in this s tudy), I is the type of the head constituent, sp describes the syntactic structure in which p appears, dspecifies the distance of each antecedent from p and M" is the number of times the referent is mentioned. Note that 17r ", d'~ and A~ are vector quantities in which each entry corresponds to a possible antecedent. When viewed in this way, a can be regarded as an index into these vectors that specifies which value is relevant to the particular choice of antecedent. This equation is decomposed into pieces that correspond to all the above factors but are more statistically manageable. The decomposition makes use of Bayes' theorem and is based on certain independence assumptions discussed below. P( A(p) = alp, h, fir, t, l, sp, d~ .Q') = P(alA~)P(p,h, fir, t,l, sp,~a, 2~) (1) P(p, h, fir, t, t, sp, diM ) o¢ PCalM)P(p, h, fir, t, l, sp, ~a, .Q') (2) = P(a[:Q)P(.%, ~a, :~'I) P(p,h, fir, t, l la ,~ ,sp , i) (3) = P(all~)P(sp, d~a,.Q ) PCh, t, Zla, ~'0", so, i) PC.. ~ la , .~', so, d, h, t, l) (4) oc P(a]l~)P(So,~a,M') P(p, 14tin, ]Q, s o, d, h, t, I) (5) = P(al.Q)P(sp, d~a, 3~r) P(ffrla, I~, s o, d, h, t, I). (6) P(pla. l~, sf,, d. h, t, l, l~) cx P(a163P(dtt la)P(f f ' lh , t, I, a) P(plw°) (7) Equation (1) is simply an application of Bayes' rule. The denominator is eliminated in the usual fashion, resulting in equation (2). Selectively applying the chain rule results in equations (3) and (4). In equation (4), the term P(h. t, lla, .~, So, d) is the same for every antecedent and is thus removed. Equat ion (6) follows when we break the last component of (5) into two probability distributions. In equation (7) we make the following independence assumptions: • Given a particular choice of the antecedent candidates, the distance is independent of distances of candidates other than the antecedent (and the distance to non-referents can be ignored): P(so, d~a, 2~) o¢ P(so, dola , IC4) • The syntnctic s t ructure st, and the distance from the pronoun da are independent of the number of times the referent is mentioned. Thus P(sp, dola, M) = P(sp, d.la) Then we combine sp and de into one variable dIt, Hobbs distance, since the Hobbs algorithm takes both the syntax and distance into account. The words in the antecedent depend only on the parent consti tuent h, the type of the words t, and the type of the parent I. Hence e(ff'la, M, sp, ~, h, t, l) = P ( ~ l h , t, l, a) • The choice pronoun depends only on the words in the antecedent, i.e. P{pla, M, sp, d, h, t, l, ~ = P(pla, W) 163 • If we treat a as an index into the vector 1~, then (a, I.V') is simply the a th candidate in the list ffz. We assume the selection of the pronoun is independent of the candidates other than the antecedent. Hence P(pla, W) = P(plw,~) Since I~" is a vector, we need to normalize P(ff ' lh, t,l, a) to obtain the probability of each element in the vector. It is reasonable to assume tha t the antecedents in W are independent of each other; in other words, P(wo+llwo, h , t , l ,a ) = P(wo+llh, t , l ,a}. Thus,

Building a Large Annotated Corpus of English: The Penn Treebank <=SEP=> In this paper, we review our experience with constructing one such large annotated corpus--the Penn Treebank, a corpus consisting of over 4.5 million words of American English. During the first three-year phase of the Penn Treebank Project (1989-1992), this corpus has been annotated for part-of-speech (POS) information. In addition, over half of it has been annotated for skeletal syntactic structure. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-93-87. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/237 Building A Large Annotated Corpus of English: The Penn Treebank MS-CIS-93-87 LINC LAB 260 Mitchell P. Marcus Beatrice Santorini Mary Ann Marcinkiewicz University of Pennsylvania School of Engineering and Applied Science Computer and Information Science Department Philadelphia, PA 19104-6389

Microphone Array Processing for Distant Speech Recognition: From Close-Talking Microphones to Far-Field Sensors <=SEP=> Distant speech recognition (DSR) holds the promise of the most natural human computer interface because it enables man-machine interactions through speech, without the necessity of donning intrusive body- or head-mounted microphones. Recognizing distant speech robustly, however, remains a challenge. This contribution provides a tutorial overview of DSR systems based on microphone arrays. In particular, we present recent work on acoustic beam forming for DSR, along with experimental results verifying the effectiveness of the various algorithms described here; beginning from a word error rate (WER) of 14.3% with a single microphone of a linear array, our state-of-the-art DSR system achieved a WER of 5.3%, which was comparable to that of 4.2% obtained with a lapel microphone. Moreover, we present an emerging technology in the area of far-field audio and speech processing based on spherical microphone arrays. Performance comparisons of spherical and linear arrays reveal that a spherical array with a diameter of 8.4 cm can provide recognition accuracy comparable or better than that obtained with a large linear array with an aperture length of 126 cm.

Self-assembly of neural networks viewed as swarm intelligence <=SEP=> While self-assembly is a fairly active area of research in swarm intelligence, relatively little attention has been paid to the issues surrounding the construction of network structures. In this paper we extend methods developed previously for controlling collective movements of agent teams to serve as the basis for self-assembly or “growth” of networks, using neural networks as a concrete application to evaluate our approach. Our central innovation is having network connections arise as persistent “trails” left behind moving agents, trails that are reminiscent of pheromone deposits made by agents in ant colony optimization models. The resulting network connections are thus essentially a record of agent movements. We demonstrate our model’s effectiveness by using it to produce two large networks that support subsequent learning of topographic and feature maps. Improvements produced by the incorporation of collective movements are also examined through computational experiments. These results indicate that methods for directing collective movements can be adopted to facilitate network self-assembly.

An Evaluation of Popular Copy-Move Forgery Detection Approaches <=SEP=> A copy-move forgery is created by copying and pasting content within the same image, and potentially postprocessing it. In recent years, the detection of copy-move forgeries has become one of the most actively researched topics in blind image forensics. A considerable number of different algorithms have been proposed focusing on different types of postprocessed copies. In this paper, we aim to answer which copy-move forgery detection algorithms and processing steps (e.g., matching, filtering, outlier detection, affine transformation estimation) perform best in various postprocessing scenarios. The focus of our analysis is to evaluate the performance of previously proposed feature sets. We achieve this by casting existing algorithms in a common pipeline. In this paper, we examined the 15 most prominent feature sets. We analyzed the detection performance on a per-image basis and on a per-pixel basis. We created a challenging real-world copy-move dataset, and a software framework for systematic image manipulation. Experiments show, that the keypoint-based features Sift and Surf, as well as the block-based DCT, DWT, KPCA, PCA, and Zernike features perform very well. These feature sets exhibit the best robustness against various noise sources and downsampling, while reliably identifying the copied regions.

Authentication Algorithm for Intrusion Detection in Wireless Networks <=SEP=> Security has been a major issue in wireless networks. In a wireless network, wireless devices are prone to be unauthorized accessing data or resources. Hence it becomes necessary to consider issues of security such as : 1. Authentication, 2. Access Control. Traditional methods of Authentication has been to assign user names and passwords. This is extremely vulnerable to be accessed and misused. Therefore, to overcome these problems, This paper proposes a method by which the Username and Password are stored in an Hashed format, with the help of Neural Network learning the hashes instead of storing them in the tables. Thus, reducing the risk of being accessed. Therefore, a combination of authentication and access control could make a good tool for intrusion detection.

Design equations for the Quasi Yagi-Uda antenna operating in the UHF band <=SEP=> Design equations for the standard Quasi Yagi-Uda antenna built on 60 mil FR4 are presented to be used on fixed wireless telecommunication systems, Wi-Fi, WiMAX and LTE. In this work, the design equations are systematically proposed for the band between 1 GHz and 3 GHz, where relative bandwidth is better than 39%, the cross-polarization is lower than - 15dB for every angle and frequency, the cross-polarization is lower than -25dB in the main lobe and a front to back ratio better than 12dB in all the bandwidth. Three antennas where designed, built and measured with the proposed equations at 1.5GHz, 2GHz and 3 GHz, showing good agreement with the simulation results.

The burden of allergic contact dermatitis caused by acrylates. <=SEP=> Acrylates and methacrylates are esters of acrylic acid and methacrylic acid, respectively, that polymerize either spontaneously or on ultraviolet (UV) light exposure to form products that are commonly used in adhesives in healthcare settings, and in plastics and textiles (1). They were commonly considered to be occupational contact allergens, particularly in dentists and orthopaedic surgeons, owing to the use of (meth)acrylates in dental materials and bone cement (2). However, more recently, the demand for long-lasting cosmetic nails has led to the widespread use of gel nails and acrylic nails. Gel nails are methacrylate-based gel varnishes that rely on UV curing to form a hard nail-coating colour that lasts for up to 2 weeks. This has led to an occupational shift in (metha)crylate allergy, with a rise in incidence among beauticians and nail technicians using these products (1, 3–5). In addition, with home use UV-curing kits now readily available, there is a further shift of contact allergy to consumers. Our aim was to characterize the cases of allergic contact dermatitis caused by meth(acrylates) and cyanoacrylates in our large regional patch testing centre. Because of its significant occupational and health-related sequelae, we highlight the current burden of the serious allergy to these compounds.

A cross-platform analysis of bugs and bug-fixing in open source projects: desktop vs. Android vs. iOS <=SEP=> As smartphones continue to increase in popularity, understanding how software processes associated with the smartphone platform differ from the traditional desktop platform is critical for improving user experience and facilitating software development and maintenance. In this paper we focus specifically on differences in bugs and bug-fixing processes between desktop and smartphone software. Our study covers 444,129 bug reports in 88 open source projects on desktop, Android, and iOS. The study has two main thrusts: a quantitative analysis to discover similarities and differences between desktop and smartphone bug reports/processes; and a qualitative analysis where we extract topics from bug reports to understand bugs' nature, categories, and differences between platforms. Our findings include: during 2011--2013, iOS bugs were fixed three times faster compared to Android and desktop; top smartphone bug fixers are more involved in reporting bugs than top desktop bug fixers; and most frequent high-severity bugs are due to build issues on desktop, concurrency on Android, and application logic on iOS. Our study, findings, and recommendations are potentially useful to smartphone researchers and practitioners.

Modelling the interaction of electromagnetic fields (10 MHz-10 GHz) with the human body: methods and applications. <=SEP=> Numerical modelling of the interaction between electromagnetic fields (EMFs) and the dielectrically inhomogeneous human body provides a unique way of assessing the resulting spatial distributions of internal electric fields, currents and rate of energy deposition. Knowledge of these parameters is of importance in understanding such interactions and is a prerequisite when assessing EMF exposure or when assessing or optimizing therapeutic or diagnostic medical applications that employ EMFs. In this review, computational methods that provide this information through full time-dependent solutions of Maxwell's equations are summarized briefly. This is followed by an overview of safety- and medical-related applications where modelling has contributed significantly to development and understanding of the techniques involved. In particular, applications in the areas of mobile communications, magnetic resonance imaging, hyperthermal therapy and microwave radiometry are highlighted. Finally, examples of modelling the potentially new medical applications of recent technologies such as ultra-wideband microwaves are discussed.

AAAI: An Argument Against Artificial Intelligence <=SEP=> The ethical concerns regarding the successful development of an Artificial Intelligence have received a lot of attention lately. The idea is that even if we have good reason to believe that it is very unlikely, the mere possibility of an AI causing extreme human suffering is important enough to warrant serious consideration. Others look at this problem from the opposite perspective, namely that of the AI itself. Here the idea is that even if we have good reason to believe that it is very unlikely, the mere possibility of humanity causing extreme suffering to an AI is important enough to warrant serious consideration. This paper starts from the observation that both concerns rely on problematic philosophical assumptions. Rather than tackling these assumptions directly, it proceeds to present an argument that if one takes these assumptions seriously, then one has a moral obligation to advocate for a ban on the development of a conscious AI.

Reward Systems in the Brain and Nutrition. <=SEP=> The taste cortex in the anterior insula provides separate and combined representations of the taste, temperature, and texture of food in the mouth independently of hunger and thus of reward value and pleasantness. One synapse on, in the orbitofrontal cortex, these sensory inputs are combined by associative learning with olfactory and visual inputs for some neurons, and these neurons encode food reward value in that they respond to food only when hunger is present and in that activations correlate linearly with subjective pleasantness. Cognitive factors, including word-level descriptions and selective attention to affective value, modulate the representation of the reward value of taste, olfactory, and flavor stimuli in the orbitofrontal cortex and a region to which it projects, the anterior cingulate cortex. These food reward representations are important in the control of appetite and food intake. Individual differences in reward representations may contribute to obesity, and there are age-related differences in these reward representations. Implications of how reward systems in the brain operate for understanding, preventing, and treating obesity are described.

Healthcare via cell phones: a systematic review. <=SEP=> Regular care and informational support are helpful in improving disease-related health outcomes. Communication technologies can help in providing such care and support. The purpose of this study was to evaluate the empirical evidence related to the role of cell phones and text messaging interventions in improving health outcomes and processes of care. Scientific literature was searched to identify controlled studies evaluating cell phone voice and text message interventions to provide care and disease management support. Searches identified 25 studies that evaluated cell phone voice and text messaging interventions, with 20 randomized controlled trials and 5 controlled studies. Nineteen studies assessed outcomes of care and six assessed processes of care. Selected studies included 38,060 participants with 10,374 adults and 27,686 children. They covered 12 clinical areas and took place in 13 countries. Frequency of message delivery ranged from 5 times per day for diabetes and smoking cessation support to once a week for advice on how to overcome barriers and maintain regular physical activity. Significant improvements were noted in compliance with medicine taking, asthma symptoms, HbA1C, stress levels, smoking quit rates, and self-efficacy. Process improvements were reported in lower failed appointments, quicker diagnosis and treatment, and improved teaching and training. Cost per text message was provided by two studies. The findings that enhancing standard care with reminders, disease monitoring and management, and education through cell phone voice and short message service can help improve health outcomes and care processes have implications for both patients and providers.

Combining Generational and Conservative Garbage Collection: Framework and Implementations <=SEP=> Two key ideas in garbage collection are generational collection and conservative pointer-finding. Generational collection and conservative pointer-finding are hard to use together, because generational collection is usually expressed in terms of copying objects, while conservative pointer-finding precludes copying. We present a new framework for defining garbage collectors. When applied to generational collection, it generalizes the notion of younger/older to a partial order. It can describe traditional generational and conservative techniques, and lends itself to combining different techniques in novel ways. We study in particular two new garbage collectors inspired by this framework. Both these collectors use conservative pointer-finding. The first one is based on a rewrite of an existing trace-and-sweep collector to use one level of generation. The second one has a single parameter, which controls how objects are partitioned into generations: the value of this parameter can be changed dynamically with no overhead. We have implemented both collectors and present measurements of their performance in practice.

"GrabCut": interactive foreground extraction using iterated graph cuts <=SEP=> The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in image editing. Classical image segmentation tools use either texture (colour) information, e.g. Magic Wand, or edge (contrast) information, e.g. Intelligent Scissors. Recently, an approach based on optimization by graph-cut has been developed which successfully combines both types of information. In this paper we extend the graph-cut approach in three respects. First, we have developed a more powerful, iterative version of the optimisation. Secondly, the power of the iterative algorithm is used to simplify substantially the user interaction needed for a given quality of result. Thirdly, a robust algorithm for "border matting" has been developed to estimate simultaneously the alpha-matte around an object boundary and the colours of foreground pixels. We show that for moderately difficult examples the proposed method outperforms competitive tools.

Aggregate Profile Clustering for Streaming Analytics <=SEP=> Many analytic applications require analyzing user interaction data. In particular, such data can be aggregated over a window to build user activity profiles. Clustering such aggregate profiles is useful for grouping together users with similar behaviors, so that common models could be built for them. In this paper, we present an approach for clustering profiles that are incrementally maintained over a stream of updates. Owing to the potentially large number of users and high rate of interactions, maintaining profile clusters can have high processing and memory resource requirements. To tackle this problem, we apply distributed stream processing. However, in the presence of distributed state, it is a major challenge to partition the profiles over nodes such that memory and computation balance is maintained, while keeping the clustering accuracy high. Furthermore, in order to adapt to potentially changing user interaction patterns, the partitioning of profiles to nodes should be continuously revised, yet one should minimize the migration of profiles so as not to disturb the online processing of updates. We develop a re-partitioning technique that achieves all these goals. To achieve this, we keep micro-cluster summaries at each node and periodically collect these summaries at a central node to perform re-partitioning. We use a greedy algorithm with novel affinity heuristics to revise the partitioning and update the routing tables without introducing a lengthy pause. We showcase the effectiveness of our approach using an application that clusters customers of a telecommunications company based on their aggregate calling profiles.

A compact field weakening controller implementation <=SEP=> This paper proposes a compact field weakening controller (FWC). The FWC was developed during the development of an electrically driven rear axle for a hybrid electric car. The overall control system of the vehicle, the hybrid controller (HC), delivers a reference torque for the rear drive unit (RDU). Depending on the torque reference, instantaneous vehicle speed and battery voltage the task of the FWC is to produce current references for the current controller. The references are chosen to give an optimal current, optimal in the sense that the torque-per-current ratio is maximized, under the restriction of keeping the stator voltage and current limited. The FWC is based on comprehensive measurements of the machine. An algorithm is used to process the data from the measurements. The output from the algorithm is look-up tables. Implementation of the look-up tables is also discussed in the paper

Enhancing the RGR Routing Protocol for Unmanned Aeronautical Ad-hoc Networks <=SEP=> The design of a routing protocol for Unmanned Aeronautical Ad-hoc Networks (UAANETs) is quite challenging, especially due to the high mobility of Unmanned Aerial Vehicles (UAVs) and the low network density. Among all routing protocols that have been designed for UAANETs, the Reactive-Greedy-Reactive (RGR) protocol has been proposed as a promising routing protocol in high mobility and density-variable scenarios. While prior results have shown that RGR is competitive to AODV or other purely reactive routing protocols, it is not fully exploiting all the unique features of UAANETs and the knowledge maintained by intermediate nodes. This report presents a number of different enhancements, namely scoped flooding, delayed route request, and mobility prediction, in order to improve the performance of RGR in terms of overhead, packet delivery ratio and delay respectively. These modifications were implemented in Opnet, and simulation results show that we can reduce the protocol overhead by about 30%, while at the same time increasing PDR by about 3-5% and reducing packet latency. The results further show that there is still significant scope for further performance improvements.

Sensitivity enhancement of MEMS fluid flow rate and flow direction sensor <=SEP=> MEMS based flow rate sensor and flow direction sensor is a crucial to the determination of exact fluid flow path. Conventional rectangular cantilever beam detects based on the surface strain of the beam with respect to the mass flow. Different structured beam will greatly affect the sensitivity. In this paper different geometries of cantilever beam such as rectangular, inverted trapezoidal, triangular are designed and simulated using the finite element software INTELLISUITE 8.7. The simulation results show that the inverted trapezoidal geometries having the more deflection at same stress of the conventional beam and thus increase the sensitivity by approx. 1.45 times.

A study on the software requirements elicitation issues - its causes and effects <=SEP=> Software requirements elicitation is an important and essential pre-requisite to the subsequent phases in software development lifecycle. There is an increasing focus on how industry performs elicitation as this has a direct influence on the overall project success. It is important to understand broader elicitation issues and challenges, and address them on a large-scale, especially on geographically distributed software development. There are studies focusing on elicitation, but they are relatively small. There is no substantial research related to providing a comprehensive view of elicitation issues along with its causes and effects. This paper attempts to provide a summary of the systematic literature review (SLR) findings from 81 papers. The findings are based on causes of poor elicitation, elicitation issues and challenges, consequences of poor elicitation, advisable practices and classification of elicitation issues. The authors have leveraged cause-and-effect diagrams to draw conclusions on SLR.

Scalable Semantics-Based Detection of Similar Android Applications <=SEP=> The popularity and utility of smartphones rely on their vibrant application markets; however, plagiarism threatens the long-term health of these markets. In this paper, we present a scalable approach to detecting similar Android apps based on semantic information. We implement our approach in a tool called AnDarwin and evaluate it on 265,359 apps collected from 17 markets including Google Play and numerous third-party markets. In contrast with earlier approaches, AnDarwin does not compare apps pairwise, thus greatly increasing its scalability. Additionally, AnDarwin does not rely on information other than the app code — such as the app’s market, signature, or description — thus greatly increasing its reliability. AnDarwin can automatically detect library code and remove it from the similarity analysis. We present two use cases for AnDarwin: finding similar apps by different developers (“clones”) and similar apps from the same developer (“rebranded”). In ten hours, AnDarwin detected at least 4,295 apps which have been the victims of cloning and 36,106 apps that are rebranded. By analyzing the clusters found by AnDarwin, we found 88 new variants of malware and identified 169 malicious apps based on differences in the requested permissions. In contrast to earlier approaches, AnDarwin can detect both full and partial app similarity. Additionally, AnDarwin can automatically detect similar code that is injected into many apps, which may indicate the spread of malware. Our evaluation demonstrates AnDarwin’s ability to accurately detect similar apps on a large scale.

The one-time pad revisited <=SEP=> The one-time pad, the mother of all encryption schemes, is well known to be information-theoretically secure, in contrast to most encryption schemes used in practice, which are at most computationally secure. In this paper, we focus on another, completely different aspect in which the one-time pad is superior to normal encryption, and which surfaces only when the receiver (not only the eavesdropper) is considered potentially dishonest, as can be the case in a larger protocol context in which encryption is used as a sub-protocol. For example, such a dishonest receiver (who is, say, coerced by the eavesdropper) can in normal encryption verifiably leak the message to the eavesdropper by revealing the secret key. While this leakage feature can provably not be avoided completely, it is more limited if the one-time pad is used. We use the constructive cryptography framework to make these statements precise.

Help your mobile applications with fog computing <=SEP=> Cloud computing has paved a way for resource-constrained mobile devices to speed up their computing tasks and to expand their storage capacity. However, cloud computing is not necessary a panacea for all mobile applications. The high network latency to cloud data centers may not be ideal for delay-sensitive applications while storing everything on public clouds risks users' security and privacy. In this paper, we discuss two preliminary ideas, one for mobile application offloading and the other for mobile storage expansion, by leveraging the edge intelligence offered by fog computing to help mobile applications. Preliminary experiments conducted based on implemented prototypes show that fog computing can provide an effective and sometimes better alternative to help mobile applications.

Bayesian Biosurveillance of Disease Outbreaks <=SEP=> Early, reliable detection of disease outbreaks is a critical problem today. This paper reports an investigation of the use of causal Bayesian networks to model spatio-temporal patterns of a non-contagious disease (respiratory anthrax infection) in a population of people. The number of parameters in such a network can become enormous, if not carefully managed. Also, inference needs to be performed in real time as population data stream in. We describe techniques we have applied to address both the modeling and inference challenges. A key contribution of this paper is the explication of assumptions and techniques that are sufficient to allow the scaling of Bayesian network modeling and inference to millions of nodes for real-time surveillance applications. The results reported here provide a proof-of-concept that Bayesian networks can serve as the foundation of a system that effectively performs Bayesian biosurveillance of disease outbreaks.

Improving Social Inclusion Using NLP : Tools and Resources <=SEP=> This paper discusses the issue of accessibility to being online and using social media for people with a learning disability, and the challenges to using a co-production approach in an accessible technology project. While an increasing number of daily living tasks are now completed online, people with a learning disability frequently experience digital exclusion due to limited literacy and IT skills. The Able to Include project sought to engage people with a learning disability as active partners to test and feedback on the use and development of a pictogram app used to make social media more accessible. The challenges mainly related to the feedback needing to be sent electronically to the partners; there was only minimal contact with them and no face to face contact. The paper also outlines how other challenges were overcome to enable genuine and meaningful co-production. These included addressing online safety and ethical issues regarding anonymity.

Mode Regularized Generative Adversarial <=SEP=> Although Generative Adversarial Networks achieve state-of-the-art results on a variety of generative tasks, they are regarded as highly unstable and prone to miss modes. We argue that these bad behaviors of GANs are due to the very particular functional shape of the trained discriminators in high dimensional spaces, which can easily make training stuck or push probability mass in the wrong direction, towards that of higher concentration than that of the data generating distribution. We introduce several ways of regularizing the objective, which can dramatically stabilize the training of GAN models. We also show that our regularizers can help the fair distribution of probability mass across the modes of the data generating distribution, during the early phases of training and thus providing a unified solution to the missing modes problem.

Abnormal brain chemistry in chronic back pain: an in vivo proton magnetic resonance spectroscopy study <=SEP=> The neurobiology of chronic pain, including chronic back pain, is unknown. Structural imaging studies of the spine cannot explain all cases of chronic back pain. Functional brain imaging studies indicate that the brain activation patterns are different between chronic pain patients and normal subjects, and the thalamus, and prefrontal and cingulate cortices are involved in some types of chronic pain. Animal models of chronic pain suggest abnormal spinal cord chemistry. Does chronic pain cause brain chemistry changes? We examined brain chemistry changes in patients with chronic back pain using in vivo single- voxel proton magnetic resonance spectroscopy ((1)H-MRS). In vivo (1)H-MRS was used to measure relative concentrations of N-acetyl aspartate, creatine, choline, glutamate, glutamine, gamma-aminobutyric acid, inositol, glucose and lactate in relation to the concentration of creatine. These measurements were performed in six brain regions of nine chronic low back pain patients and 11 normal volunteers. All chronic back pain subjects underwent clinical evaluation and perceptual measures of pain and anxiety. We show that chronic back pain alters the human brain chemistry. Reductions of N-acetyl aspartate and glucose were demonstrated in the dorsolateral prefrontal cortex. Cingulate, sensorimotor, and other brain regions showed no chemical concentration differences. In chronic back pain, the interrelationship between chemicals within and across brain regions was abnormal, and there was a specific relationship between regional chemicals and perceptual measures of pain and anxiety. These findings provide direct evidence of abnormal brain chemistry in chronic back pain, which may be useful in diagnosis and future development of more effective pharmacological treatments.