abstract
stringlengths 8
9.19k
| authors
stringlengths 9
1.96k
| title
stringlengths 8
367
| __index_level_0__
int64 13
1,000k
|
|---|---|---|---|
The article presents an efficient parallel logic-circuit simulation scheme based on the Time Warp optimistic algorithm. The Time Warp algorithm is integrated with a new global virtual time (GVT) computation scheme for fossil collection. The new GVT computation is based on a token ring passing method, so that global synchronization is not required in a shared-memory multiprocessor system. This allows us to process large logic simulation problems, where the GVT computation is executed frequently for fossil collection due to limited memory space. We also present how to reduce the frequency of the GVT computation and the rollback radio by scheduling the process with the smallest timestamp first. We implement the parallel logic-circuit simulator using the Time Warp on BBN Butterfly machines, and the experimental results show that the algorithm provides a significant speedup in processing time, even for very large circuits. > | ['Hong K. Kim', 'Soon Myoung Chung'] | Parallel logic simulation using Time Warp on shared-memory multiprocessors | 314,116 |
On the Use of the Rhythmogram for Automatic Syllabic Prominence Detection. | ['Bogdan Ludusan', 'Antonio Origlia', 'Francesco Cutugno'] | On the Use of the Rhythmogram for Automatic Syllabic Prominence Detection. | 806,202 |
A Program System for Root Finding | ['Wolfgang Riedel'] | A Program System for Root Finding | 456,640 |
Two types of privacy-preserving decision making paradigms for utility-community interactions for multi-horizon operation are examined in this paper. In both designs, communities with renewable energy sources, distributed generators, and energy storage systems minimize their costs with limited information exchange with the utility. The utility makes decision based on the information provided from the communities. Through an iterative process, all parties achieve agreement. The authors' previous research results on subgradient and lower-upper-bound switching (LUBS)-based distributed optimization oriented multi-agent control strategies are examined and the convergence analysis of both strategies are provided. The corresponding decision making architectures, including information flow among agents and learning (or iteration) procedure, are developed for multi-horizon decision making scenarios. Numerical results illustrate the decision making procedures and demonstrate their feasibility of practical implementation. The two decision making architectures are compared for their implementation requirements as well as performance. | ['Vahid Rasouli Disfani', 'Zhixin Miao', 'Lingling Fan', 'Bo Zeng'] | Dual Decomposition-Based Privacy-Preserving Multi-Horizon Utility-Community Decision Making Paradigms | 619,727 |
This paper presents the design and evaluation of non-visual multimodal interaction techniques for collecting and storing a sequence of information. This task is representative of multiple contexts including the transmission of an itinerary represented as a sequence of pair direction-distance. Among twenty techniques we had designed, four have been evaluated with users. The results of this study establish the interest of two techniques in terms of perception, memorization and recall of information and a third one appears to be more resistant to interference task. | ['Damien Appert', 'Christophe Jouffrais', 'Emmanuel Dubois'] | Non-visual interactions to support information sequence transmission | 669,856 |
Web applications offer business and convenience services that society has become dependent on, such as online banking. Success of these applications is dependent on end user trust, although these services have serious weaknesses that can be exploited by attackers. Application owners must take additional steps to ensure the security of customer data and integrity of the applications, since web applications are under siege from cyber criminals seeking to steal confidential information and disable or damage the services offered by these applications. Successful attacks have lead to some organizations experiencing financial difficulties or even being forced out of business. Organizations have insufficient tools to detect and respond to attacks on web applications, since traditional security logs have gaps that make attack reconstruction nearly impossible. This paper explores network recording challenges, benefits and possible future use. A network recording solution is proposed to detect and capture SQL injection attacks, resulting in the ability to successfully reconstruct SQL injection attacks in order to maintain application integrity. | ['Allen Pomeroy', 'Qing Tan'] | Effective SQL Injection Attack Reconstruction Using Network Recording | 126,329 |
The notion of context in functional languages no longer refers just to variables in scope. Context can capture additional properties of variables (usage patterns in linear logics; caching requirements in dataflow languages) as well as additional resources or properties of the execution environment (rebindable resources; platform version in a cross-platform application). The recently introduced notion of coeffects captures the latter, whole-context properties, but it failed to capture fine-grained per-variable properties. We remedy this by developing a generalized coeffect system with annotations indexed by a coeffect shape . By instantiating a concrete shape, our system captures previously studied flat (whole-context) coeffects, but also structural (per-variable) coeffects, making coeffect analyses more useful. We show that the structural system enjoys desirable syntactic properties and we give a categorical semantics using extended notions of indexed comonad . The examples presented in this paper are based on analysis of established language features (liveness, linear logics, dataflow, dynamic scoping) and we argue that such context-aware properties will also be useful for future development of languages for increasingly heterogeneous and distributed platforms. | ['Tomas Petricek', 'Dominic A. Orchard', 'Alan Mycroft'] | Coeffects: a calculus of context-dependent computation | 194,094 |
this paper we shall develop the theory of ordinal numbers in the first order predicate calculus with equality as an extension of Peano's arithmetic. This theory will prove to be easy to manage and fairly powerful in the following sense: If A is a sentence of the theory of ordinal numbers, then A is a theorem of our system if and only if the natural translation of A in set theory is a theorem of Zermelo-Fraenkel set theory. It will be treated as a natural extension of Peano's arithmetic. The latter consists of axiom schemata of primitive recursive functions and mathematical induction, while the theory of ordinal numbers consists of axiom schemata of primitive recursive functions of ordinal numbers (cf. [5]), of transfinite induction, of replacement and of cardinals. The latter three axiom schemata can be considered as extensions of mathematical induction. In the theory of ordinal numbers thus developed, we shall construct a model of Zermelo-Fraenkel's set theory by following Gddel's construction | ['Gaisi Takeuti'] | A Formalization of the Theory of Ordinal Numbers | 350,203 |
Measurements have shown evidences of inter-domain packet forwarding loops in the Internet, but the exact cause of these loops remains unclear. As one of the efforts in identifying the causes, this paper examines how transient loops can be created at the inter-domain level via BGP, and what are the major factors that contribute to duration of the routing loops. As a path-vector routing protocol, BGP messages list the entire AS path to each destination and the path information enables each node to detect, thus break, arbitrarily long routing loops involving itself. However, delays due to physical constrains and protocol mechanisms slow down routing updates propagation and the routing information inconsistencies among the nodes lead to loop formation during convergence. We show that the duration of transient BGP loops match closely to BGP's routing convergence time and the looping duration is linearly proportional to BGP's minimum route advertisement interval timer (MRAI) value. We also examine four BGP routing convergence enhancements and show that two enhancements effective in speeding up routing convergence are also effective in reducing routing loops. | ['Dan Pei', 'Xiaoliang Zhao', 'Daniel Massey', 'Lixia Zhang'] | A study of BGP path vector route looping behavior | 426,203 |
In this paper, we argue that information theoretic measures may provide a robust, broadly applicable, repeatable metric to assess how a system enables people to reduce high-dimensional data into topically relevant subsets of information. Explosive growth in electronic data necessitates the development of systems that balance automation with human cognitive engagement to facilitate pattern discovery, analysis and characterization, variously described as "cognitive augmentation" or "insight generation." However, operationalizing the concept of insight in any measurable way remains a difficult challenge for visualization researchers. The "golden ticket" of insight evaluation would be a precise, generalizable, repeatable, and ecologically valid metric that indicates the relative utility of a system in heightening cognitive performance or facilitating insights. Unfortunately, the golden ticket does not yet exist. In its place, we are exploring information theoretic measures derived from Shannon's ideas about information and entropy as a starting point for precise, repeatable, and generalizable approaches for evaluating analytic tools. We are specifically concerned with needle-in-haystack workflows that require interactive search, classification, and reduction of very large heterogeneous datasets into manageable, task-relevant subsets of information. We assert that systems aimed at facilitating pattern discovery, characterization and analysis -- i.e., "insight" - must afford an efficient means of sorting the needles from the chaff; and simple compressibility measures provide a way of tracking changes in information content as people shape meaning from data. | ['Laura A. McNamara', 'Travis L. Bauer', 'Michael Joseph Haass', 'Laura E. Matzen'] | Information Theoretic Measures for Visual Analytics: The Silver Ticket? | 900,619 |
The early propagation effect found in many logic gates is a potential source of data-dependent power consumption. We show that the effect and the corresponding power dependency can be targeted for successful power analysis attacks in cryptographic hardware. Many of the current balanced gate designs did not directly consider the effect and are vulnerable to power analysis attacks. | ['Konrad J. Kulikowski', 'Mark G. Karpovsky', 'Alexander Taubin'] | Power attacks on secure hardware based on early propagation of data | 375,942 |
Finite-state models, such as finite-state machines (FSMs), aid software engineering in many ways. They are often used in formal verification and also can serve as visual software models. The latter application is associated with the problems of software synthesis and automatic derivation of software models from specification. Smaller synthesized models are more general and are easier to comprehend, yet the problem of minimum FSM identification has received little attention in previous research. This paper presents four exact methods to tackle the problem of minimum FSM identification from a set of test scenarios and a temporal specification represented in linear temporal logic. The methods are implemented as an open-source tool. Three of them are based on translations of the FSM identification problem to SAT or QSAT problem instances. Accounting for temporal properties is done via counterexample prohibition. Counterexamples are either obtained from previously identified FSMs, or based on bounded model checking. The fourth method uses backtracking. The proposed methods are evaluated on several case studies and on a larger number of randomly generated instances of increasing complexity. The results show that the Iterative SAT-based method is the leader among the proposed methods. The methods are also compared with existing inexact approaches, i.e., the ones which do not necessarily identify the minimum FSM, and these comparisons show encouraging results. | ['Vladimir Ulyantsev', 'Igor Buzhinsky', 'Anatoly Shalyto'] | Exact Finite-State Machine Identification from Scenarios and Temporal Properties | 806,181 |
Dialysis is the most common therapy for patients afflicted with chronic kidney failure. Currently, little is known about the relationship between the timing of dialysis initiation and the therapy's cost and effectiveness. This paper examines the cost-effective initiation of dialysis and compares standard initiation criteria from the clinical literature to computationally derived strategies. Comparisons make use of a simulation model that integrates submodels of disease progression, hospitalization, transplantation, cost, and quality of life. The simulation model is also used by an approximate dynamic programming (ADP) algorithm to derive approximately optimal strategies that maximize patient welfare. Patient welfare is measured from the society's perspective and is defined as the product of the expected discounted quality-adjusted life years (QALYs) and a “value-of-life” parameter, minus the expected total discounted medical expenditures. Also considered is an alternative formulation in which the goal is to minimize the expected total discounted medical expenditures without affecting patient QALYs relative to current medical practice. Numerical results show that: (i) standard early initiation strategies, where once started on dialysis patients are kept on a fixed weekly program, have a limited potential, and (ii) early dialysis at an incrementally increasing dose customized to each patient can yield a significant cost advantage. These findings demonstrate computationally intensive models of disease progression, and therapy effectiveness can identify novel strategies for managing expensive medical therapies and a more efficient use of scarce health-care resources. | ['Chris P. Lee', 'Glenn M. Chertow', 'Stefanos A. Zenios'] | Optimal Initiation and Management of Dialysis Therapy | 453,476 |
Recommendation, trust and reputation management in a group online mentorship system. | ['Oluwabunmi Adewoyin', 'Julita Vassileva'] | Recommendation, trust and reputation management in a group online mentorship system. | 739,004 |
Conformance for DecSerFlow Constraints | ['Yutian Sun', 'Jianwen Su'] | Conformance for DecSerFlow Constraints | 562,092 |
Mining Unstructured Software Repositories | ['Stephen W. Thomas', 'Ahmed E. Hassan', 'Dorothea Blostein'] | Mining Unstructured Software Repositories | 600,088 |
The success of grid computing depends on the existence of grid middleware that provides core services such as security, data management, resource information, and resource brokering and scheduling. Current general-purpose grid resource brokers deal only with computation requirements of applications, which is a limitation for data grids that enable processing of large scientific data sets. In this paper, a new data-aware resource brokering scheme, which factors both computational and data transfer requirements into its cost models, has been implemented and tested. The experiments reported in this paper clearly demonstrate that both factors should be considered in order to efficiently schedule data intensive tasks. | ['Huy Le', 'Paul D. Coddington', 'Andrew L. Wendelborn'] | A data-aware resource broker for data grids | 844,598 |
Data management and routing in general networks. | ['Harald Räcke'] | Data management and routing in general networks. | 732,559 |
In this paper, we propose a general framework for Extreme Learning Machine via free sparse transfer representation, which is referred to as transfer free sparse representation based on extreme learning machine (TFSR-ELM). This framework is suitable for different assumptions related to the divergence measures of the data distributions, such as a maximum mean discrepancy and K-L divergence. We propose an effective sparse regularization for the proposed free transfer representation learning framework, which can decrease the time and space cost. Different solutions to the problems based on the different distribution distance estimation criteria and convergence analysis are given. Comprehensive experiments show that TFSR-based algorithms outperform the existing transfer learning methods and are robust to different sizes of training data. | ['Xiaodong Li', 'Weijie Mao', 'Wei Jiang', 'Ye Yao'] | Extreme learning machine via free sparse transfer representation optimization | 719,286 |
We present a fast and generic algorithm, k-MLE, for learning statistical mixture models using maximum likelihood estimators. We prove theoretically that k-MLE is dually equivalent to a Bregman k-means for the case of mixtures of exponential families (e.g., Gaussian mixture models). k-MLE is used to initialize appropriately the expectation-maximization algorithm. We also show experimentally that k-MLE outperforms the EM technique with standard initialization by considering modeling color images using high-dimensional Gaussian mixture models. | ['Frank Nielsen'] | K-MLE: A fast algorithm for learning statistical mixture models | 354,275 |
This paper considers the problem of single image super-resolution (SR). Previous example-based SR approaches mainly focus on analyzing the co-occurrence property of low resolution (LR) and high resolution (HR) patches via dictionary learning. In this paper, we propose a novel approach based on local linear approximation of the HR patch space using a sparse subspace clustering (SSC) algorithm. Our approach exploits the underlying HR patches' non-linear space by considering it as a low dimensional manifold in a high dimensional Euclidean space, and by employing each training HR patch as a sample from the manifold. We utilize the SSC algorithm to create the set of low dimensional linear spaces that are considered, approximately, as tangent spaces at the HR samples. Based on the obtained approximated tangent spaces, we examine the structure of the underlying HR manifold that allows locating the co-occurrence HR patch for a given LR one. The proposed approach requires a small number of training HR samples (about 1000 patches), without any prior assumption about the LR images. A comparison of the obtained results with other state-of-the-art methods clearly indicates the viability of the proposed approach. | ['Chinh T. Dang', 'Mohammad Aghagolzadeh', 'Abdolreza Abdolhosseini Moghadam', 'Hayder Radha'] | Single image super resolution via manifold linear approximation using sparse subspace clustering | 925,112 |
In this paper, narrow-band interference (NBI) mitigation is addressed in amplify-and-forward orthogonal-frequency-division-multiplexing (AF-OFDM) cooperative communication systems. Based on the channel gains between the interferer, destination and the relay nodes, three copies of the NBI are received at the destination node in addition to the desired signal. Hence, NBI degrades the performance of AF-OFDM systems which motivates the need for mitigation techniques to reduce its effect. NBI is a sparse signal in the frequency-domain, hence, compressive sensing (CS) framework can be used to estimate and cancel the NBI before detecting the transmitted signal. However, frequency-grid-mismatch destroys the sparsity of NBI in the frequency domain at the destination terminal. A structured-dictionary-mismatch formulation is proposed to approximate the received NBI vector by two sparse vectors. An £2,1 norm minimization problem is solved to recover the sparse vectors. The recovered NBI is then canceled from the received signal before detection. Simulation results demonstrate the merits of the proposed approach. | ['Hanan Al-Tous', 'Imad Barhumi', 'Naofal Al-Dhahir'] | Narrow-band interference mitigation using compressive sensing in AF-OFDM systems | 954,646 |
Abstract Introduction The proliferation and use of electronic medical records (EMR) in the clinical setting now provide a rich source of clinical data that can be leveraged to support research on patient outcomes, comparative effectiveness, and health systems research. Once the large volume and variety of data that robust clinical EMRs provide is aggregated, the suitability of the data for research purposes must be addressed. Therefore, the purpose of this paper is two-fold. First, we present a stepwise framework capable of guiding initial data quality assessment when matching multiple data sources regardless of context or application. Then, we demonstrate a use case of initial analysis of a longitudinal data repository of electronic health record data that illustrates the first four steps of the framework, and report results. Methods A six-step data quality assessment framework is proposed and described that includes the following data quality assessment steps: (1) preliminary analysis, (2) documentation–longitudinal concordance, (3) breadth, (4) data element presence, (5) density, and (6) prediction. The six-step framework was applied to the Transport Data Mart—a data repository that contains over 28,000 records for patients that underwent interhospital transfer that includes EMRs from the sending hospitalization, transport, and receiving hospitalization. Results There were a total of 9557 log entries of which 8139 were successfully matched to corresponding hospital encounters. 2832 were successfully mapped to both the sending and receiving hospital encounters (resulting in a 93% automatic matching rate), with 590 including air medical transport EMR data representing a complete case for testing. Results from Step 2 indicate that once records are identified and matched, there appears to be relatively limited drop-off of additional records when the criteria for matching increases, indicating the a proportion of records consistently contain nearly complete data. Measures of central tendency used in Step 3 and 4 exhibit a right skewness suggesting that a small proportion of records contain the highest number of repeated measures for the measured variables. Conclusions The proposed six-step data quality assessment framework is useful in establishing the metadata for a longitudinal data repository that can be replicated by other studies. There are practical issues that need to be addressed including the data quality assessments—with the most prescient being the need to establish data quality metrics for benchmarking acceptable levels of EMR data inclusiveness through testing and application. | ['Andrew P. Reimer', 'Alex Milinovich', 'Elizabeth A. Madigan'] | Data quality assessment framework to assess electronic medical record data for use in research. | 692,731 |
Visual Analytics of Movement: A Rich Palette of Techniques to Enable Understanding. | ['Natalia V. Andrienko', 'Gennady L. Andrienko'] | Visual Analytics of Movement: A Rich Palette of Techniques to Enable Understanding. | 777,773 |
Amplitude death (AD) in hidden attractors is attained with a scheme of linear augmentation. This linear control scheme is capable of stabilizing the system to a fixed point state even when the original system does not have any fixed point. Depending on the control parameter, different routes to AD such as boundary crises and Hopf bifurcation are observed. Lyapunov exponent and amplitude index are used to study the dynamical properties of the system. | ['Pooja Rani Sharma', 'Manish Dev Shrimali', 'Awadhesh Prasad', 'Nikolay V. Kuznetsov', 'Gennady A. Leonov'] | Controlling Dynamics of Hidden Attractors | 231,124 |
Computational microRNA (miRNA) target prediction is one of the key means for deciphering the role of miRNAs in development and disease. Here, we present the DIANA-microT web server as the user interface to the DIANA-microT 3.0 miRNA target prediction algorithm. The web server provides extensive information for predicted miRNA:target gene interactions with a user-friendly interface, providing extensive connectivity to online biological resources. Target gene and miRNA functions may be elucidated through automated bibliographic searches and functional information is accessible through Kyoto Encyclopedia of Genes and Genomes (KEGG) pathways. The web server offers links to nomenclature, sequence and protein databases, and users are facilitated by being able to search for targeted genes using different nomenclatures or functional features, such as the genes possible involvement in biological pathways. The target prediction algorithm supports parameters calculated individually for each miRNA:target gene interaction and provides a signal-to-noise ratio and a precision score that helps in the evaluation of the significance of the predicted results. Using a set of miRNA targets recently identified through the pSILAC method, the performance of several computational target prediction programs was assessed. DIANA-microT 3.0 achieved there with 66% the highest ratio of correctly predicted targets over all predicted targets. The DIANA-microT web server is freely available at www.microrna.gr/microT. | ['Manolis Maragkakis', 'Martin Reczko', 'Victor A. Simossis', 'Panagiotis Alexiou', 'Giorgos L. Papadopoulos', 'Theodore Dalamagas', 'Giorgos Giannopoulos', 'Georgios I. Goumas', 'Evangelos Koukis', 'Kornilios Kourtis', 'Thanasis Vergoulis', 'Nectarios Koziris', 'Timos K. Sellis', 'Panayotis Tsanakas', 'Artemis G. Hatzigeorgiou'] | DIANA-microT web server: elucidating microRNA functions through target prediction | 102,939 |
CIRC is an automated circular coinductive prover implemented as an extension of Maude. The circular coinductive technique that forms the core of CIRC is discussed, together with a high-level implementation using metalevel capabilities of rewriting logic. To reflect the strength of CIRC in automatically proving behavioral properties, an example defining and proving properties about infinite streams of infinite binary trees is shown. CIRC also provides limited support for automated inductive proving, which can be used in combination with coinduction. | ['Dorel Lucanu', 'Grigore Rosu'] | CIRC: a circular coinductive prover | 406,406 |
Task-specific conflict monitoring and cognitive control in the prefrontal cortex. | ['Chongwook Chung', 'Chobok Kim', 'Jeounghoon Kim'] | Task-specific conflict monitoring and cognitive control in the prefrontal cortex. | 791,547 |
This paper describes an automatic topic extraction, categorization, and relevance ranking model for multi-lingual surveys and questions that exploits machine learning algorithms such as topic modeling and fuzzy clustering. Automatically generated question and survey categories are used to build question banks and category-specific survey templates. First, we describe different pre-processing steps we considered for removing noise in the multilingual survey text. Second, we explain our strategy to automatically extract survey categories from surveys based on topic models. Third, we describe different methods to cluster questions under survey categories and group them based on relevance. Last, we describe our experimental results on a large group of unique, real-world survey datasets from the German, Spanish, French, and Portuguese languages and our refining methods to determine meaningful and sensible categories for building question banks. We conclude this document with possible enhancements to the current system and impacts in the business domain. | ['Clint P. George', 'Daisy Zhe Wang', 'Joseph N. Wilson', 'Liana Maris Epstein', 'Philip P. Garland', 'Annabell Suh'] | A Machine Learning Based Topic Exploration and Categorization on Surveys | 360,998 |
Despite the built-in garbage collector, Java programs can still suffer the memory leak problem resulted from the unhealthy programming style of retaining unwanted references. This paper presents an aspect-based tool for assisting programmers in locating such references to fix the problem. This tool, FindLeaks, utilizes an aspect to collect memory consumption statistics and object references created during a program's execution and analyzes them for detecting memory leaks. The distinctive feature of FindLeaks is that it reports not only suspected classes of leaking objects but also where in the source the unwanted references were created. Besides, this paper also reports some preliminary experience with FindLeaks. | ['Kung Chen', 'Ju-Bing Chen'] | Aspect-Based Instrumentation for Locating Memory Leaks in Java Programs | 487,550 |
We present a model for the automatic semantic analysis of requirements elicitation documents. Our target semantic representation employs live sequence charts, a multi-modal visual language for scenariobased programming, which can be directly translated into executable code. The architecture we propose integrates sentencelevel and discourse-level processing in a generative probabilistic framework for the analysis and disambiguation of individual sentences in context. We show empirically that the discourse-based model consistently outperforms the sentence-based model when constructing a system that reflects all the static (entities, properties) and dynamic (behavioral scenarios) requirements in the document. | ['Reut Tsarfaty', 'Ilia Pogrebezky', 'Guy Weiss', 'Yaarit Natan', 'Smadar Szekely', 'David Harel'] | Semantic Parsing Using Content and Context: A Case Study from Requirements Elicitation | 24,101 |
The GTT-system is a tree-to-tree transducer developed for teaching purposes in machine translation. The transducer is a specialized production system giving the linguists the tools for expressing information in a syntax that is close to theoretical linguistics. Major emphasis was placed on developing a system that is user friendly, uniform and legible. This paper describes the linguistic data structure, the rule formalism and the control facilities that the linguist is provided with. | ['Patrick Shane', 'Jean-Claude Cochard'] | GTT : A GENERAL TRANSDUCER FOR TEACHING COMPUTATIONAL LINGUISTICS | 585,954 |
In the present paper, we consider large scale nonsymmetric matrix Riccati equations with low rank right hand sides. These matrix equations appear in many applications such as transport theory, Wiener-Hopf factorization of Markov chains, applied probability and others. We show how to apply directly Krylov methods such as the extended block Arnoldi algorithm to get low rank approximate solutions. We also combine the Newton method and block Krylov subspace methods to get approximations of the desired minimal nonnegative solution. We give some theoretical results and report some numerical experiments for the well known transport equation. | ['A. H. Bentbib', 'Khalide Jbilou', 'El Mostafa Sadek'] | On some Krylov subspace based methods for large-scale nonsymmetric algebraic Riccati problems | 582,951 |
Shared memory multiprocessors with cache require careful consideration of cache parameters while implementing an algorithm to obtain optimal performance. In this paper, we study the implementation of some existing FFT algorithms and analyze the number of cache misses based on the problem size, number of processors, cache size, and block size. We also propose a new FFT algorithm which minimizes the number of cache misses. | ['Akhilesh Kumar', 'Laxmi N. Bhuyan'] | Parallel FFT Algorithms for Cache Based Shared Memory Multiprocessors | 144,416 |
In this brief, a low-overhead circuit technique is proposed to simultaneously reduce subthreshold and gate-oxide leakage currents in domino logic circuits. pMOS sleep transistors and a dual threshold voltage CMOS technology are utilized to place an idle domino logic circuit into a low leakage state. A sleep transistor added to the dynamic node strongly turns off all of the high threshold voltage transistors. Similarly, a sleep switch added to the output inverter exploits the initially high subthreshold and gate-oxide leakage currents for placing a circuit into an ultimately low leakage state. The proposed circuit technique lowers the total leakage power by 56.1% to 97.6% as compared to standard dual threshold voltage domino logic circuits. Similarly, a 4.6% to 50.6% reduction in total leakage power is observed as compared to a previously published sleep switch scheme in a 45-nm CMOS technology | ['Zhiyu Liu', 'Volkan Kursun'] | Leakage Biased pMOS Sleep Switch Dynamic Circuits | 514,435 |
Precise localization and tracking in intelligent transportation systems has aroused great interest since it is required in a large variety of applications. The positioning accuracy of global navigation satellite systems is unreliable and insufficient enough for many use cases. In urban canyons or tunnels, the positioning performance degrades due to a low received signal power, multipath propagation, or signal blocking. Instead we exploit the ubiquitous access to cellular mobile radio networks. Cellular networks are designed to cover the access to the network in an area by a single link to reduce the risk of interference from neighboring base stations. The idea of Channel-SLAM is to exploit the numerous multipath components (MPCs) of a radio signal arriving at the receiver for positioning. Each MPC can be regarded as being sent from a virtual transmitter in a pure line-of-sight condition. Within this paper, we show how to apply multipath assisted positioning in an urban scenario. Therefore, we analyze how a road user equipped with a circular antenna array is tracked in an urban scenario in the presence of only one physical transmitter. We further jointly estimate the positions of the physical and the virtual transmitters to enrich maps. | ['Markus Ulmschneider', 'Ronald Raulefs', 'Christian Gentner', 'Michael Walter'] | Multipath assisted positioning in vehicular applications | 987,814 |
Pressure sensitive buttons are appealing for reducing repetitive tasks such as text entry on mobile phone keypads, where multiple key presses are currently necessary to record an action. We present PressureText, a text-entry technique for a pressure augmented mobile phone. In a study comparing PressureText to MultiTap, we found that despite limited visual feedfback for pressure input, users overall performed equally well with PressureText as with MultiTap. Expertise was a determining factor for improved performance with PressureText. Expert users showed a 33.6% performance gain over novices. Additionally, expert users were 5% faster on average with PressureText than MultiTap, suggesting that pressure input is a valuable augmentation to mobile phone keypads. | ['David C. McCallum', 'Edward Mak', 'Pourang Irani', 'Sriram Subramanian'] | PressureText: pressure input for mobile phone text entry | 151,485 |
The primary goal of the National Digital Library for Undergraduate Mat hematics and Science Teacher Preparation and Professional Development, funded through the NSF Division of Undergraduate Education National Science Digital Libraries Initiative, is to increase the use of best teaching practices by faculty by providing the resources - tools, training, and data - needed to build inquiry and discovery into all undergraduate science and mathematics courses. Improving the math and science education of future and in-service K-12 teachers is one of the most important challenges facing college and university faculties. The preparation of future teachers is a fundamental element in the improvement of the learning experience of all students, from grades K-16. As teachers know, it is natural to teach as we have been taught ourselves. The standards in mathematics and science call for greater integration of inquiry-based techniques and more rigorous mathematical and science content. Teachers at all levels will be better equipped to meet these standards if they are taught using these approaches during their own education. The resources of this collection target two-year and four-year Colleges of Arts and Sciences faculty members and College of Education faculty that teach mathematics and science content courses. The collection focuses primarily on those resources that can be accessed electronically, whether they be web-based text or data resources, software or video that can be downloaded via the web or other electronic means, or emerging technology applications. Resources are reviewed and selected by mathematics and science content experts before they are made available to online users. This review ensures that the resources are accurate, pedagogically effective, and that this digital library is an efficient source of quality materials. This digital library enables faculty at any undergraduate institution-regardless of financial resources-to | ['Kimberly S. Roempler'] | A national digital library for undergraduate mathematics and science teacher preparation and professional development | 346,780 |
In this paper, several recent theoretical conceptions of technology-mediated education are examined and a study of 2159 online learners is presented. The study validates an instrument designed to measure teaching, social, and cognitive presence indicative of a community of learners within the community of inquiry (CoI) framework [Garrison, D. R., Anderson, T., & Archer, W. (2000). Critical inquiry in a text-based environment: Computer conferencing in higher education. The Internet and Higher Education, 2, 1-19; Garrison, D. R., Anderson, T., & Archer, W. (2001). Critical thinking, cognitive presence, and computer conferencing in distance education. American Journal of Distance Education, 15(1), 7-23]. Results indicate that the survey items cohere into interpretable factors that represent the intended constructs. Further it was determined through structural equation modeling that 70% of the variance in the online students' levels of cognitive presence, a multivariate measure of learning, can be modeled based on their reports of their instructors' skills in fostering teaching presence and their own abilities to establish a sense of social presence. Additional analysis identifies more details of the relationship between learner understandings of teaching and social presence and its impact on their cognitive presence. Implications for online teaching, policy, and faculty development are discussed. | ['Peter Shea', 'Temi Bidjerano'] | Community of inquiry as a theoretical framework to foster epistemic engagement and cognitive presence in online education | 192,305 |
In this paper, we consider delay minimization for interference networks with renewable energy source, where the transmission power of a node comes from both the conventional utility power (ac power) and the renewable energy source. We assume the transmission power of each node is a function of the local channel state, local data queue state and local energy queue state only. We consider two delay optimization formulations, namely the decentralized partially observable Markov decision process (DEC-POMDP) and noncooperative partially observable stochastic game (POSG). In DEC-POMDP formulation, we derive a decentralized online learning algorithm to determine the control actions and Lagrangian multipliers (LMs) simultaneously, based on the policy gradient approach. Under some mild technical conditions, the proposed decentralized policy gradient algorithm converges almost surely to a local optimal solution. In the noncooperative POSG formulation, the transmitter nodes are noncooperative. We extend the decentralized policy gradient solution and establish the technical proof for almost-sure convergence of the learning algorithms. In both cases, the solutions are very robust to model variations. | ['Huang Huang', 'Vincent Kin Nang Lau'] | Decentralized Delay Optimal Control for Interference Networks With Limited Renewable Energy Storage | 22,230 |
Homologous recombination is an important operator in the evolution of biological organisms. However, there is still no clear, generally accepted understanding of why it exists and under what circumstances it is useful. In this paper, we consider its utility in the context of an infinite population haploid model with selection and homologous recombination. We define utility in terms of two metrics — the increase in frequency of fit genotypes, and the increase in average population fitness, relative to those associated with selection only. Explicitly, we explore the full parameter space of a two-locus two-allele system, showing, as a function of the landscape and the initial population, that recombination is beneficial in terms of these metrics in two distinct regimes: a relatively landscape independent regime — the search regime — where recombination aids in the search for a fit genotype that is absent or at low frequency in the population; and the modular regime, where recombination allows for the juxtaposition of fit “modules” or Building Blocks (BBs). Thus, we conclude that the ubiquity and utility of recombination is intimately associated with the existence of modularity and redundancy in biological fitness landscapes. | ['Manuel Beltrán del Río', 'Christopher R. Stephens', 'David A. Rosenblueth'] | FITNESS LANDSCAPE EPISTASIS AND RECOMBINATION | 644,253 |
Many random functions, like Hash, MAC, PRG, have been used in various network applications for different security choices. However, they are either fast but insecure or cryptographic secure but slow. To integrate them together, in this paper we present a new family of square random functions, including SqHash, SqMAC and SqPRG, based on a specially truncated function (MSB or LSB), as well as circular convolution with carry bits. Provable security is provided by the privacy property in hidden number problem and Hard-core unpredication of one-way function. The experiment results show that these schemes have better performance under different input and output lengths. We also perform four types of statistical tests for randomness. The experiments indicate that our construction has good average-case randomness than SHA-2 and original Square algorithm. | ['Yan Zhu', 'Di Ma', 'Changjun Hu', 'Gail Joon Ahn', 'Hongxin Hu'] | Secure and efficient random functions with variable-length output | 215,738 |
During the recent years, there has been a tremendous growth in the development and deployment of multimedia based networked applications such as video streaming, IP telephony, interactive games, among others. These applications, in contrast to elastic applications such as email and data sharing, are delay and delay jitter sensitive but can tolerate certain level of packet loss. A vital element of end-to-end delay and delay jitter is the random queueing delays in network switches and routers. Analysis of robust mechanisms for buffer management at network routers needs to be carried out in order to reduce end-to-end delay for traffic generated by multimedia applications. In this context, a threshold based buffer management scheme for accommodating multiple class multimedia traffic in network routers has been analysed. This technique effectively controls the allocation of buffer to various traffic classes according to their delay constraints. The forms of the joint state probabilities, as well as basic performance measures such as blocking probabilities are analytically established at equilibrium. Typical numerical experiments are included to illustrate the credibility of the proposed mechanism in the context of different quality of service (QoS) grades for various network traffic classes. This model, therefore, can be used as a powerful tool to provide a required grade of service to a particular class of multimedia based web traffic in any heterogeneous network. | ['Irfan Awan', 'Shakeel Ahmad', 'Bashir Ahmad'] | Performance analysis of multimedia based web traffic with QoS constraints | 488,465 |
Abstract Like all resting-state functional connectivity data, the data from the Human Connectome Project (HCP) are adversely affected by structured noise artifacts arising from head motion and physiological processes. Functional connectivity estimates (Pearson's correlation coefficients) were inflated for high-motion time points and for high-motion participants. This inflation occurred across the brain, suggesting the presence of globally distributed artifacts. The degree of inflation was further increased for connections between nearby regions compared with distant regions, suggesting the presence of distance-dependent spatially specific artifacts. We evaluated several denoising methods: censoring high-motion time points, motion regression, the FMRIB independent component analysis-based X-noiseifier (FIX), and mean grayordinate time series regression (MGTR; as a proxy for global signal regression). The results suggest that FIX denoising reduced both types of artifacts, but left substantial global artifac... | ['Gregory C. Burgess', 'Sridhar Kandala', 'Dan Nolan', 'Timothy O. Laumann', 'Jonathan D. Power', 'Babatunde Adeyemo', 'Michael P. Harms', 'Steven E. Petersen', 'Deanna M'] | Evaluation of Denoising Strategies to Address Motion-Correlated Artifacts in Resting-State Functional Magnetic Resonance Imaging Data from the Human Connectome Project | 912,015 |
The proliferation of location-acquisition devices and thriving development of social websites enable analyzing users' movement behaviors and detecting social events in dynamic trajectory streams. In this paper, we firstly analyze the challenges in trajectory stream clustering, and then depict a three-part framework to deal with this issue, that includes i) trajectory data pre-processing for higher quality, ii) online micro-clustering to summarize a large number of microclusters, and iii) offline macro-clustering to form the resulting clusters. Particularly, we present the in-cluster maintenance strategy for online clustering evolving trajectory streams over sliding windows. It can eliminate the obsolete data while adaptively maintaining the summary statistics for continuously arriving location data, and thus avoid performance degradation with minimal harm to result quality. | ['Jiali Mao', 'Cheqing Jin', 'Xiaoling Wang', 'Aoying Zhou'] | Challenges and Issues in Trajectory Streams Clustering upon a Sliding-Window Model | 649,065 |
This paper presents PhotoSlap, an intelligent system for semantic annotation of photos. The system contains a semi-automatic face detector, a bulk annotation tool, and a multi-player online game, PhotoSlap. By exploring the design principles of gameplay and applying game theoretic analysis, PhotoSlap is designed as a fun and productive game, which adapts itself to different players to produce the desired output. Experiments involving four focus groups showed the game to be fun and effective in annotating people metadata for personal photo collections. | ['Tsung-Hsiang Chang', 'Chien-Ju Ho', 'Jane Yung-jen Hsu'] | The PhotoSlap game: play to annotate | 504,203 |
Peer-to-peer networking offers a scalable solution for sharing multimedia data across the network. With a large amount of visual data distributed among different nodes, it is an important but challenging issue to perform content-based retrieval in peer-to-peer networks. While most of the existing methods focus on indexing high dimensional visual features and have limitations of scalability, in this paper we propose a scalable approach for content-based image retrieval in peer-to-peer networks by employing the bag-of-visual-words model. Compared with centralized environments, the key challenge is to efficiently obtain a global codebook, as images are distributed across the whole peer-to-peer network. In addition, a peer-to-peer network often evolves dynamically, which makes a static codebook less effective for retrieval tasks. Therefore, we propose a dynamic codebook updating method by optimizing the mutual information between the resultant codebook and relevance information, and the workload balance among nodes that manage different codewords. In order to further improve retrieval performance and reduce network cost, indexing pruning techniques are developed. Our comprehensive experimental results indicate that the proposed approach is scalable in evolving and distributed peer-to-peer networks, while achieving improved retrieval accuracy. | ['Lelin Zhang', 'Zhiyong Wang', 'Tao Mei', 'David Dagan Feng'] | A Scalable Approach for Content-Based Image Retrieval in Peer-to-Peer Networks | 673,818 |
British Journal of Educational Technology#R##N#Early View (Online Version of Record published before inclusion in an issue) | ['Jay Loftus', 'Michele Jacobsen', 'Timothy D. Wilson'] | Learning and assessment with images: A view of cognitive load through the lens of cerebral blood flow | 833,702 |
Residence times difference (RTD) fluxgates are very simple magnetic sensors that have low onboard power requirements and an intrinsic digital (i.e., event based) form of the readout signal. These features make this class of devices competitive with the traditional second-harmonic fluxgate, which usually requires a higher power budget. Moreover, these detectors are characterized by high sensitivity and a suitably low resolution and noise floor when compared to the devices that are already on the market. Our work on RTD fluxgates has been widely presented in previous papers. In this paper, an overview of this work, which deals with the development of models, prototypes, and readout electronics and the effects of electric and magnetic noise, is presented, together with some noticeable forward steps regarding the characterization of the prototype, which is developed in the standard printed circuit board (PCB) technology, and with a preliminary discussion on possible solutions to improve the performance of the device with an emphasis on the resolution. | ['Bruno Ando', 'S. Baglio', 'V. Sacco', 'Adi R. Bulsara', 'Visarath In'] | PCB Fluxgate Magnetometers With a Residence Times Difference Readout Strategy: The Effects of Noise | 164,731 |
The quality of Software Requirements Specifications (SRS) is important to gain a competitive advantage in the software industry. Although the use of agile methods has grown in recent years, empirical studies conducted in industry identified several problems related to SRS in the context of agile projects. The goal of this study is to investigate the phenomenon of the quality of SRS in Agile Software Development (ASD) and build an explanatory model about it. We use a mixed method research strategy for creating a rich description of the factors that affect the quality of SRS in ASD. First, we conducted a systematic mapping study, then we performed a cross-case analysis of two software organizations: one small private organization and a large public organization. We built an initial model from this analysis. The findings were that SRS in agile projects should be directed to the development team, so it should be close to what will be implemented. The fragmentation of the description of the requirements in various artifacts and excessive detail were considered factors that compromise the quality of the SRS. | ['Juliana Oliveira de Medeiros', 'Miguel Goulão', 'Alexandre Marcos Lins de Vasconcelos', 'Carla Silva'] | Towards a Model about Quality of Software Requirements Specification in Agile Projects | 990,048 |
High complexity of frequency-hopping (FH)/spread- spectrum(SS) sequence is of great importance to high-security multiple-access communication systems, for it makes FH/SS sequence difficult to be analyzed. In this paper, a new complexity metric to evaluate the unpredictability of FH/SS sequence based on the Fuzzy Entropy(FuzzyEn) is presented. Simulation and analytical results show that, the proposed FuzzyEn works can effectively discern the changing complexities of the FH/SS sequences, and are compared with complexity metric based on the Approximate Entropy(ApEn). The FuzzyEn scheme has obvious advantages in the robustness to resolution parameter, the dependence to observation length and the sensitivity to vector dimension. | ['Xiaojun Chen', 'Zan Li', 'Jiangbo Si', 'Benjian Hao', 'Baoming Bai'] | Determining the Complexity of FH/SS Sequences by Fuzzy Entropy | 88,713 |
This technical note develops conditions for the closed-loop stability of a new class of cooperative distributed model predictive control, called satisficing, whereby the relative importance of each controller changes dynamically depending on the prevailing conditions instead of being adjusted a priori. In the satisficing approach, the less satisfied controller will gain more importance. The main properties of the proposed approach are illustrated with an unstable dynamic system composed of three subsystems. | ['Marcelo Lopes de Lima', 'D. Limon', 'David Muñoz de la Peña', 'Eduardo Camponogara'] | Distributed Satisficing MPC With Guarantee of Stability | 643,502 |
System administrators are under pressure to do more work and provide better customer service with fewer staff members. At the same time, other challenges emerge: constant interrupts, poor morale, career development needs. At Intel Online Services, we use peer certification to reduce system and network administration burdens while simultaneously improving both customer service and staff morale. Intel Online Services (IOS) has teams of system administrators specializing in various areas such as Virtual Private Networks (VPNs), mail, DNS, and firewalls. Before peer certification these specialists did all of an area's work, from completing routine changes and handling problem escalations, to doing engineering work. Peer certification was created as a way to add qualified personnel. Specialists certified their peers by having them pass oral content tests and by supervising them doing changes. Tools were created to simplify administration tasks and make them doable by nonspecialists, and varied in complexity and flexibility depending on the expertise needed to do the task. After implementing peer certification, the number of staff certified to make basic changes increased greatly, along with the number of changes made by front line staff, while the number of escalations decreased. Morale improved as interrupts were reduced and staff gained new areas to learn while customer issues and requests were resolved more quickly. | ['Stacy Purcell', 'Sally Hambridge', 'David Armstrong', 'Tod Oace', 'Matt Baker', 'Jeff Sedayao'] | Peer Certification: Techniques and Tools for Reducing System Admin Support Burdens While Improving Customer Service | 541,069 |
A Lightweight Framework for Testing Safety-critical Component-based Systems on Embedded Targets. | ['Nermin Kajtazovic', 'Andrea Höller', 'Tobias Rauter', 'Christian Kreiner'] | A Lightweight Framework for Testing Safety-critical Component-based Systems on Embedded Targets. | 767,651 |
Virtualization is increasingly being used in regular desktop PCs, data centers and server farms. One of the advantages of introducing this additional architectural layer is to increase overall system security. In this paper we propose an architecture ( KvmSec ) that is an extension to the Linux Kernel Virtual Machine aimed at increasing the security of guest virtual machines. KvmSec can protect guest virtual machines against attacks such as viruses and kernel rootkits. KvmSec enjoys the following features: it is transparent to guest machines; it is hard to access even from a compromised virtual machine; it can collect data, analyze them, and act consequently on guest machines; it can provide secure communication between each of the guests and the host; and, it can be deployed on Linux hosts and at present supports Linux guest machines. These features are leveraged to implement a real-time monitoring and security management system. Further, differences and advantages over previous solutions are highlighted, as well as a concrete roadmap for further development. | ['Flavio Lombardi', 'Roberto Di Pietro'] | KvmSec: a security extension for Linux kernel virtual machines | 446,981 |
School libraries are required to promote the habit of reading books in elementary school children. It is necessary to cultivate children's interest in books to achieve this goal. In this paper, we propose a user-generated agent (UGA) that introduces books. Elementary school children can program the behavior of the UGA themselves. The UGA not only cultivates the children's interest in the book introduced by the agent, but also their motivation for the presentation by allowing them to design the contents of the agent. We promote the habit of reading by allowing the children to modify the agent's design and giving them the opportunity to refine their ability to promote books. | ['Yusuke Kudo', 'Wataru Kayano', 'Takuya Sato', 'Hirotaka Osawa'] | User Generated Agent: Designable Book Recommendation Robot Programmed by Children | 895,041 |
This paper presents a two-step pulse-shrinking time-to-digital converter (TDC) consisting of a 4-stage coarse pulse-shrinking TDC with per-stage shrinkage 1 ns and a 4-stage fine pulse-shrinking TDC with per-stage shrinkage 250 ps. A simple residual time extraction scheme is proposed to extract the residual pulse of the coarse TDC. The characteristics of the TDC including mismatch and noise-induced timing errors, timing errors of delay blocks, conversion time, power consumption, and silicon consumption are analyzed in detail. The proposed TDC was implemented in an IBM 130 nm 1.2 V CMOS technology. Simulation results show that the proposed TDC offers 1.4 ns conversion time, 1 LSB DNL and INL, and figure-of-merit (FoM) of 0.163 pJ/step. Some measurement results of the proposed TDC are also presented. | ['Young Jun Park', 'Fei Yuan'] | Two-step pulse-shrinking time-to-digital converter | 962,086 |
We report our work in progress in the area of music intelligent tutoring systems (MITS). We discuss the motivation behind the design of GUI that aim to support an interactive learning in the MITS environment. These interactivities include onscreen score editing and capturing student behaviours during tutorial sessions (e.g. feedbacks, queries, stream of action-events). In this report, we discuss our representation, then our design and finally present some interaction examples from our system. | ['Somnuk Phon-Amnuaisuk', 'Keh-Siong Chee'] | Interactivities in music intelligent tutoring system | 359,398 |
In this paper, we investigate the problem of carrier frequency offset (CFO) estimation for orthogonal frequency division multiplexing (OFDM) system over doubly-selective channels. Representing the doubly-selective channels with basis expansion, the signal model is reformulated and one CFO estimator is derived. Furthermore, the Cramer-Rao bound (CRB) for the estimation problem is derived in closed form. The effectiveness of the proposed scheme is verified by simulations. | ['Jianwu Chen', 'Yik-Chung Wu', 'Tung-Sang Ng'] | Frequency synchronization for OFDM systems over doubly-selective channels | 163,108 |
A new vision-based technique for autonomous driving is described. This approach explicitly addresses and compensates for two forms of uncertainty: uncertainty about changes in road direction and uncertainty in the measurements of the road derived in each image. Autonomous driving has been demonstrated on both local roads and highways at speeds up to 100 km/h. The algorithm has performed well in the presence of non-ideal road conditions including gaps in the lane markers, sharp curves, shadows, cracks in the pavement, and wet roads. It has also performed well in rain, dark, and nighttime driving with headlights. > | ['Henry Schneiderman', 'Marilyn Nashman'] | A discriminating feature tracker for vision-based autonomous driving | 497,411 |
A formal verifier is an automated decision procedure that can prove or disprove a set of statements in some logical system of reasoning. Problems informal verification have been posed and studied in a variety of disciplines for many years. However the last ten years have produced significant advances in both the theory and practical art of building formal verifiers. Various formal proof techniques available today include language containment, model checking, equivalence checking, symbolic simulation and theorem proving. In this tutorial, we will be restricting ourselves to the formal finite state machine based techniques: language containment, model checking and equivalence checking. A brief introduction to the technologies that underly these techniques will be presented as well. The tutorial will conclude with some examples of how formal methods can be employed in the verification of hardware systems. | ['Gitanjali Swamy'] | Formal verification of digital systems | 124,332 |
The objective of the present study is to investigate the possibility of developing an integrated database with information pertaining to the income of Italian families arising from two major surveys conducted by ISTAT EU-SILC and the Bank of Italy household income survey. Since neither of the surveys has the scope to allow for the construction of a database of information pertaining to income, an integration has been sought between the data from the two archives, assuming that the surveys are reliable in terms of the accuracy of the sample design and control of the representativeness of the sample. The development of our analysis is primarily aimed at carrying out an in-depth comparison between the two surveys in terms of structure, definition of variables and sample homogeneity and secondly, through the use of an integrated dataset, at a verification measurement of the validity of the information, in particular, of the income component. | ['Silvestro Montrone', 'Paola Perchinunno'] | Data integration techniques for the measurement of the reliability of sample variables | 104,623 |
Are hybrid simulation models always beneficial? When should one modeling paradigm be used more than another? How does one know the right balance has been reached between different simulation techniques for the system under investigation? We illustrate selected insights into hybrid simulation through the use of a discrete event simulation (DES) model and a hybrid DES agent based model (ABM) of the obstetrics department at Akershus University Hospital. Design decisions are not straightforward, and have different impacts on model development and ability to address different scenarios or potential changes. In the DES model, the majority of the logic and code representing patient pathways is contained within the structure of the model. In the AB-DES model, a selection of the code is shifted from the model structure to the patient entities. Scenarios are presented which illustrate strengths and weaknesses of each model. These are reflected on and future work is suggested. | ['Joe Viana', 'Kim Rand-Hendriksen', 'Tone Breines Simonsen', 'Mathias Barra', 'Fredrik A. Dahl'] | Do hybrid simulation models always increase flexibility to handle parametric and structural changes | 981,748 |
Evolved Bat Algorithm with Increase-Wave Strategy | ['Pei-Wei Tsai', 'Shunmiao Zhang', 'Yuan Liu', 'Yao He', 'Jeng-Shyang Pan'] | Evolved Bat Algorithm with Increase-Wave Strategy | 663,438 |
Compressed sensing has a wide range of applications that include error correction, imaging, radar and many more. Given a sparse signal in a high dimensional space, one wishes to reconstruct that signal accurately and efficiently from a number of linear measurements much less than its actual dimension. Although in theory it is clear that this is possible, the difficulty lies in the construction of algorithms that perform the recovery efficiently, as well as determining which kind of linear measurements allow for the reconstruction. There have been two distinct major approaches to sparse recovery that each present different benefits and shortcomings. The first, L1-minimization methods such as Basis Pursuit, use a linear optimization problem to recover the signal. This method provides strong guarantees and stability, but relies on Linear Programming, whose methods do not yet have strong polynomially bounded runtimes. The second approach uses greedy methods that compute the support of the signal iteratively. These methods are usually much faster than Basis Pursuit, but until recently had not been able to provide the same guarantees. This gap between the two approaches was bridged when we developed and analyzed the greedy algorithm Regularized Orthogonal Matching Pursuit (ROMP). ROMP provides similar guarantees to Basis Pursuit as well as the speed of a greedy algorithm. Our more recent algorithm Compressive Sampling Matching Pursuit (CoSaMP) improves upon these guarantees, and is optimal in every important aspect. | ['Deanna Needell'] | Topics in Compressed Sensing | 521,394 |
This study proposed a research model to explore the WOM behaviour of e-service users based on the IS post-acceptance model. The research model was empirically tested in the research context of online travel services with data collected in China. The research results indicate that perceived usefulness and user satisfaction affect e-service users' WOM behaviour positively together with trust. Perceived usefulness was found to exert the strongest influence on WOM behaviour followed by satisfaction and trust. The implications for theories and practice are also discussed. | ['Hongxiu Li', 'Reima Suomi'] | Understanding the WOM behaviour of e-service users: an empirical study in online travel services | 890,930 |
On the Estimation of Discount Parameters for Language Model Smoothing. | ['Martin Sundermeyer', 'Ralf Schlüter', 'Hermann Ney'] | On the Estimation of Discount Parameters for Language Model Smoothing. | 754,749 |
Estimation of output-cost - ratio using an aeroelastic model of voice production. | ['Jaromír Horáček', 'Anne-Maria Laukkanen', 'Petr Šidlof'] | Estimation of output-cost - ratio using an aeroelastic model of voice production. | 780,877 |
Finite control set model predictive control (FCS-MPC) has been accepted as an effective and feasible method in variable-speed drive applications. Considering the discrete nature of the converters and using a cost function for state selection reduce the computational burden despite of having a precise control. In this paper, FCS-MPC has been used to develop a novel method for induction motor control. Contrarily to conventional direct torque and flux control, in the proposed method, the torque and the angle between stator current and rotor flux are controlled. The fluxes are not directly controlled. This method increases the efficiency of the motor in light loads without using online optimum flux calculation. The angle control has become feasible by using FCS-MPC without imposing time-consuming calculations. Closed-loop prediction model is used to increase the precision of the angle prediction. A novel and simple gain calculation is also proposed. The proposed method has been evaluated by both simulations and experiments. | ['S. Alireza Davari'] | Predictive Direct Angle Control of Induction Motor | 698,969 |
Online role‐play environments for higher education | ['Carol Russell', 'John Shepherd'] | Online role‐play environments for higher education | 162,738 |
Local structural information is crucially important for human visual system to perceive natural scenes. Recent years, a variety of local image structure description methods have been proposed for the artificial modeling of visual perception. Although existing local image structure descriptors have shown successful performances, one general limitation is their numerical instability caused by ignoring the information of the spatial correlation of local orientation. In this paper, we propose a local image structure descriptor by modeling the anisotropic mechanism in the primary visual cortex. In particular, the pixel-wise anisotropy values of a given image are calculated by pseudo-Wigner-Ville distribution (PWVD) and Renyi entropy. Then the excitatory/inhibitory interactions among visual neurons in the local receptive field are modeled by measuring the similarities between their anisotropies. By mapping visual neurons to image pixels, the correlation between a central pixel and its local neighbors can be represented by a binary pattern which is named as local anisotropic pattern (LAP). Experimental results on texture classification verified that the proposed LAP has satisfactory texture classification accuracy, rotation invariance, and noise robustness; experimental results on no-reference image quality assessment demonstrated that the proposed LAP achieves state-of-the-art performance in objective evaluation of the perceptual quality of natural image, and this reflects that LAP can accurately represent the degradation of local image structure. | ['Songlin Du', 'Yaping Yan', 'Yide Ma'] | LAP: a bio-inspired local image structure descriptor and its applications | 852,902 |
This is a new Computers & Society feature, in which we provide reports and descriptions about professional and advocacy organizations that have goals in common with SIGCAS. If you are a member of an organization that fits this description, or know individuals or colleagues who are members of different groups, please consider contributing a piece to this section. | ['Alexander Halavais'] | Related organizations | 710,134 |
This review examines the current approaches to leadership by dividing them into two major categories: those that treat leadership as a hierarchical system and those that treat leadership as a complex, flexible framework. The innovation of the paper is in using a bibliometric analysis in order to observe whether our results bore a resemblance to what is known in the literature about the different approaches to leadership until now. The data sources for the analyses were the Science and Social Science Citation Index Expanded database and the World Catalog database. The main argument is that although transformational leadership still remains the most influential in this field of research, shared, complexity, and collective types of leadership are the approaches that show the next greatest intensity of research. A quantitate analysis of a bibliometric method supports this suggestion. We argue that the reason for their popularity in the field lies in the modern structure of Western society, with its shift from the Industrial Era to the Knowledge Era shaped by democratization, globalization, and growing complexity of modern society. | ['Diana Tal', 'Avishag Gordon'] | Leadership of the present, current theories of multiple involvements: a bibliometric analysis | 642,210 |
On the basis of Transfer Path Analysis (TPA) method, the driver's noise which was caused by powertrain excitation was taking under the problematic condition. The method and procedure of TPA were studied using LMS/TPA software. The dominant transfer path which has influence on the driver's noise was identified. The results show that the rear mount excitation of the powertrain influences the driver side noise most. In order to ameliorate ride comfort, the isolation performances of the rear powertrain mount needs to be improved. The amplitude of every transfer path's partial contribution is identified and the phase relation among each contribution's amplitude is found. This paper provides a base for the design of powertrain mounts. | ['Wei Li', 'Dengfeng Wang', 'Shuming Chen', 'Yuan-bao Li', 'Shou-kui Li', 'Wei-juan Zheng'] | Transfer path analysis of powertrain vibration on driver's noise | 216,732 |
Background#R##N#The Analytic Hierarchy Process (AHP) is increasingly used to measure patient priorities. Studies have shown that there are several different approaches to data acquisition and data aggregation. The aim of this study was to measure the information needs of patients having a rare disease and to analyze the effects of these different AHP approaches. The ranking of information needs is then used to display information categories on a web-based information portal about rare diseases according to the patient’s priorities. | ['Frédéric Pauer', 'Katharina Schmidt', 'Ana Babac', 'Kathrin Damm', 'Martin Frank', 'J.-Matthias Graf von der Schulenburg'] | Comparison of different approaches applied in Analytic Hierarchy Process – an example of information needs of patients with rare diseases | 866,449 |
Combining a set of existing constraint solvers into an integrated system of cooperating solvers is a useful and economic principle to solve hybrid constraint problems. In this paper we show that this approach can also be used to integrate different language paradigms into a unified framework. Furthermore, we study the syntactic, semantic and operational impacts of this idea for the amalgamation of declarative and constraint programming. | ['Petra Hofstedt', 'Peter Pepper'] | Integration of declarative and constraint programming | 150,576 |
This paper presents a conceptual conical-scanning radiometer/scatterometer (RadScat) instrument design for the purpose of improving satellite ocean vector wind retrievals under rain-free conditions. This technique combines the wind vector signature in the passive linearly polarized ocean brightness temperatures with the anisotropic signature of multiazimuthal radar cross-sectional measurements to retrieve oceanic surface wind vectors. The performance of the RadScat is evaluated using a Monte Carlo simulation based on actual measurements from the SeaWinds scatterometer and the Advanced Microwave Scanning Radiometer onboard the Advanced Earth Observing Satellite II. The results demonstrate significant improvements in wind vector retrievals, particularly in the near-subtrack swath, where the performance of conical-scanning scatterometers degrades. | ['Suleiman Alsweiss', 'P. Laupattarakasem', 'W.L. Jones'] | A Novel Ku-Band Radiometer/Scatterometer Approach for Improved Oceanic Wind Vector Measurements | 146,573 |
Collaborative systems that automate the sharing of programmer-defined user interfaces offer limited coupling flexibility, typically forcing all users of an application to share all aspects of the user interfaces. Those that automatically support high coupling flexibility are tied to a narrow set of predefined user-interfaces. We have developed a framework that provides high-level and flexible coupling support for arbitrary, programmer-defined user interfaces. The framework refines an abstract layered model of collaboration with structured application layers and automatic acquisition, transformation, and processing of updates. It has been used to easily provide flexible coupling in complex, existing single-user software and shown to support all known ways to share user-interfaces. Coupling flexibility comes at the cost of a small amount of additional programming. We have carefully crafted the framework to ensure that this overhead is proportional to the degree of coupling flexibility desired. | ['Vassil Roussev', 'Prasun Dewan'] | Supporting high coupling and user-interface flexibility | 390,199 |
With the increasing demand for energy-efficient power delivery network (PDN) in today's electronic systems, configuring an optimal PDN that supports power management techniques, e.g., dynamic voltage scaling (DVS), has become a daunting, yet vital task. This paper describes how to model and configure such a PDN so as to minimize the total energy dissipation in DVS-enabled systems, while satisfying total PDN cost and/or power conversion efficiency constraints. The problem of configuring an energy-efficient PDN under various constraints is subsequently formulated by using a controllable Markovian decision process (MDP) model and solved optimally as a policy optimization problem. The key rationale for utilizing MDP for solving the PDN configuration problem is to manage stochastic behavior of the power mode transition times of DVS-enabled systems. Simulation results demonstrate that the proposed technique ensures energy savings, while satisfying design goals in terms of total PDN cost and its power efficiency. 1 | ['Hwisung Jung', 'Massoud Pedram'] | Optimizing the power delivery network in dynamically voltage scaled systems with uncertain power mode transition times | 464,332 |
It was shown before that the NP-hard problem of deterministic finite automata (DFA) identification can be effectively translated to Boolean satisfiability (SAT). Modern SAT-solvers can tackle hard DFA identification instances efficiently. We present a technique to reduce the problem search space by enforcing an enumeration of DFA states in depth-first search (DFS) or breadth-first search (BFS) order. We propose symmetry breaking predicates, which can be added to Boolean formulae representing various DFA identification problems. We show how to apply this technique to DFA identification from both noiseless and noisy data. Also we propose a method to identify all automata of the desired size. The proposed approach outperforms the current state-of-the-art DFASAT method for DFA identification from noiseless data. A big advantage of the proposed approach is that it allows to determine exactly the existence or non-existence of a solution of the noisy DFA identification problem unlike metaheuristic approaches such as genetic algorithms. | ['Vladimir Ulyantsev', 'Ilya Zakirzyanov', 'Anatoly Shalyto'] | Symmetry Breaking Predicates for SAT-based DFA Identification | 645,050 |
A method is presented which addresses the problem of determinating the appropriate distribution of forces among the fingers of a multifingered gripper grasping an object. The finger-object interactions are modeled as point contacts. The system is statically indeterminate, and an optimal solution for this problem is desired for force control. A fast and efficient suboptimal method for computing the grasping forces is presented. In addition to determining the equilibrating forces (the forces required to maintain equilibrium), it is essential to superpose interaction forces (the forces which squeeze the object) to ensure that the fingers do not slip. The decomposition of the equilibrating forces into forces perpendicular and parallel to the load wrench provides a useful simplification. If it is assumed that the normals to the object at the point of contract pass through the centroid of the contact points, the computations required to find the interaction forces are considerably simplified. Some simple grasps are used to evaluate the proposed algorithms. > | ['Vijay Kumar', 'Kenneth J. Waldron'] | Sub-optimal algorithms for force distribution in multifingered grippers | 388,688 |
A number of recent articles in computational linguistics venues called for a closer examination of the type of noise present in annotated datasets used for benchmarking (Reidsma and Carletta, 2008; Beigman Klebanov and Beigman, 2009). In particular, Beigman Klebanov and Beigman articulated a type of noise they call annotation noise and showed that in worst case such noise can severely degrade the generalization ability of a linear classifier (Beigman and Beigman Klebanov, 2009). In this paper, we provide quantitative empirical evidence for the existence of this type of noise in a recently benchmarked dataset. The proposed methodology can be used to zero in on unreliable instances, facilitating generation of cleaner gold standards for benchmarking. | ['Beata Beigman Klebanov', 'Eyal Beigman'] | Some Empirical Evidence for Annotation Noise in a Benchmarked Dataset | 506,759 |
The recent interest in carrying out software engineering in a distributed manner could lead to a future increase in the contracting of software engineers, grouped into flexible, distributed software teams. One of the implications will be a requirement for more customizable software engineering environments to meet the diverse requirements of different projects. This paper examines customizability issues and suggests the use of component-based systems to achieve a high degree of customizability. A component model for software tools is presented in which tool components are characterized by the services they provide, require and optionally can use. Implementations of early prototypes, using JavaBeans components and employing the JavaBeans Activation Framework, are presented. The integration of legacy tools into the model is explored, and two mechanisms are presented: adapters encapsulate access to tools implemented in Java, and wrappers integrate other external tools. | ['Robert P. Biuk-Aghai'] | Customizable software engineering environments for flexible distributed software teams | 358,127 |
We present a novel technique to predict energy and power consumption in an electronic system, given its behavioral specification and library components. The early prediction gives circuit designers the freedom to make numerous high-level choices (such as die size, package type, and latency of the pipeline) with confidence that the final implementation will meet power and energy as well as cost and performance constraints. Our unique statistical estimation technique associates low-level, technology dependent physical and electrical parameters with expected circuit resources and interconnect. Further correlations with switching activity yield accurate results consistent with implementations. All feasible designs are investigated using this technique and the designer may trade off between small size, high speed, low energy and low power. The results for designs of two popular signal processing applications, predicted prior to synthesis, are within 10% accuracy of power estimates performed on synthesized layouts. | ['Suhrid A. Wadekar', 'Alice C. Parker', 'C. P. Ravikumar'] | FREEDOM: statistical behavioral estimation of system energy and power | 93,413 |
High-density oligonucleotide arrays are a powerful tool for uncovering changes in global gene expression in various disease states. To this end, it is essential to first characterize the variations of gene expression in normal physiological processes. We established the Human Gene Expression (HuGE) Index database (www.HugeIndex.org) to serve as a public repository for gene expression data on normal human tissues using high-density oligonucleotide arrays. This resource currently contains the results of 59 gene expression experiments on 19 human tissues. We provide interactive tools for researchers to query and visualize our data over the Internet. To facilitate data analysis, we cross-reference each gene on the array with its annotation in the LocusLink database at NCBI. | ['Peter M. Haverty', 'Zhiping Weng', 'N. Best', 'Ken Auerbach', 'Li-Li Hsiao', 'Roderick V. Jensen', 'Steven R. Gullans'] | HugeIndex: a database with visualization tools for high-density oligonucleotide array data from normal human tissues | 259,897 |
A 1.5V 10-b 4MS/s pipeline ADC for sensor interfacing is described. Amplifiers are efficiently shared between stages and low-voltage techniques are used to reduce the power supply down to 1.4V. The selected resolution-per-stage greatly simplifies the implementation of a low-power design. Simulated results using a standard digital 0.18 /spl mu/m CMOS technology exhibit 9.5 effective bits at Nyquist-rate. The chip occupies 0.6 mm/sup 2/ and dissipates only 3 mW at maximum conversion-rate. | ['Bruno Vaz', 'J. Goes', 'Ramón Piloto', 'J. Neto', 'R. Monteiro', 'Nuno F. Paulino'] | A low-voltage 3 mW 10-bit 4MS/s pipeline ADC in digital CMOS for sensor interfacing | 422,478 |
In this paper we investigated the levels of addiction and personal data disclosure within Massively Multiplayer Online Role Playing Game environments (MMORPG's). The study made use of an online survey, a combination of a six point behavioural addiction framework, Self Determination Theory and Impression Management theory to assess addictive behaviour and consequential data disclosure amongst a sample of 188 Singaporean based MMORPG gamers. These find- ings were juxtaposed with results of a previous study which investigated MMORPG addiction and data disclosure amongst 357 European online gamers to facilitate a cultural comparison (8). Results found that pathological gaming addiction had a direct effect on levels of personal and sensitive data disclosure and participants who were disclosing high amounts of data were considered more vulnerable to exploitation and predation. In addition, the Singaporean sample exhibited similar levels of addiction yet marginally lower levels of data disclosure compared to their European counterparts. | ['Benjamin George Sanders', 'Paul Dowland', 'Shirley Atkinson', 'Daniel Zahra', 'Steven Furnell', 'Maria Papadaki'] | Online Addiction: A Cultural Comparison of Privacy Risks in Online Gaming Environments | 762,463 |
A physically based liquid sound synthesis methodology is developed. The fundamental mechanism for the production of liquid sounds is identified as the acoustic emission of bubbles. After reviewing the physics of vibrating bubbles as it is relevant to audio synthesis, a sound model for isolated single bubbles is developed and validated with a small user study. A stochastic model for the real-time interactive synthesis of complex liquid sounds such as produced by streams, pouring water, rivers, rain, and breaking waves is based on the synthesis of single bubble sounds. It is shown how realistic complex high dimensional sound spaces can be synthesized in this manner. | ['Kees van den Doel'] | Physically based models for liquid sounds | 283,670 |
Stroke, traumatic brain injury, multiple sclerosis, Parkinson's disease, Alzheimer's... Every year in France, tens of thousands of people fall victim to one of those neurological pathologies. Acquired brain injury leads to cognitive impairment and heavy loss of autonomy. Rehabilitation interventions are needed to enable people to recover capacity and return to Activities of Daily Living (ADL), such as grocery shopping. Unfortunately, the resources made available in cognitive rehabilitation are insufficient for the growing needs of victims of brain damage. The assets of virtual reality to address this big problem of public health are today scientifically recognized [Rizzo and Kim 2005; Klinger, et al. 2010]. In this context, we designed the AGATHE tool (Adaptable, configurable and upgradable tool for the generation of personalized therapeutic applications in cognitive rehabilitation) (AGATHE project, ANR-09-TECS-002). | ['Evelyne Klinger', 'Pierre-Alain Joseph', 'J. Guiet', 'Philippe Fuchs', 'Nicolas Du Lac', 'F. Servant'] | AGATHE: a tool for personalized rehabilitation of cognitive functions | 142,086 |
A miniaturized FSS based on tortuous structure design | ['Ning Liu', 'Xianjun Sheng', 'Jingjing Fan', 'Dongming Guo'] | A miniaturized FSS based on tortuous structure design | 957,629 |
Features extracted from delta, theta, alpha, beta and gamma bands spanning low frequency range are commonly used to classify scalp-recorded electroencephalogram (EEG) for designing brain---computer interface (BCI) and higher frequencies are often neglected as noise. In this paper, we implemented an experimental validation to demonstrate that high frequency components could provide helpful information for improving the performance of the mental task based BCI. Electromyography (EMG) and electrooculography (EOG) artifacts were removed by using blind source separation (BSS) techniques. Frequency band powers and asymmetry ratios from the high frequency band (40---100 Hz) together with those from the lower frequency bands were used to represent EEG features. Finally, Fisher discriminant analysis (FDA) combining with Mahalanobis distance were used as the classifier. In this study, four types of classifications were performed using EEG signals recorded from four subjects during five mental tasks. We obtained significantly higher classification accuracy by adding the high frequency band features compared to using the low frequency bands alone, which demonstrated that the information in high frequency components from scalp-recorded EEG is valuable for the mental task based BCI. | ['Li Zhang', 'Wei He', 'Chuanhong He', 'Ping Wang'] | Improving Mental Task Classification by Adding High Frequency Band Information | 236,058 |
The discovery of words by young infants involves two interrelated processes: (a) the detection of recurrent word-like acoustic patterns in the speech signal, and (b) cross-modal association between auditory and visual information. This paper describes experimental results obtained by a computational model that simulates these two processes. The model is able to build word-like representations on the basis of multimodal input data (stimuli) without the help of an a priori specified lexicon. Each input stimulus consists of a speech signal accompanied by an abstract visual representation of the concepts referred to in the speech signal. In this paper we investigate how internal representations generalize across speakers. In doing so, we also analyze the cognitive plausibility of the model. | ['Louis ten Bosch', 'Joris Driesen', 'Hugo Van hamme', 'Lou Boves'] | On a Computational Model for Language Acquisition: Modeling Cross-Speaker Generalisation | 316,253 |
Petri nets formalism facilitates analysis of complex biomolecular structural data | ['Anna Gogolinska', 'Rafal Jakubowski', 'Wieslaw Nowak'] | Petri nets formalism facilitates analysis of complex biomolecular structural data | 699,791 |
In this paper, we show how synthesis can help implement interesting functions involving pattern matching and algebraic data types. One of the novel aspects of this work is the combination of type inference and counterexample-guided inductive synthesis (CEGIS) in order to support very high-level notations for describing the space of possible implementations that the synthesizer should consider. The paper also describes a set of optimizations that significantly improve the performance and scalability of the system. #R##N#The approach is evaluated on a set of case studies which most notably include synthesizing desugaring functions for lambda calculus that force the synthesizer to discover Church encodings for pairs and boolean operations, as well as a procedure to generate constraints for type inference. | ['Jeevana Priya Inala', 'Xiaokang Qiu', 'Ben Lerner', 'Armando Solar-Lezama'] | Type Assisted Synthesis of Recursive Transformers on Algebraic Data Types | 588,516 |
Transparency is a popular feature in a distributed system where users can access any local or remote resources just as if they were local. The paper proposes a protocol which combines the features of transparency and shortest path. The result is a bridge which supports self learning and distributed routing computation. Since this bridge has all routing facilities as a router, it is called brouter (i.e. bridge+router). Brouters are compared with current bridge schemes. Also, performance aspects of the protocol are examined. > | ['Ying-Dar Lin', 'Mario Gerla'] | Brouter: the transparent bridge with shortest path in interconnected LANs | 122,631 |
This paper proposes a novel tongue-operated joy- stick device for severely disabled persons. The human tongue has superior movement and tactile sensations. By providing force information during the device's operation, user can skillfully control life supporting equipment, such as electric powered wheelchairs, robotic manipulators for meals through interaction with this equipment. Therefore, we designed a joystick mechanism that enables not only the generation of control commands for the equipment but also the adjustment of the reaction force during its operation. The adjustment of the reaction force enables the user to know if there is any interference between the equipment and the environment and to improve task performance. In our proposed mechanism, the elastic pins surround the tip of the joystick and restrict its movement by this contact. The reaction force is controlled easily by adjusting the support length of the elastic pins. This paper describes the detailed mechanism and its basic performance through several experiments. | ['Shinya Kajikawa', 'Kyohei Takahashi', 'Akihide Mihara'] | A joystick interface for tongue operation with adjustable reaction force feedback | 578,574 |
Water management is crucial to all societies. In addition to the technical challenges of moving large volumes of water from often distant sources to the populations that use them, water management entails a social challenge as well. In this paper we present a linked simulation framework in which a large-scale hydrological Water Balance Model (WBM) is linked to an Agent-Based Model (ABM) in which agents represent urban water managers. We present a test case in which agents plan individual water schedules to meet their consumers' needs, and optionally can interact when scheduled amounts fall short of actual demand. The simulation framework allows us to examine the impact of these relationships on the larger hydrology of the region, under different policy structures and water stress. We present a case study based on water management in Phoenix, Arizona, along the Central Arizona Project (CAP) canal. | ['John T. Murphy', 'Jonathan Ozik', 'Nicholson T. Collier', 'Mark Altaweel', 'Richard B. Lammers', 'Alexander Prusevich', 'Andrew D. Kliskey', 'Lilian Alessa'] | Simulating regional hydrology and water management: an integrated agent-based approach | 652,809 |
The Design, Implementation, and Evaluation of a Banded Linear Solver for Distributed-Memory Parallel Computers | ['Anshul Gupta', 'Fred G. Gustavson', 'Mahesh V. Joshi', 'Sivan Toledo'] | The Design, Implementation, and Evaluation of a Banded Linear Solver for Distributed-Memory Parallel Computers | 292,472 |
Secret Sharing Schemes with General Access Structures (Full version). | ['Jian Liu', 'Sihem Mesnager', 'Lusheng Chen'] | Secret Sharing Schemes with General Access Structures (Full version). | 775,909 |
The Derivational Complexity Induced by the Dependency Pair Method | ['Georg Moser', 'Andreas Schnabl'] | The Derivational Complexity Induced by the Dependency Pair Method | 16,422 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.